]>
Commit | Line | Data |
---|---|---|
41dbbb37 TS |
1 | /* Lowering pass for OMP directives. Converts OMP directives into explicit |
2 | calls to the runtime library (libgomp), data marshalling to implement data | |
3 | sharing and copying clauses, offloading to accelerators, and more. | |
4 | ||
953ff289 DN |
5 | Contributed by Diego Novillo <dnovillo@redhat.com> |
6 | ||
818ab71a | 7 | Copyright (C) 2005-2016 Free Software Foundation, Inc. |
953ff289 DN |
8 | |
9 | This file is part of GCC. | |
10 | ||
11 | GCC is free software; you can redistribute it and/or modify it under | |
12 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 13 | Software Foundation; either version 3, or (at your option) any later |
953ff289 DN |
14 | version. |
15 | ||
16 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
17 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
18 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
19 | for more details. | |
20 | ||
21 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
22 | along with GCC; see the file COPYING3. If not see |
23 | <http://www.gnu.org/licenses/>. */ | |
953ff289 DN |
24 | |
25 | #include "config.h" | |
26 | #include "system.h" | |
27 | #include "coretypes.h" | |
c7131fb2 | 28 | #include "backend.h" |
957060b5 AM |
29 | #include "target.h" |
30 | #include "rtl.h" | |
953ff289 | 31 | #include "tree.h" |
c7131fb2 | 32 | #include "gimple.h" |
957060b5 AM |
33 | #include "cfghooks.h" |
34 | #include "alloc-pool.h" | |
35 | #include "tree-pass.h" | |
c7131fb2 | 36 | #include "ssa.h" |
957060b5 AM |
37 | #include "expmed.h" |
38 | #include "optabs.h" | |
39 | #include "emit-rtl.h" | |
40 | #include "cgraph.h" | |
41 | #include "pretty-print.h" | |
42 | #include "diagnostic-core.h" | |
c7131fb2 | 43 | #include "alias.h" |
40e23961 | 44 | #include "fold-const.h" |
d8a2d370 | 45 | #include "stor-layout.h" |
60393bbc | 46 | #include "cfganal.h" |
2fb9a547 AM |
47 | #include "internal-fn.h" |
48 | #include "gimple-fold.h" | |
45b0be94 | 49 | #include "gimplify.h" |
5be5c238 | 50 | #include "gimple-iterator.h" |
18f429e2 | 51 | #include "gimplify-me.h" |
5be5c238 | 52 | #include "gimple-walk.h" |
726a989a | 53 | #include "tree-iterator.h" |
953ff289 DN |
54 | #include "tree-inline.h" |
55 | #include "langhooks.h" | |
442b4905 | 56 | #include "tree-cfg.h" |
442b4905 | 57 | #include "tree-into-ssa.h" |
36566b39 | 58 | #include "flags.h" |
36566b39 PK |
59 | #include "dojump.h" |
60 | #include "explow.h" | |
61 | #include "calls.h" | |
36566b39 PK |
62 | #include "varasm.h" |
63 | #include "stmt.h" | |
d8a2d370 | 64 | #include "expr.h" |
442b4905 | 65 | #include "tree-dfa.h" |
7a300452 | 66 | #include "tree-ssa.h" |
953ff289 | 67 | #include "except.h" |
6be42dd4 | 68 | #include "splay-tree.h" |
a509ebb5 | 69 | #include "cfgloop.h" |
ec6fe917 | 70 | #include "common/common-target.h" |
0645c1a2 | 71 | #include "omp-low.h" |
4484a35a AM |
72 | #include "gimple-low.h" |
73 | #include "tree-cfgcleanup.h" | |
dd912cb8 | 74 | #include "symbol-summary.h" |
0136f8f0 | 75 | #include "ipa-prop.h" |
1fe37220 | 76 | #include "tree-nested.h" |
0136f8f0 | 77 | #include "tree-eh.h" |
9a771876 | 78 | #include "cilk.h" |
1f6be682 | 79 | #include "context.h" |
ec6fe917 | 80 | #include "lto-section-names.h" |
41dbbb37 | 81 | #include "gomp-constants.h" |
9bd46bc9 | 82 | #include "gimple-pretty-print.h" |
b2b40051 MJ |
83 | #include "symbol-summary.h" |
84 | #include "hsa.h" | |
85 | #include "params.h" | |
953ff289 | 86 | |
41dbbb37 | 87 | /* Lowering of OMP parallel and workshare constructs proceeds in two |
953ff289 DN |
88 | phases. The first phase scans the function looking for OMP statements |
89 | and then for variables that must be replaced to satisfy data sharing | |
90 | clauses. The second phase expands code for the constructs, as well as | |
c0220ea4 | 91 | re-gimplifying things when variables have been replaced with complex |
953ff289 DN |
92 | expressions. |
93 | ||
7ebaeab5 | 94 | Final code generation is done by pass_expand_omp. The flowgraph is |
41dbbb37 TS |
95 | scanned for regions which are then moved to a new |
96 | function, to be invoked by the thread library, or offloaded. */ | |
953ff289 | 97 | |
41dbbb37 | 98 | /* OMP region information. Every parallel and workshare |
0645c1a2 | 99 | directive is enclosed between two markers, the OMP_* directive |
d9a6bd32 | 100 | and a corresponding GIMPLE_OMP_RETURN statement. */ |
0645c1a2 AM |
101 | |
102 | struct omp_region | |
103 | { | |
104 | /* The enclosing region. */ | |
105 | struct omp_region *outer; | |
106 | ||
107 | /* First child region. */ | |
108 | struct omp_region *inner; | |
109 | ||
110 | /* Next peer region. */ | |
111 | struct omp_region *next; | |
112 | ||
113 | /* Block containing the omp directive as its last stmt. */ | |
114 | basic_block entry; | |
115 | ||
d9a6bd32 | 116 | /* Block containing the GIMPLE_OMP_RETURN as its last stmt. */ |
0645c1a2 AM |
117 | basic_block exit; |
118 | ||
d9a6bd32 | 119 | /* Block containing the GIMPLE_OMP_CONTINUE as its last stmt. */ |
0645c1a2 AM |
120 | basic_block cont; |
121 | ||
122 | /* If this is a combined parallel+workshare region, this is a list | |
123 | of additional arguments needed by the combined parallel+workshare | |
124 | library call. */ | |
125 | vec<tree, va_gc> *ws_args; | |
126 | ||
127 | /* The code for the omp directive of this region. */ | |
128 | enum gimple_code type; | |
129 | ||
d9a6bd32 | 130 | /* Schedule kind, only used for GIMPLE_OMP_FOR type regions. */ |
0645c1a2 AM |
131 | enum omp_clause_schedule_kind sched_kind; |
132 | ||
e01d41e5 JJ |
133 | /* Schedule modifiers. */ |
134 | unsigned char sched_modifiers; | |
135 | ||
0645c1a2 AM |
136 | /* True if this is a combined parallel+workshare region. */ |
137 | bool is_combined_parallel; | |
d9a6bd32 JJ |
138 | |
139 | /* The ordered stmt if type is GIMPLE_OMP_ORDERED and it has | |
140 | a depend clause. */ | |
141 | gomp_ordered *ord_stmt; | |
0645c1a2 AM |
142 | }; |
143 | ||
953ff289 DN |
144 | /* Context structure. Used to store information about each parallel |
145 | directive in the code. */ | |
146 | ||
a79683d5 | 147 | struct omp_context |
953ff289 DN |
148 | { |
149 | /* This field must be at the beginning, as we do "inheritance": Some | |
150 | callback functions for tree-inline.c (e.g., omp_copy_decl) | |
151 | receive a copy_body_data pointer that is up-casted to an | |
152 | omp_context pointer. */ | |
153 | copy_body_data cb; | |
154 | ||
155 | /* The tree of contexts corresponding to the encountered constructs. */ | |
156 | struct omp_context *outer; | |
355fe088 | 157 | gimple *stmt; |
953ff289 | 158 | |
b8698a0f | 159 | /* Map variables to fields in a structure that allows communication |
953ff289 DN |
160 | between sending and receiving threads. */ |
161 | splay_tree field_map; | |
162 | tree record_type; | |
163 | tree sender_decl; | |
164 | tree receiver_decl; | |
165 | ||
a68ab351 JJ |
166 | /* These are used just by task contexts, if task firstprivate fn is |
167 | needed. srecord_type is used to communicate from the thread | |
168 | that encountered the task construct to task firstprivate fn, | |
169 | record_type is allocated by GOMP_task, initialized by task firstprivate | |
170 | fn and passed to the task body fn. */ | |
171 | splay_tree sfield_map; | |
172 | tree srecord_type; | |
173 | ||
953ff289 DN |
174 | /* A chain of variables to add to the top-level block surrounding the |
175 | construct. In the case of a parallel, this is in the child function. */ | |
176 | tree block_vars; | |
177 | ||
acf0174b JJ |
178 | /* Label to which GOMP_cancel{,llation_point} and explicit and implicit |
179 | barriers should jump to during omplower pass. */ | |
180 | tree cancel_label; | |
181 | ||
953ff289 DN |
182 | /* What to do with variables with implicitly determined sharing |
183 | attributes. */ | |
184 | enum omp_clause_default_kind default_kind; | |
185 | ||
186 | /* Nesting depth of this context. Used to beautify error messages re | |
187 | invalid gotos. The outermost ctx is depth 1, with depth 0 being | |
188 | reserved for the main body of the function. */ | |
189 | int depth; | |
190 | ||
953ff289 DN |
191 | /* True if this parallel directive is nested within another. */ |
192 | bool is_nested; | |
acf0174b JJ |
193 | |
194 | /* True if this construct can be cancelled. */ | |
195 | bool cancellable; | |
a79683d5 | 196 | }; |
953ff289 | 197 | |
41dbbb37 TS |
198 | /* A structure holding the elements of: |
199 | for (V = N1; V cond N2; V += STEP) [...] */ | |
953ff289 | 200 | |
a68ab351 JJ |
201 | struct omp_for_data_loop |
202 | { | |
203 | tree v, n1, n2, step; | |
204 | enum tree_code cond_code; | |
205 | }; | |
206 | ||
50674e96 | 207 | /* A structure describing the main elements of a parallel loop. */ |
953ff289 | 208 | |
50674e96 | 209 | struct omp_for_data |
953ff289 | 210 | { |
a68ab351 | 211 | struct omp_for_data_loop loop; |
726a989a | 212 | tree chunk_size; |
538dd0b7 | 213 | gomp_for *for_stmt; |
a68ab351 JJ |
214 | tree pre, iter_type; |
215 | int collapse; | |
d9a6bd32 JJ |
216 | int ordered; |
217 | bool have_nowait, have_ordered, simd_schedule; | |
e01d41e5 | 218 | unsigned char sched_modifiers; |
953ff289 | 219 | enum omp_clause_schedule_kind sched_kind; |
a68ab351 | 220 | struct omp_for_data_loop *loops; |
953ff289 DN |
221 | }; |
222 | ||
9bd46bc9 NS |
223 | /* Describe the OpenACC looping structure of a function. The entire |
224 | function is held in a 'NULL' loop. */ | |
225 | ||
226 | struct oacc_loop | |
227 | { | |
228 | oacc_loop *parent; /* Containing loop. */ | |
229 | ||
230 | oacc_loop *child; /* First inner loop. */ | |
231 | ||
232 | oacc_loop *sibling; /* Next loop within same parent. */ | |
233 | ||
234 | location_t loc; /* Location of the loop start. */ | |
235 | ||
236 | gcall *marker; /* Initial head marker. */ | |
237 | ||
238 | gcall *heads[GOMP_DIM_MAX]; /* Head marker functions. */ | |
239 | gcall *tails[GOMP_DIM_MAX]; /* Tail marker functions. */ | |
240 | ||
241 | tree routine; /* Pseudo-loop enclosing a routine. */ | |
242 | ||
243 | unsigned mask; /* Partitioning mask. */ | |
244 | unsigned flags; /* Partitioning flags. */ | |
245 | tree chunk_size; /* Chunk size. */ | |
246 | gcall *head_end; /* Final marker of head sequence. */ | |
247 | }; | |
248 | ||
249 | /* Flags for an OpenACC loop. */ | |
250 | ||
251 | enum oacc_loop_flags { | |
252 | OLF_SEQ = 1u << 0, /* Explicitly sequential */ | |
253 | OLF_AUTO = 1u << 1, /* Compiler chooses axes. */ | |
254 | OLF_INDEPENDENT = 1u << 2, /* Iterations are known independent. */ | |
255 | OLF_GANG_STATIC = 1u << 3, /* Gang partitioning is static (has op). */ | |
256 | ||
257 | /* Explicitly specified loop axes. */ | |
258 | OLF_DIM_BASE = 4, | |
259 | OLF_DIM_GANG = 1u << (OLF_DIM_BASE + GOMP_DIM_GANG), | |
260 | OLF_DIM_WORKER = 1u << (OLF_DIM_BASE + GOMP_DIM_WORKER), | |
261 | OLF_DIM_VECTOR = 1u << (OLF_DIM_BASE + GOMP_DIM_VECTOR), | |
262 | ||
263 | OLF_MAX = OLF_DIM_BASE + GOMP_DIM_MAX | |
264 | }; | |
265 | ||
50674e96 | 266 | |
953ff289 | 267 | static splay_tree all_contexts; |
a68ab351 | 268 | static int taskreg_nesting_level; |
acf0174b | 269 | static int target_nesting_level; |
0645c1a2 | 270 | static struct omp_region *root_omp_region; |
a68ab351 | 271 | static bitmap task_shared_vars; |
5771c391 | 272 | static vec<omp_context *> taskreg_contexts; |
e01d41e5 | 273 | static bool omp_any_child_fn_dumped; |
953ff289 | 274 | |
26127932 | 275 | static void scan_omp (gimple_seq *, omp_context *); |
726a989a | 276 | static tree scan_omp_1_op (tree *, int *, void *); |
56102c7f | 277 | static gphi *find_phi_with_arg_on_edge (tree, edge); |
726a989a RB |
278 | |
279 | #define WALK_SUBSTMTS \ | |
280 | case GIMPLE_BIND: \ | |
281 | case GIMPLE_TRY: \ | |
282 | case GIMPLE_CATCH: \ | |
283 | case GIMPLE_EH_FILTER: \ | |
0a35513e | 284 | case GIMPLE_TRANSACTION: \ |
726a989a RB |
285 | /* The sub-statements for these should be walked. */ \ |
286 | *handled_ops_p = false; \ | |
287 | break; | |
288 | ||
e4834818 NS |
289 | /* Return true if CTX corresponds to an oacc parallel region. */ |
290 | ||
291 | static bool | |
292 | is_oacc_parallel (omp_context *ctx) | |
293 | { | |
294 | enum gimple_code outer_type = gimple_code (ctx->stmt); | |
295 | return ((outer_type == GIMPLE_OMP_TARGET) | |
296 | && (gimple_omp_target_kind (ctx->stmt) | |
297 | == GF_OMP_TARGET_KIND_OACC_PARALLEL)); | |
298 | } | |
299 | ||
300 | /* Return true if CTX corresponds to an oacc kernels region. */ | |
301 | ||
302 | static bool | |
303 | is_oacc_kernels (omp_context *ctx) | |
304 | { | |
305 | enum gimple_code outer_type = gimple_code (ctx->stmt); | |
306 | return ((outer_type == GIMPLE_OMP_TARGET) | |
307 | && (gimple_omp_target_kind (ctx->stmt) | |
308 | == GF_OMP_TARGET_KIND_OACC_KERNELS)); | |
309 | } | |
310 | ||
d9a6bd32 JJ |
311 | /* If DECL is the artificial dummy VAR_DECL created for non-static |
312 | data member privatization, return the underlying "this" parameter, | |
313 | otherwise return NULL. */ | |
314 | ||
315 | tree | |
316 | omp_member_access_dummy_var (tree decl) | |
317 | { | |
318 | if (!VAR_P (decl) | |
319 | || !DECL_ARTIFICIAL (decl) | |
320 | || !DECL_IGNORED_P (decl) | |
321 | || !DECL_HAS_VALUE_EXPR_P (decl) | |
322 | || !lang_hooks.decls.omp_disregard_value_expr (decl, false)) | |
323 | return NULL_TREE; | |
324 | ||
325 | tree v = DECL_VALUE_EXPR (decl); | |
326 | if (TREE_CODE (v) != COMPONENT_REF) | |
327 | return NULL_TREE; | |
328 | ||
329 | while (1) | |
330 | switch (TREE_CODE (v)) | |
331 | { | |
332 | case COMPONENT_REF: | |
333 | case MEM_REF: | |
334 | case INDIRECT_REF: | |
335 | CASE_CONVERT: | |
336 | case POINTER_PLUS_EXPR: | |
337 | v = TREE_OPERAND (v, 0); | |
338 | continue; | |
339 | case PARM_DECL: | |
340 | if (DECL_CONTEXT (v) == current_function_decl | |
341 | && DECL_ARTIFICIAL (v) | |
342 | && TREE_CODE (TREE_TYPE (v)) == POINTER_TYPE) | |
343 | return v; | |
344 | return NULL_TREE; | |
345 | default: | |
346 | return NULL_TREE; | |
347 | } | |
348 | } | |
349 | ||
350 | /* Helper for unshare_and_remap, called through walk_tree. */ | |
351 | ||
352 | static tree | |
353 | unshare_and_remap_1 (tree *tp, int *walk_subtrees, void *data) | |
354 | { | |
355 | tree *pair = (tree *) data; | |
356 | if (*tp == pair[0]) | |
357 | { | |
358 | *tp = unshare_expr (pair[1]); | |
359 | *walk_subtrees = 0; | |
360 | } | |
361 | else if (IS_TYPE_OR_DECL_P (*tp)) | |
362 | *walk_subtrees = 0; | |
363 | return NULL_TREE; | |
364 | } | |
365 | ||
366 | /* Return unshare_expr (X) with all occurrences of FROM | |
367 | replaced with TO. */ | |
368 | ||
369 | static tree | |
370 | unshare_and_remap (tree x, tree from, tree to) | |
371 | { | |
372 | tree pair[2] = { from, to }; | |
373 | x = unshare_expr (x); | |
374 | walk_tree (&x, unshare_and_remap_1, pair, NULL); | |
375 | return x; | |
376 | } | |
377 | ||
ec6fe917 IV |
378 | /* Holds offload tables with decls. */ |
379 | vec<tree, va_gc> *offload_funcs, *offload_vars; | |
380 | ||
726a989a RB |
381 | /* Convenience function for calling scan_omp_1_op on tree operands. */ |
382 | ||
383 | static inline tree | |
384 | scan_omp_op (tree *tp, omp_context *ctx) | |
385 | { | |
386 | struct walk_stmt_info wi; | |
387 | ||
388 | memset (&wi, 0, sizeof (wi)); | |
389 | wi.info = ctx; | |
390 | wi.want_locations = true; | |
391 | ||
392 | return walk_tree (tp, scan_omp_1_op, &wi, NULL); | |
393 | } | |
394 | ||
355a7673 | 395 | static void lower_omp (gimple_seq *, omp_context *); |
8ca5b2a2 JJ |
396 | static tree lookup_decl_in_outer_ctx (tree, omp_context *); |
397 | static tree maybe_lookup_decl_in_outer_ctx (tree, omp_context *); | |
953ff289 | 398 | |
41dbbb37 | 399 | /* Find an OMP clause of type KIND within CLAUSES. */ |
953ff289 | 400 | |
917948d3 | 401 | tree |
e0c68ce9 | 402 | find_omp_clause (tree clauses, enum omp_clause_code kind) |
953ff289 DN |
403 | { |
404 | for (; clauses ; clauses = OMP_CLAUSE_CHAIN (clauses)) | |
aaf46ef9 | 405 | if (OMP_CLAUSE_CODE (clauses) == kind) |
953ff289 DN |
406 | return clauses; |
407 | ||
408 | return NULL_TREE; | |
409 | } | |
410 | ||
411 | /* Return true if CTX is for an omp parallel. */ | |
412 | ||
413 | static inline bool | |
414 | is_parallel_ctx (omp_context *ctx) | |
415 | { | |
726a989a | 416 | return gimple_code (ctx->stmt) == GIMPLE_OMP_PARALLEL; |
953ff289 DN |
417 | } |
418 | ||
50674e96 | 419 | |
a68ab351 JJ |
420 | /* Return true if CTX is for an omp task. */ |
421 | ||
422 | static inline bool | |
423 | is_task_ctx (omp_context *ctx) | |
424 | { | |
726a989a | 425 | return gimple_code (ctx->stmt) == GIMPLE_OMP_TASK; |
a68ab351 JJ |
426 | } |
427 | ||
428 | ||
d9a6bd32 JJ |
429 | /* Return true if CTX is for an omp taskloop. */ |
430 | ||
431 | static inline bool | |
432 | is_taskloop_ctx (omp_context *ctx) | |
433 | { | |
434 | return gimple_code (ctx->stmt) == GIMPLE_OMP_FOR | |
435 | && gimple_omp_for_kind (ctx->stmt) == GF_OMP_FOR_KIND_TASKLOOP; | |
436 | } | |
437 | ||
438 | ||
a68ab351 JJ |
439 | /* Return true if CTX is for an omp parallel or omp task. */ |
440 | ||
441 | static inline bool | |
442 | is_taskreg_ctx (omp_context *ctx) | |
443 | { | |
d9a6bd32 | 444 | return is_parallel_ctx (ctx) || is_task_ctx (ctx); |
a68ab351 JJ |
445 | } |
446 | ||
447 | ||
50674e96 | 448 | /* Return true if REGION is a combined parallel+workshare region. */ |
953ff289 DN |
449 | |
450 | static inline bool | |
50674e96 DN |
451 | is_combined_parallel (struct omp_region *region) |
452 | { | |
453 | return region->is_combined_parallel; | |
454 | } | |
455 | ||
b2b40051 MJ |
456 | /* Adjust *COND_CODE and *N2 so that the former is either LT_EXPR or |
457 | GT_EXPR. */ | |
458 | ||
459 | static void | |
460 | adjust_for_condition (location_t loc, enum tree_code *cond_code, tree *n2) | |
461 | { | |
462 | switch (*cond_code) | |
463 | { | |
464 | case LT_EXPR: | |
465 | case GT_EXPR: | |
466 | case NE_EXPR: | |
467 | break; | |
468 | case LE_EXPR: | |
469 | if (POINTER_TYPE_P (TREE_TYPE (*n2))) | |
470 | *n2 = fold_build_pointer_plus_hwi_loc (loc, *n2, 1); | |
471 | else | |
472 | *n2 = fold_build2_loc (loc, PLUS_EXPR, TREE_TYPE (*n2), *n2, | |
473 | build_int_cst (TREE_TYPE (*n2), 1)); | |
474 | *cond_code = LT_EXPR; | |
475 | break; | |
476 | case GE_EXPR: | |
477 | if (POINTER_TYPE_P (TREE_TYPE (*n2))) | |
478 | *n2 = fold_build_pointer_plus_hwi_loc (loc, *n2, -1); | |
479 | else | |
480 | *n2 = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (*n2), *n2, | |
481 | build_int_cst (TREE_TYPE (*n2), 1)); | |
482 | *cond_code = GT_EXPR; | |
483 | break; | |
484 | default: | |
485 | gcc_unreachable (); | |
486 | } | |
487 | } | |
488 | ||
489 | /* Return the looping step from INCR, extracted from the step of a gimple omp | |
490 | for statement. */ | |
491 | ||
492 | static tree | |
493 | get_omp_for_step_from_incr (location_t loc, tree incr) | |
494 | { | |
495 | tree step; | |
496 | switch (TREE_CODE (incr)) | |
497 | { | |
498 | case PLUS_EXPR: | |
499 | step = TREE_OPERAND (incr, 1); | |
500 | break; | |
501 | case POINTER_PLUS_EXPR: | |
502 | step = fold_convert (ssizetype, TREE_OPERAND (incr, 1)); | |
503 | break; | |
504 | case MINUS_EXPR: | |
505 | step = TREE_OPERAND (incr, 1); | |
506 | step = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (step), step); | |
507 | break; | |
508 | default: | |
509 | gcc_unreachable (); | |
510 | } | |
511 | return step; | |
512 | } | |
50674e96 DN |
513 | |
514 | /* Extract the header elements of parallel loop FOR_STMT and store | |
515 | them into *FD. */ | |
516 | ||
517 | static void | |
538dd0b7 | 518 | extract_omp_for_data (gomp_for *for_stmt, struct omp_for_data *fd, |
a68ab351 | 519 | struct omp_for_data_loop *loops) |
50674e96 | 520 | { |
a68ab351 JJ |
521 | tree t, var, *collapse_iter, *collapse_count; |
522 | tree count = NULL_TREE, iter_type = long_integer_type_node; | |
523 | struct omp_for_data_loop *loop; | |
524 | int i; | |
525 | struct omp_for_data_loop dummy_loop; | |
db3927fb | 526 | location_t loc = gimple_location (for_stmt); |
0aadce73 | 527 | bool simd = gimple_omp_for_kind (for_stmt) & GF_OMP_FOR_SIMD; |
acf0174b JJ |
528 | bool distribute = gimple_omp_for_kind (for_stmt) |
529 | == GF_OMP_FOR_KIND_DISTRIBUTE; | |
d9a6bd32 JJ |
530 | bool taskloop = gimple_omp_for_kind (for_stmt) |
531 | == GF_OMP_FOR_KIND_TASKLOOP; | |
532 | tree iterv, countv; | |
50674e96 DN |
533 | |
534 | fd->for_stmt = for_stmt; | |
535 | fd->pre = NULL; | |
d9a6bd32 | 536 | if (gimple_omp_for_collapse (for_stmt) > 1) |
a68ab351 JJ |
537 | fd->loops = loops; |
538 | else | |
539 | fd->loops = &fd->loop; | |
50674e96 | 540 | |
acf0174b JJ |
541 | fd->have_nowait = distribute || simd; |
542 | fd->have_ordered = false; | |
d9a6bd32 JJ |
543 | fd->collapse = 1; |
544 | fd->ordered = 0; | |
50674e96 | 545 | fd->sched_kind = OMP_CLAUSE_SCHEDULE_STATIC; |
e01d41e5 | 546 | fd->sched_modifiers = 0; |
50674e96 | 547 | fd->chunk_size = NULL_TREE; |
d9a6bd32 | 548 | fd->simd_schedule = false; |
9a771876 JJ |
549 | if (gimple_omp_for_kind (fd->for_stmt) == GF_OMP_FOR_KIND_CILKFOR) |
550 | fd->sched_kind = OMP_CLAUSE_SCHEDULE_CILKFOR; | |
a68ab351 JJ |
551 | collapse_iter = NULL; |
552 | collapse_count = NULL; | |
50674e96 | 553 | |
726a989a | 554 | for (t = gimple_omp_for_clauses (for_stmt); t ; t = OMP_CLAUSE_CHAIN (t)) |
aaf46ef9 | 555 | switch (OMP_CLAUSE_CODE (t)) |
50674e96 DN |
556 | { |
557 | case OMP_CLAUSE_NOWAIT: | |
558 | fd->have_nowait = true; | |
559 | break; | |
560 | case OMP_CLAUSE_ORDERED: | |
561 | fd->have_ordered = true; | |
d9a6bd32 JJ |
562 | if (OMP_CLAUSE_ORDERED_EXPR (t)) |
563 | fd->ordered = tree_to_shwi (OMP_CLAUSE_ORDERED_EXPR (t)); | |
50674e96 DN |
564 | break; |
565 | case OMP_CLAUSE_SCHEDULE: | |
d9a6bd32 | 566 | gcc_assert (!distribute && !taskloop); |
e01d41e5 JJ |
567 | fd->sched_kind |
568 | = (enum omp_clause_schedule_kind) | |
569 | (OMP_CLAUSE_SCHEDULE_KIND (t) & OMP_CLAUSE_SCHEDULE_MASK); | |
570 | fd->sched_modifiers = (OMP_CLAUSE_SCHEDULE_KIND (t) | |
571 | & ~OMP_CLAUSE_SCHEDULE_MASK); | |
50674e96 | 572 | fd->chunk_size = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (t); |
d9a6bd32 | 573 | fd->simd_schedule = OMP_CLAUSE_SCHEDULE_SIMD (t); |
50674e96 | 574 | break; |
acf0174b JJ |
575 | case OMP_CLAUSE_DIST_SCHEDULE: |
576 | gcc_assert (distribute); | |
577 | fd->chunk_size = OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (t); | |
578 | break; | |
a68ab351 | 579 | case OMP_CLAUSE_COLLAPSE: |
d9a6bd32 | 580 | fd->collapse = tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (t)); |
a68ab351 JJ |
581 | if (fd->collapse > 1) |
582 | { | |
583 | collapse_iter = &OMP_CLAUSE_COLLAPSE_ITERVAR (t); | |
584 | collapse_count = &OMP_CLAUSE_COLLAPSE_COUNT (t); | |
585 | } | |
34f2124e | 586 | break; |
50674e96 DN |
587 | default: |
588 | break; | |
589 | } | |
d9a6bd32 JJ |
590 | if (fd->ordered && fd->collapse == 1 && loops != NULL) |
591 | { | |
592 | fd->loops = loops; | |
593 | iterv = NULL_TREE; | |
594 | countv = NULL_TREE; | |
595 | collapse_iter = &iterv; | |
596 | collapse_count = &countv; | |
597 | } | |
50674e96 | 598 | |
a68ab351 JJ |
599 | /* FIXME: for now map schedule(auto) to schedule(static). |
600 | There should be analysis to determine whether all iterations | |
601 | are approximately the same amount of work (then schedule(static) | |
1cbc62c0 | 602 | is best) or if it varies (then schedule(dynamic,N) is better). */ |
a68ab351 JJ |
603 | if (fd->sched_kind == OMP_CLAUSE_SCHEDULE_AUTO) |
604 | { | |
605 | fd->sched_kind = OMP_CLAUSE_SCHEDULE_STATIC; | |
606 | gcc_assert (fd->chunk_size == NULL); | |
607 | } | |
608 | gcc_assert (fd->collapse == 1 || collapse_iter != NULL); | |
d9a6bd32 JJ |
609 | if (taskloop) |
610 | fd->sched_kind = OMP_CLAUSE_SCHEDULE_RUNTIME; | |
50674e96 DN |
611 | if (fd->sched_kind == OMP_CLAUSE_SCHEDULE_RUNTIME) |
612 | gcc_assert (fd->chunk_size == NULL); | |
613 | else if (fd->chunk_size == NULL) | |
614 | { | |
615 | /* We only need to compute a default chunk size for ordered | |
616 | static loops and dynamic loops. */ | |
a68ab351 | 617 | if (fd->sched_kind != OMP_CLAUSE_SCHEDULE_STATIC |
acf0174b | 618 | || fd->have_ordered) |
50674e96 DN |
619 | fd->chunk_size = (fd->sched_kind == OMP_CLAUSE_SCHEDULE_STATIC) |
620 | ? integer_zero_node : integer_one_node; | |
621 | } | |
a68ab351 | 622 | |
d9a6bd32 JJ |
623 | int cnt = fd->ordered ? fd->ordered : fd->collapse; |
624 | for (i = 0; i < cnt; i++) | |
a68ab351 | 625 | { |
d9a6bd32 | 626 | if (i == 0 && fd->collapse == 1 && (fd->ordered == 0 || loops == NULL)) |
a68ab351 JJ |
627 | loop = &fd->loop; |
628 | else if (loops != NULL) | |
629 | loop = loops + i; | |
630 | else | |
631 | loop = &dummy_loop; | |
632 | ||
726a989a | 633 | loop->v = gimple_omp_for_index (for_stmt, i); |
a68ab351 JJ |
634 | gcc_assert (SSA_VAR_P (loop->v)); |
635 | gcc_assert (TREE_CODE (TREE_TYPE (loop->v)) == INTEGER_TYPE | |
636 | || TREE_CODE (TREE_TYPE (loop->v)) == POINTER_TYPE); | |
637 | var = TREE_CODE (loop->v) == SSA_NAME ? SSA_NAME_VAR (loop->v) : loop->v; | |
726a989a | 638 | loop->n1 = gimple_omp_for_initial (for_stmt, i); |
a68ab351 | 639 | |
726a989a RB |
640 | loop->cond_code = gimple_omp_for_cond (for_stmt, i); |
641 | loop->n2 = gimple_omp_for_final (for_stmt, i); | |
b2b40051 MJ |
642 | gcc_assert (loop->cond_code != NE_EXPR |
643 | || gimple_omp_for_kind (for_stmt) == GF_OMP_FOR_KIND_CILKSIMD | |
644 | || gimple_omp_for_kind (for_stmt) == GF_OMP_FOR_KIND_CILKFOR); | |
645 | adjust_for_condition (loc, &loop->cond_code, &loop->n2); | |
a68ab351 | 646 | |
726a989a | 647 | t = gimple_omp_for_incr (for_stmt, i); |
a68ab351 | 648 | gcc_assert (TREE_OPERAND (t, 0) == var); |
b2b40051 | 649 | loop->step = get_omp_for_step_from_incr (loc, t); |
a68ab351 | 650 | |
acf0174b JJ |
651 | if (simd |
652 | || (fd->sched_kind == OMP_CLAUSE_SCHEDULE_STATIC | |
653 | && !fd->have_ordered)) | |
74bf76ed JJ |
654 | { |
655 | if (fd->collapse == 1) | |
656 | iter_type = TREE_TYPE (loop->v); | |
657 | else if (i == 0 | |
658 | || TYPE_PRECISION (iter_type) | |
659 | < TYPE_PRECISION (TREE_TYPE (loop->v))) | |
660 | iter_type | |
661 | = build_nonstandard_integer_type | |
acf0174b | 662 | (TYPE_PRECISION (TREE_TYPE (loop->v)), 1); |
74bf76ed JJ |
663 | } |
664 | else if (iter_type != long_long_unsigned_type_node) | |
a68ab351 JJ |
665 | { |
666 | if (POINTER_TYPE_P (TREE_TYPE (loop->v))) | |
667 | iter_type = long_long_unsigned_type_node; | |
668 | else if (TYPE_UNSIGNED (TREE_TYPE (loop->v)) | |
669 | && TYPE_PRECISION (TREE_TYPE (loop->v)) | |
670 | >= TYPE_PRECISION (iter_type)) | |
671 | { | |
672 | tree n; | |
673 | ||
674 | if (loop->cond_code == LT_EXPR) | |
db3927fb AH |
675 | n = fold_build2_loc (loc, |
676 | PLUS_EXPR, TREE_TYPE (loop->v), | |
a68ab351 JJ |
677 | loop->n2, loop->step); |
678 | else | |
679 | n = loop->n1; | |
680 | if (TREE_CODE (n) != INTEGER_CST | |
681 | || tree_int_cst_lt (TYPE_MAX_VALUE (iter_type), n)) | |
682 | iter_type = long_long_unsigned_type_node; | |
683 | } | |
684 | else if (TYPE_PRECISION (TREE_TYPE (loop->v)) | |
685 | > TYPE_PRECISION (iter_type)) | |
686 | { | |
687 | tree n1, n2; | |
688 | ||
689 | if (loop->cond_code == LT_EXPR) | |
690 | { | |
691 | n1 = loop->n1; | |
db3927fb AH |
692 | n2 = fold_build2_loc (loc, |
693 | PLUS_EXPR, TREE_TYPE (loop->v), | |
a68ab351 JJ |
694 | loop->n2, loop->step); |
695 | } | |
696 | else | |
697 | { | |
db3927fb AH |
698 | n1 = fold_build2_loc (loc, |
699 | MINUS_EXPR, TREE_TYPE (loop->v), | |
a68ab351 JJ |
700 | loop->n2, loop->step); |
701 | n2 = loop->n1; | |
702 | } | |
703 | if (TREE_CODE (n1) != INTEGER_CST | |
704 | || TREE_CODE (n2) != INTEGER_CST | |
705 | || !tree_int_cst_lt (TYPE_MIN_VALUE (iter_type), n1) | |
706 | || !tree_int_cst_lt (n2, TYPE_MAX_VALUE (iter_type))) | |
707 | iter_type = long_long_unsigned_type_node; | |
708 | } | |
709 | } | |
710 | ||
d9a6bd32 JJ |
711 | if (i >= fd->collapse) |
712 | continue; | |
713 | ||
a68ab351 JJ |
714 | if (collapse_count && *collapse_count == NULL) |
715 | { | |
5a0f4dd3 JJ |
716 | t = fold_binary (loop->cond_code, boolean_type_node, |
717 | fold_convert (TREE_TYPE (loop->v), loop->n1), | |
718 | fold_convert (TREE_TYPE (loop->v), loop->n2)); | |
719 | if (t && integer_zerop (t)) | |
720 | count = build_zero_cst (long_long_unsigned_type_node); | |
721 | else if ((i == 0 || count != NULL_TREE) | |
722 | && TREE_CODE (TREE_TYPE (loop->v)) == INTEGER_TYPE | |
723 | && TREE_CONSTANT (loop->n1) | |
724 | && TREE_CONSTANT (loop->n2) | |
725 | && TREE_CODE (loop->step) == INTEGER_CST) | |
a68ab351 JJ |
726 | { |
727 | tree itype = TREE_TYPE (loop->v); | |
728 | ||
729 | if (POINTER_TYPE_P (itype)) | |
96f9265a | 730 | itype = signed_type_for (itype); |
a68ab351 | 731 | t = build_int_cst (itype, (loop->cond_code == LT_EXPR ? -1 : 1)); |
db3927fb AH |
732 | t = fold_build2_loc (loc, |
733 | PLUS_EXPR, itype, | |
734 | fold_convert_loc (loc, itype, loop->step), t); | |
735 | t = fold_build2_loc (loc, PLUS_EXPR, itype, t, | |
736 | fold_convert_loc (loc, itype, loop->n2)); | |
737 | t = fold_build2_loc (loc, MINUS_EXPR, itype, t, | |
738 | fold_convert_loc (loc, itype, loop->n1)); | |
a68ab351 | 739 | if (TYPE_UNSIGNED (itype) && loop->cond_code == GT_EXPR) |
db3927fb AH |
740 | t = fold_build2_loc (loc, TRUNC_DIV_EXPR, itype, |
741 | fold_build1_loc (loc, NEGATE_EXPR, itype, t), | |
742 | fold_build1_loc (loc, NEGATE_EXPR, itype, | |
743 | fold_convert_loc (loc, itype, | |
744 | loop->step))); | |
a68ab351 | 745 | else |
db3927fb AH |
746 | t = fold_build2_loc (loc, TRUNC_DIV_EXPR, itype, t, |
747 | fold_convert_loc (loc, itype, loop->step)); | |
748 | t = fold_convert_loc (loc, long_long_unsigned_type_node, t); | |
a68ab351 | 749 | if (count != NULL_TREE) |
db3927fb AH |
750 | count = fold_build2_loc (loc, |
751 | MULT_EXPR, long_long_unsigned_type_node, | |
a68ab351 JJ |
752 | count, t); |
753 | else | |
754 | count = t; | |
755 | if (TREE_CODE (count) != INTEGER_CST) | |
756 | count = NULL_TREE; | |
757 | } | |
5a0f4dd3 | 758 | else if (count && !integer_zerop (count)) |
a68ab351 JJ |
759 | count = NULL_TREE; |
760 | } | |
761 | } | |
762 | ||
74bf76ed | 763 | if (count |
acf0174b JJ |
764 | && !simd |
765 | && (fd->sched_kind != OMP_CLAUSE_SCHEDULE_STATIC | |
766 | || fd->have_ordered)) | |
a68ab351 JJ |
767 | { |
768 | if (!tree_int_cst_lt (count, TYPE_MAX_VALUE (long_integer_type_node))) | |
769 | iter_type = long_long_unsigned_type_node; | |
770 | else | |
771 | iter_type = long_integer_type_node; | |
772 | } | |
773 | else if (collapse_iter && *collapse_iter != NULL) | |
774 | iter_type = TREE_TYPE (*collapse_iter); | |
775 | fd->iter_type = iter_type; | |
776 | if (collapse_iter && *collapse_iter == NULL) | |
777 | *collapse_iter = create_tmp_var (iter_type, ".iter"); | |
778 | if (collapse_count && *collapse_count == NULL) | |
779 | { | |
780 | if (count) | |
db3927fb | 781 | *collapse_count = fold_convert_loc (loc, iter_type, count); |
a68ab351 JJ |
782 | else |
783 | *collapse_count = create_tmp_var (iter_type, ".count"); | |
784 | } | |
785 | ||
d9a6bd32 | 786 | if (fd->collapse > 1 || (fd->ordered && loops)) |
a68ab351 JJ |
787 | { |
788 | fd->loop.v = *collapse_iter; | |
789 | fd->loop.n1 = build_int_cst (TREE_TYPE (fd->loop.v), 0); | |
790 | fd->loop.n2 = *collapse_count; | |
791 | fd->loop.step = build_int_cst (TREE_TYPE (fd->loop.v), 1); | |
792 | fd->loop.cond_code = LT_EXPR; | |
793 | } | |
d9a6bd32 JJ |
794 | else if (loops) |
795 | loops[0] = fd->loop; | |
50674e96 DN |
796 | } |
797 | ||
798 | ||
799 | /* Given two blocks PAR_ENTRY_BB and WS_ENTRY_BB such that WS_ENTRY_BB | |
800 | is the immediate dominator of PAR_ENTRY_BB, return true if there | |
801 | are no data dependencies that would prevent expanding the parallel | |
802 | directive at PAR_ENTRY_BB as a combined parallel+workshare region. | |
803 | ||
804 | When expanding a combined parallel+workshare region, the call to | |
805 | the child function may need additional arguments in the case of | |
726a989a RB |
806 | GIMPLE_OMP_FOR regions. In some cases, these arguments are |
807 | computed out of variables passed in from the parent to the child | |
808 | via 'struct .omp_data_s'. For instance: | |
50674e96 DN |
809 | |
810 | #pragma omp parallel for schedule (guided, i * 4) | |
811 | for (j ...) | |
812 | ||
813 | Is lowered into: | |
814 | ||
815 | # BLOCK 2 (PAR_ENTRY_BB) | |
816 | .omp_data_o.i = i; | |
817 | #pragma omp parallel [child fn: bar.omp_fn.0 ( ..., D.1598) | |
b8698a0f | 818 | |
50674e96 DN |
819 | # BLOCK 3 (WS_ENTRY_BB) |
820 | .omp_data_i = &.omp_data_o; | |
821 | D.1667 = .omp_data_i->i; | |
822 | D.1598 = D.1667 * 4; | |
823 | #pragma omp for schedule (guided, D.1598) | |
824 | ||
825 | When we outline the parallel region, the call to the child function | |
826 | 'bar.omp_fn.0' will need the value D.1598 in its argument list, but | |
827 | that value is computed *after* the call site. So, in principle we | |
828 | cannot do the transformation. | |
829 | ||
830 | To see whether the code in WS_ENTRY_BB blocks the combined | |
831 | parallel+workshare call, we collect all the variables used in the | |
726a989a | 832 | GIMPLE_OMP_FOR header check whether they appear on the LHS of any |
50674e96 DN |
833 | statement in WS_ENTRY_BB. If so, then we cannot emit the combined |
834 | call. | |
835 | ||
836 | FIXME. If we had the SSA form built at this point, we could merely | |
837 | hoist the code in block 3 into block 2 and be done with it. But at | |
838 | this point we don't have dataflow information and though we could | |
839 | hack something up here, it is really not worth the aggravation. */ | |
840 | ||
841 | static bool | |
0f900dfa | 842 | workshare_safe_to_combine_p (basic_block ws_entry_bb) |
50674e96 DN |
843 | { |
844 | struct omp_for_data fd; | |
355fe088 | 845 | gimple *ws_stmt = last_stmt (ws_entry_bb); |
50674e96 | 846 | |
726a989a | 847 | if (gimple_code (ws_stmt) == GIMPLE_OMP_SECTIONS) |
50674e96 DN |
848 | return true; |
849 | ||
726a989a | 850 | gcc_assert (gimple_code (ws_stmt) == GIMPLE_OMP_FOR); |
50674e96 | 851 | |
538dd0b7 | 852 | extract_omp_for_data (as_a <gomp_for *> (ws_stmt), &fd, NULL); |
a68ab351 JJ |
853 | |
854 | if (fd.collapse > 1 && TREE_CODE (fd.loop.n2) != INTEGER_CST) | |
855 | return false; | |
856 | if (fd.iter_type != long_integer_type_node) | |
857 | return false; | |
50674e96 DN |
858 | |
859 | /* FIXME. We give up too easily here. If any of these arguments | |
860 | are not constants, they will likely involve variables that have | |
861 | been mapped into fields of .omp_data_s for sharing with the child | |
862 | function. With appropriate data flow, it would be possible to | |
863 | see through this. */ | |
a68ab351 JJ |
864 | if (!is_gimple_min_invariant (fd.loop.n1) |
865 | || !is_gimple_min_invariant (fd.loop.n2) | |
866 | || !is_gimple_min_invariant (fd.loop.step) | |
50674e96 DN |
867 | || (fd.chunk_size && !is_gimple_min_invariant (fd.chunk_size))) |
868 | return false; | |
869 | ||
870 | return true; | |
871 | } | |
872 | ||
873 | ||
d9a6bd32 JJ |
874 | static int omp_max_vf (void); |
875 | ||
876 | /* Adjust CHUNK_SIZE from SCHEDULE clause, depending on simd modifier | |
877 | presence (SIMD_SCHEDULE). */ | |
878 | ||
879 | static tree | |
880 | omp_adjust_chunk_size (tree chunk_size, bool simd_schedule) | |
881 | { | |
882 | if (!simd_schedule) | |
883 | return chunk_size; | |
884 | ||
885 | int vf = omp_max_vf (); | |
886 | if (vf == 1) | |
887 | return chunk_size; | |
888 | ||
889 | tree type = TREE_TYPE (chunk_size); | |
890 | chunk_size = fold_build2 (PLUS_EXPR, type, chunk_size, | |
891 | build_int_cst (type, vf - 1)); | |
892 | return fold_build2 (BIT_AND_EXPR, type, chunk_size, | |
893 | build_int_cst (type, -vf)); | |
894 | } | |
895 | ||
896 | ||
50674e96 DN |
897 | /* Collect additional arguments needed to emit a combined |
898 | parallel+workshare call. WS_STMT is the workshare directive being | |
899 | expanded. */ | |
900 | ||
9771b263 | 901 | static vec<tree, va_gc> * |
355fe088 | 902 | get_ws_args_for (gimple *par_stmt, gimple *ws_stmt) |
50674e96 DN |
903 | { |
904 | tree t; | |
db3927fb | 905 | location_t loc = gimple_location (ws_stmt); |
9771b263 | 906 | vec<tree, va_gc> *ws_args; |
50674e96 | 907 | |
538dd0b7 | 908 | if (gomp_for *for_stmt = dyn_cast <gomp_for *> (ws_stmt)) |
50674e96 DN |
909 | { |
910 | struct omp_for_data fd; | |
acf0174b | 911 | tree n1, n2; |
50674e96 | 912 | |
538dd0b7 | 913 | extract_omp_for_data (for_stmt, &fd, NULL); |
acf0174b JJ |
914 | n1 = fd.loop.n1; |
915 | n2 = fd.loop.n2; | |
916 | ||
538dd0b7 | 917 | if (gimple_omp_for_combined_into_p (for_stmt)) |
acf0174b JJ |
918 | { |
919 | tree innerc | |
920 | = find_omp_clause (gimple_omp_parallel_clauses (par_stmt), | |
921 | OMP_CLAUSE__LOOPTEMP_); | |
922 | gcc_assert (innerc); | |
923 | n1 = OMP_CLAUSE_DECL (innerc); | |
924 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
925 | OMP_CLAUSE__LOOPTEMP_); | |
926 | gcc_assert (innerc); | |
927 | n2 = OMP_CLAUSE_DECL (innerc); | |
928 | } | |
50674e96 | 929 | |
9771b263 | 930 | vec_alloc (ws_args, 3 + (fd.chunk_size != 0)); |
50674e96 | 931 | |
acf0174b | 932 | t = fold_convert_loc (loc, long_integer_type_node, n1); |
9771b263 | 933 | ws_args->quick_push (t); |
50674e96 | 934 | |
acf0174b | 935 | t = fold_convert_loc (loc, long_integer_type_node, n2); |
9771b263 | 936 | ws_args->quick_push (t); |
50674e96 | 937 | |
3bb06db4 | 938 | t = fold_convert_loc (loc, long_integer_type_node, fd.loop.step); |
9771b263 | 939 | ws_args->quick_push (t); |
3bb06db4 NF |
940 | |
941 | if (fd.chunk_size) | |
942 | { | |
943 | t = fold_convert_loc (loc, long_integer_type_node, fd.chunk_size); | |
d9a6bd32 | 944 | t = omp_adjust_chunk_size (t, fd.simd_schedule); |
9771b263 | 945 | ws_args->quick_push (t); |
3bb06db4 | 946 | } |
50674e96 DN |
947 | |
948 | return ws_args; | |
949 | } | |
726a989a | 950 | else if (gimple_code (ws_stmt) == GIMPLE_OMP_SECTIONS) |
50674e96 | 951 | { |
e5c95afe | 952 | /* Number of sections is equal to the number of edges from the |
726a989a RB |
953 | GIMPLE_OMP_SECTIONS_SWITCH statement, except for the one to |
954 | the exit of the sections region. */ | |
955 | basic_block bb = single_succ (gimple_bb (ws_stmt)); | |
e5c95afe | 956 | t = build_int_cst (unsigned_type_node, EDGE_COUNT (bb->succs) - 1); |
9771b263 DN |
957 | vec_alloc (ws_args, 1); |
958 | ws_args->quick_push (t); | |
3bb06db4 | 959 | return ws_args; |
50674e96 DN |
960 | } |
961 | ||
962 | gcc_unreachable (); | |
963 | } | |
964 | ||
965 | ||
966 | /* Discover whether REGION is a combined parallel+workshare region. */ | |
967 | ||
968 | static void | |
969 | determine_parallel_type (struct omp_region *region) | |
953ff289 | 970 | { |
50674e96 DN |
971 | basic_block par_entry_bb, par_exit_bb; |
972 | basic_block ws_entry_bb, ws_exit_bb; | |
973 | ||
d3c673c7 | 974 | if (region == NULL || region->inner == NULL |
e5c95afe ZD |
975 | || region->exit == NULL || region->inner->exit == NULL |
976 | || region->inner->cont == NULL) | |
50674e96 DN |
977 | return; |
978 | ||
979 | /* We only support parallel+for and parallel+sections. */ | |
726a989a RB |
980 | if (region->type != GIMPLE_OMP_PARALLEL |
981 | || (region->inner->type != GIMPLE_OMP_FOR | |
982 | && region->inner->type != GIMPLE_OMP_SECTIONS)) | |
50674e96 DN |
983 | return; |
984 | ||
985 | /* Check for perfect nesting PAR_ENTRY_BB -> WS_ENTRY_BB and | |
986 | WS_EXIT_BB -> PAR_EXIT_BB. */ | |
777f7f9a RH |
987 | par_entry_bb = region->entry; |
988 | par_exit_bb = region->exit; | |
989 | ws_entry_bb = region->inner->entry; | |
990 | ws_exit_bb = region->inner->exit; | |
50674e96 DN |
991 | |
992 | if (single_succ (par_entry_bb) == ws_entry_bb | |
993 | && single_succ (ws_exit_bb) == par_exit_bb | |
0f900dfa | 994 | && workshare_safe_to_combine_p (ws_entry_bb) |
726a989a | 995 | && (gimple_omp_parallel_combined_p (last_stmt (par_entry_bb)) |
69f1837b JJ |
996 | || (last_and_only_stmt (ws_entry_bb) |
997 | && last_and_only_stmt (par_exit_bb)))) | |
50674e96 | 998 | { |
355fe088 TS |
999 | gimple *par_stmt = last_stmt (par_entry_bb); |
1000 | gimple *ws_stmt = last_stmt (ws_entry_bb); | |
777f7f9a | 1001 | |
726a989a | 1002 | if (region->inner->type == GIMPLE_OMP_FOR) |
50674e96 DN |
1003 | { |
1004 | /* If this is a combined parallel loop, we need to determine | |
1005 | whether or not to use the combined library calls. There | |
1006 | are two cases where we do not apply the transformation: | |
1007 | static loops and any kind of ordered loop. In the first | |
1008 | case, we already open code the loop so there is no need | |
1009 | to do anything else. In the latter case, the combined | |
1010 | parallel loop call would still need extra synchronization | |
1011 | to implement ordered semantics, so there would not be any | |
1012 | gain in using the combined call. */ | |
726a989a | 1013 | tree clauses = gimple_omp_for_clauses (ws_stmt); |
50674e96 DN |
1014 | tree c = find_omp_clause (clauses, OMP_CLAUSE_SCHEDULE); |
1015 | if (c == NULL | |
e01d41e5 JJ |
1016 | || ((OMP_CLAUSE_SCHEDULE_KIND (c) & OMP_CLAUSE_SCHEDULE_MASK) |
1017 | == OMP_CLAUSE_SCHEDULE_STATIC) | |
50674e96 DN |
1018 | || find_omp_clause (clauses, OMP_CLAUSE_ORDERED)) |
1019 | { | |
1020 | region->is_combined_parallel = false; | |
1021 | region->inner->is_combined_parallel = false; | |
1022 | return; | |
1023 | } | |
1024 | } | |
1025 | ||
1026 | region->is_combined_parallel = true; | |
1027 | region->inner->is_combined_parallel = true; | |
acf0174b | 1028 | region->ws_args = get_ws_args_for (par_stmt, ws_stmt); |
50674e96 | 1029 | } |
953ff289 DN |
1030 | } |
1031 | ||
50674e96 | 1032 | |
953ff289 DN |
1033 | /* Return true if EXPR is variable sized. */ |
1034 | ||
1035 | static inline bool | |
22ea9ec0 | 1036 | is_variable_sized (const_tree expr) |
953ff289 DN |
1037 | { |
1038 | return !TREE_CONSTANT (TYPE_SIZE_UNIT (TREE_TYPE (expr))); | |
1039 | } | |
1040 | ||
1041 | /* Return true if DECL is a reference type. */ | |
1042 | ||
1043 | static inline bool | |
1044 | is_reference (tree decl) | |
1045 | { | |
1046 | return lang_hooks.decls.omp_privatize_by_reference (decl); | |
1047 | } | |
1048 | ||
41dbbb37 TS |
1049 | /* Return the type of a decl. If the decl is reference type, |
1050 | return its base type. */ | |
1051 | static inline tree | |
1052 | get_base_type (tree decl) | |
1053 | { | |
1054 | tree type = TREE_TYPE (decl); | |
1055 | if (is_reference (decl)) | |
1056 | type = TREE_TYPE (type); | |
1057 | return type; | |
1058 | } | |
1059 | ||
1060 | /* Lookup variables. The "maybe" form | |
953ff289 DN |
1061 | allows for the variable form to not have been entered, otherwise we |
1062 | assert that the variable must have been entered. */ | |
1063 | ||
1064 | static inline tree | |
1065 | lookup_decl (tree var, omp_context *ctx) | |
1066 | { | |
b787e7a2 | 1067 | tree *n = ctx->cb.decl_map->get (var); |
6be42dd4 | 1068 | return *n; |
953ff289 DN |
1069 | } |
1070 | ||
1071 | static inline tree | |
7c8f7639 | 1072 | maybe_lookup_decl (const_tree var, omp_context *ctx) |
953ff289 | 1073 | { |
b787e7a2 | 1074 | tree *n = ctx->cb.decl_map->get (const_cast<tree> (var)); |
6be42dd4 | 1075 | return n ? *n : NULL_TREE; |
953ff289 DN |
1076 | } |
1077 | ||
1078 | static inline tree | |
1079 | lookup_field (tree var, omp_context *ctx) | |
1080 | { | |
1081 | splay_tree_node n; | |
1082 | n = splay_tree_lookup (ctx->field_map, (splay_tree_key) var); | |
1083 | return (tree) n->value; | |
1084 | } | |
1085 | ||
a68ab351 | 1086 | static inline tree |
d9a6bd32 | 1087 | lookup_sfield (splay_tree_key key, omp_context *ctx) |
a68ab351 JJ |
1088 | { |
1089 | splay_tree_node n; | |
1090 | n = splay_tree_lookup (ctx->sfield_map | |
d9a6bd32 | 1091 | ? ctx->sfield_map : ctx->field_map, key); |
a68ab351 JJ |
1092 | return (tree) n->value; |
1093 | } | |
1094 | ||
953ff289 | 1095 | static inline tree |
d9a6bd32 JJ |
1096 | lookup_sfield (tree var, omp_context *ctx) |
1097 | { | |
1098 | return lookup_sfield ((splay_tree_key) var, ctx); | |
1099 | } | |
1100 | ||
1101 | static inline tree | |
1102 | maybe_lookup_field (splay_tree_key key, omp_context *ctx) | |
953ff289 DN |
1103 | { |
1104 | splay_tree_node n; | |
d9a6bd32 | 1105 | n = splay_tree_lookup (ctx->field_map, key); |
953ff289 DN |
1106 | return n ? (tree) n->value : NULL_TREE; |
1107 | } | |
1108 | ||
d9a6bd32 JJ |
1109 | static inline tree |
1110 | maybe_lookup_field (tree var, omp_context *ctx) | |
1111 | { | |
1112 | return maybe_lookup_field ((splay_tree_key) var, ctx); | |
1113 | } | |
1114 | ||
7c8f7639 JJ |
1115 | /* Return true if DECL should be copied by pointer. SHARED_CTX is |
1116 | the parallel context if DECL is to be shared. */ | |
953ff289 DN |
1117 | |
1118 | static bool | |
a68ab351 | 1119 | use_pointer_for_field (tree decl, omp_context *shared_ctx) |
953ff289 DN |
1120 | { |
1121 | if (AGGREGATE_TYPE_P (TREE_TYPE (decl))) | |
1122 | return true; | |
1123 | ||
6fc0bb99 | 1124 | /* We can only use copy-in/copy-out semantics for shared variables |
953ff289 | 1125 | when we know the value is not accessible from an outer scope. */ |
7c8f7639 | 1126 | if (shared_ctx) |
953ff289 | 1127 | { |
41dbbb37 TS |
1128 | gcc_assert (!is_gimple_omp_oacc (shared_ctx->stmt)); |
1129 | ||
953ff289 DN |
1130 | /* ??? Trivially accessible from anywhere. But why would we even |
1131 | be passing an address in this case? Should we simply assert | |
1132 | this to be false, or should we have a cleanup pass that removes | |
1133 | these from the list of mappings? */ | |
1134 | if (TREE_STATIC (decl) || DECL_EXTERNAL (decl)) | |
1135 | return true; | |
1136 | ||
1137 | /* For variables with DECL_HAS_VALUE_EXPR_P set, we cannot tell | |
1138 | without analyzing the expression whether or not its location | |
1139 | is accessible to anyone else. In the case of nested parallel | |
1140 | regions it certainly may be. */ | |
077b0dfb | 1141 | if (TREE_CODE (decl) != RESULT_DECL && DECL_HAS_VALUE_EXPR_P (decl)) |
953ff289 DN |
1142 | return true; |
1143 | ||
1144 | /* Do not use copy-in/copy-out for variables that have their | |
1145 | address taken. */ | |
1146 | if (TREE_ADDRESSABLE (decl)) | |
1147 | return true; | |
7c8f7639 | 1148 | |
6d840d99 JJ |
1149 | /* lower_send_shared_vars only uses copy-in, but not copy-out |
1150 | for these. */ | |
1151 | if (TREE_READONLY (decl) | |
1152 | || ((TREE_CODE (decl) == RESULT_DECL | |
1153 | || TREE_CODE (decl) == PARM_DECL) | |
1154 | && DECL_BY_REFERENCE (decl))) | |
1155 | return false; | |
1156 | ||
7c8f7639 JJ |
1157 | /* Disallow copy-in/out in nested parallel if |
1158 | decl is shared in outer parallel, otherwise | |
1159 | each thread could store the shared variable | |
1160 | in its own copy-in location, making the | |
1161 | variable no longer really shared. */ | |
6d840d99 | 1162 | if (shared_ctx->is_nested) |
7c8f7639 JJ |
1163 | { |
1164 | omp_context *up; | |
1165 | ||
1166 | for (up = shared_ctx->outer; up; up = up->outer) | |
d9c194cb | 1167 | if (is_taskreg_ctx (up) && maybe_lookup_decl (decl, up)) |
7c8f7639 JJ |
1168 | break; |
1169 | ||
d9c194cb | 1170 | if (up) |
7c8f7639 JJ |
1171 | { |
1172 | tree c; | |
1173 | ||
726a989a | 1174 | for (c = gimple_omp_taskreg_clauses (up->stmt); |
7c8f7639 JJ |
1175 | c; c = OMP_CLAUSE_CHAIN (c)) |
1176 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED | |
1177 | && OMP_CLAUSE_DECL (c) == decl) | |
1178 | break; | |
1179 | ||
1180 | if (c) | |
25142650 | 1181 | goto maybe_mark_addressable_and_ret; |
7c8f7639 JJ |
1182 | } |
1183 | } | |
a68ab351 | 1184 | |
6d840d99 | 1185 | /* For tasks avoid using copy-in/out. As tasks can be |
a68ab351 JJ |
1186 | deferred or executed in different thread, when GOMP_task |
1187 | returns, the task hasn't necessarily terminated. */ | |
6d840d99 | 1188 | if (is_task_ctx (shared_ctx)) |
a68ab351 | 1189 | { |
25142650 JJ |
1190 | tree outer; |
1191 | maybe_mark_addressable_and_ret: | |
1192 | outer = maybe_lookup_decl_in_outer_ctx (decl, shared_ctx); | |
d9a6bd32 | 1193 | if (is_gimple_reg (outer) && !omp_member_access_dummy_var (outer)) |
a68ab351 JJ |
1194 | { |
1195 | /* Taking address of OUTER in lower_send_shared_vars | |
1196 | might need regimplification of everything that uses the | |
1197 | variable. */ | |
1198 | if (!task_shared_vars) | |
1199 | task_shared_vars = BITMAP_ALLOC (NULL); | |
1200 | bitmap_set_bit (task_shared_vars, DECL_UID (outer)); | |
1201 | TREE_ADDRESSABLE (outer) = 1; | |
1202 | } | |
1203 | return true; | |
1204 | } | |
953ff289 DN |
1205 | } |
1206 | ||
1207 | return false; | |
1208 | } | |
1209 | ||
917948d3 ZD |
1210 | /* Construct a new automatic decl similar to VAR. */ |
1211 | ||
1212 | static tree | |
1213 | omp_copy_decl_2 (tree var, tree name, tree type, omp_context *ctx) | |
1214 | { | |
1215 | tree copy = copy_var_decl (var, name, type); | |
1216 | ||
1217 | DECL_CONTEXT (copy) = current_function_decl; | |
910ad8de | 1218 | DECL_CHAIN (copy) = ctx->block_vars; |
d9a6bd32 JJ |
1219 | /* If VAR is listed in task_shared_vars, it means it wasn't |
1220 | originally addressable and is just because task needs to take | |
1221 | it's address. But we don't need to take address of privatizations | |
1222 | from that var. */ | |
1223 | if (TREE_ADDRESSABLE (var) | |
1224 | && task_shared_vars | |
1225 | && bitmap_bit_p (task_shared_vars, DECL_UID (var))) | |
1226 | TREE_ADDRESSABLE (copy) = 0; | |
953ff289 DN |
1227 | ctx->block_vars = copy; |
1228 | ||
1229 | return copy; | |
1230 | } | |
1231 | ||
1232 | static tree | |
1233 | omp_copy_decl_1 (tree var, omp_context *ctx) | |
1234 | { | |
1235 | return omp_copy_decl_2 (var, DECL_NAME (var), TREE_TYPE (var), ctx); | |
1236 | } | |
1237 | ||
a9a58711 JJ |
1238 | /* Build COMPONENT_REF and set TREE_THIS_VOLATILE and TREE_READONLY on it |
1239 | as appropriate. */ | |
1240 | static tree | |
1241 | omp_build_component_ref (tree obj, tree field) | |
1242 | { | |
1243 | tree ret = build3 (COMPONENT_REF, TREE_TYPE (field), obj, field, NULL); | |
1244 | if (TREE_THIS_VOLATILE (field)) | |
1245 | TREE_THIS_VOLATILE (ret) |= 1; | |
1246 | if (TREE_READONLY (field)) | |
1247 | TREE_READONLY (ret) |= 1; | |
1248 | return ret; | |
1249 | } | |
1250 | ||
953ff289 DN |
1251 | /* Build tree nodes to access the field for VAR on the receiver side. */ |
1252 | ||
1253 | static tree | |
1254 | build_receiver_ref (tree var, bool by_ref, omp_context *ctx) | |
1255 | { | |
1256 | tree x, field = lookup_field (var, ctx); | |
1257 | ||
1258 | /* If the receiver record type was remapped in the child function, | |
1259 | remap the field into the new record type. */ | |
1260 | x = maybe_lookup_field (field, ctx); | |
1261 | if (x != NULL) | |
1262 | field = x; | |
1263 | ||
70f34814 | 1264 | x = build_simple_mem_ref (ctx->receiver_decl); |
f1b9b669 | 1265 | TREE_THIS_NOTRAP (x) = 1; |
a9a58711 | 1266 | x = omp_build_component_ref (x, field); |
953ff289 | 1267 | if (by_ref) |
096b85f4 TV |
1268 | { |
1269 | x = build_simple_mem_ref (x); | |
1270 | TREE_THIS_NOTRAP (x) = 1; | |
1271 | } | |
953ff289 DN |
1272 | |
1273 | return x; | |
1274 | } | |
1275 | ||
1276 | /* Build tree nodes to access VAR in the scope outer to CTX. In the case | |
1277 | of a parallel, this is a component reference; for workshare constructs | |
1278 | this is some variable. */ | |
1279 | ||
1280 | static tree | |
d9a6bd32 | 1281 | build_outer_var_ref (tree var, omp_context *ctx, bool lastprivate = false) |
953ff289 DN |
1282 | { |
1283 | tree x; | |
1284 | ||
8ca5b2a2 | 1285 | if (is_global_var (maybe_lookup_decl_in_outer_ctx (var, ctx))) |
953ff289 DN |
1286 | x = var; |
1287 | else if (is_variable_sized (var)) | |
1288 | { | |
1289 | x = TREE_OPERAND (DECL_VALUE_EXPR (var), 0); | |
d9a6bd32 | 1290 | x = build_outer_var_ref (x, ctx, lastprivate); |
70f34814 | 1291 | x = build_simple_mem_ref (x); |
953ff289 | 1292 | } |
a68ab351 | 1293 | else if (is_taskreg_ctx (ctx)) |
953ff289 | 1294 | { |
7c8f7639 | 1295 | bool by_ref = use_pointer_for_field (var, NULL); |
953ff289 DN |
1296 | x = build_receiver_ref (var, by_ref, ctx); |
1297 | } | |
74bf76ed | 1298 | else if (gimple_code (ctx->stmt) == GIMPLE_OMP_FOR |
0aadce73 | 1299 | && gimple_omp_for_kind (ctx->stmt) & GF_OMP_FOR_SIMD) |
74bf76ed JJ |
1300 | { |
1301 | /* #pragma omp simd isn't a worksharing construct, and can reference even | |
1302 | private vars in its linear etc. clauses. */ | |
1303 | x = NULL_TREE; | |
1304 | if (ctx->outer && is_taskreg_ctx (ctx)) | |
1305 | x = lookup_decl (var, ctx->outer); | |
1306 | else if (ctx->outer) | |
f3b331d1 | 1307 | x = maybe_lookup_decl_in_outer_ctx (var, ctx); |
74bf76ed JJ |
1308 | if (x == NULL_TREE) |
1309 | x = var; | |
1310 | } | |
d9a6bd32 JJ |
1311 | else if (lastprivate && is_taskloop_ctx (ctx)) |
1312 | { | |
1313 | gcc_assert (ctx->outer); | |
1314 | splay_tree_node n | |
1315 | = splay_tree_lookup (ctx->outer->field_map, | |
1316 | (splay_tree_key) &DECL_UID (var)); | |
1317 | if (n == NULL) | |
1318 | { | |
1319 | if (is_global_var (maybe_lookup_decl_in_outer_ctx (var, ctx->outer))) | |
1320 | x = var; | |
1321 | else | |
1322 | x = lookup_decl (var, ctx->outer); | |
1323 | } | |
1324 | else | |
1325 | { | |
1326 | tree field = (tree) n->value; | |
1327 | /* If the receiver record type was remapped in the child function, | |
1328 | remap the field into the new record type. */ | |
1329 | x = maybe_lookup_field (field, ctx->outer); | |
1330 | if (x != NULL) | |
1331 | field = x; | |
1332 | ||
1333 | x = build_simple_mem_ref (ctx->outer->receiver_decl); | |
1334 | x = omp_build_component_ref (x, field); | |
1335 | if (use_pointer_for_field (var, ctx->outer)) | |
1336 | x = build_simple_mem_ref (x); | |
1337 | } | |
1338 | } | |
953ff289 | 1339 | else if (ctx->outer) |
b2b40051 MJ |
1340 | { |
1341 | omp_context *outer = ctx->outer; | |
1342 | if (gimple_code (outer->stmt) == GIMPLE_OMP_GRID_BODY) | |
1343 | { | |
1344 | outer = outer->outer; | |
1345 | gcc_assert (outer | |
1346 | && gimple_code (outer->stmt) != GIMPLE_OMP_GRID_BODY); | |
1347 | } | |
1348 | x = lookup_decl (var, outer); | |
1349 | } | |
eeb1d9e0 JJ |
1350 | else if (is_reference (var)) |
1351 | /* This can happen with orphaned constructs. If var is reference, it is | |
1352 | possible it is shared and as such valid. */ | |
1353 | x = var; | |
d9a6bd32 JJ |
1354 | else if (omp_member_access_dummy_var (var)) |
1355 | x = var; | |
953ff289 DN |
1356 | else |
1357 | gcc_unreachable (); | |
1358 | ||
d9a6bd32 JJ |
1359 | if (x == var) |
1360 | { | |
1361 | tree t = omp_member_access_dummy_var (var); | |
1362 | if (t) | |
1363 | { | |
1364 | x = DECL_VALUE_EXPR (var); | |
1365 | tree o = maybe_lookup_decl_in_outer_ctx (t, ctx); | |
1366 | if (o != t) | |
1367 | x = unshare_and_remap (x, t, o); | |
1368 | else | |
1369 | x = unshare_expr (x); | |
1370 | } | |
1371 | } | |
1372 | ||
953ff289 | 1373 | if (is_reference (var)) |
70f34814 | 1374 | x = build_simple_mem_ref (x); |
953ff289 DN |
1375 | |
1376 | return x; | |
1377 | } | |
1378 | ||
1379 | /* Build tree nodes to access the field for VAR on the sender side. */ | |
1380 | ||
1381 | static tree | |
d9a6bd32 | 1382 | build_sender_ref (splay_tree_key key, omp_context *ctx) |
953ff289 | 1383 | { |
d9a6bd32 | 1384 | tree field = lookup_sfield (key, ctx); |
a9a58711 | 1385 | return omp_build_component_ref (ctx->sender_decl, field); |
953ff289 DN |
1386 | } |
1387 | ||
d9a6bd32 JJ |
1388 | static tree |
1389 | build_sender_ref (tree var, omp_context *ctx) | |
1390 | { | |
1391 | return build_sender_ref ((splay_tree_key) var, ctx); | |
1392 | } | |
1393 | ||
86938de6 TV |
1394 | /* Add a new field for VAR inside the structure CTX->SENDER_DECL. If |
1395 | BASE_POINTERS_RESTRICT, declare the field with restrict. */ | |
953ff289 DN |
1396 | |
1397 | static void | |
86938de6 TV |
1398 | install_var_field (tree var, bool by_ref, int mask, omp_context *ctx, |
1399 | bool base_pointers_restrict = false) | |
953ff289 | 1400 | { |
a68ab351 | 1401 | tree field, type, sfield = NULL_TREE; |
d9a6bd32 | 1402 | splay_tree_key key = (splay_tree_key) var; |
953ff289 | 1403 | |
d9a6bd32 JJ |
1404 | if ((mask & 8) != 0) |
1405 | { | |
1406 | key = (splay_tree_key) &DECL_UID (var); | |
1407 | gcc_checking_assert (key != (splay_tree_key) var); | |
1408 | } | |
a68ab351 | 1409 | gcc_assert ((mask & 1) == 0 |
d9a6bd32 | 1410 | || !splay_tree_lookup (ctx->field_map, key)); |
a68ab351 | 1411 | gcc_assert ((mask & 2) == 0 || !ctx->sfield_map |
d9a6bd32 | 1412 | || !splay_tree_lookup (ctx->sfield_map, key)); |
41dbbb37 TS |
1413 | gcc_assert ((mask & 3) == 3 |
1414 | || !is_gimple_omp_oacc (ctx->stmt)); | |
953ff289 DN |
1415 | |
1416 | type = TREE_TYPE (var); | |
8498c16b TV |
1417 | /* Prevent redeclaring the var in the split-off function with a restrict |
1418 | pointer type. Note that we only clear type itself, restrict qualifiers in | |
1419 | the pointed-to type will be ignored by points-to analysis. */ | |
1420 | if (POINTER_TYPE_P (type) | |
1421 | && TYPE_RESTRICT (type)) | |
1422 | type = build_qualified_type (type, TYPE_QUALS (type) & ~TYPE_QUAL_RESTRICT); | |
1423 | ||
acf0174b JJ |
1424 | if (mask & 4) |
1425 | { | |
1426 | gcc_assert (TREE_CODE (type) == ARRAY_TYPE); | |
1427 | type = build_pointer_type (build_pointer_type (type)); | |
1428 | } | |
1429 | else if (by_ref) | |
86938de6 TV |
1430 | { |
1431 | type = build_pointer_type (type); | |
1432 | if (base_pointers_restrict) | |
1433 | type = build_qualified_type (type, TYPE_QUAL_RESTRICT); | |
1434 | } | |
a68ab351 JJ |
1435 | else if ((mask & 3) == 1 && is_reference (var)) |
1436 | type = TREE_TYPE (type); | |
953ff289 | 1437 | |
c2255bc4 AH |
1438 | field = build_decl (DECL_SOURCE_LOCATION (var), |
1439 | FIELD_DECL, DECL_NAME (var), type); | |
953ff289 DN |
1440 | |
1441 | /* Remember what variable this field was created for. This does have a | |
1442 | side effect of making dwarf2out ignore this member, so for helpful | |
1443 | debugging we clear it later in delete_omp_context. */ | |
1444 | DECL_ABSTRACT_ORIGIN (field) = var; | |
a68ab351 JJ |
1445 | if (type == TREE_TYPE (var)) |
1446 | { | |
1447 | DECL_ALIGN (field) = DECL_ALIGN (var); | |
1448 | DECL_USER_ALIGN (field) = DECL_USER_ALIGN (var); | |
1449 | TREE_THIS_VOLATILE (field) = TREE_THIS_VOLATILE (var); | |
1450 | } | |
1451 | else | |
1452 | DECL_ALIGN (field) = TYPE_ALIGN (type); | |
953ff289 | 1453 | |
a68ab351 JJ |
1454 | if ((mask & 3) == 3) |
1455 | { | |
1456 | insert_field_into_struct (ctx->record_type, field); | |
1457 | if (ctx->srecord_type) | |
1458 | { | |
c2255bc4 AH |
1459 | sfield = build_decl (DECL_SOURCE_LOCATION (var), |
1460 | FIELD_DECL, DECL_NAME (var), type); | |
a68ab351 JJ |
1461 | DECL_ABSTRACT_ORIGIN (sfield) = var; |
1462 | DECL_ALIGN (sfield) = DECL_ALIGN (field); | |
1463 | DECL_USER_ALIGN (sfield) = DECL_USER_ALIGN (field); | |
1464 | TREE_THIS_VOLATILE (sfield) = TREE_THIS_VOLATILE (field); | |
1465 | insert_field_into_struct (ctx->srecord_type, sfield); | |
1466 | } | |
1467 | } | |
1468 | else | |
1469 | { | |
1470 | if (ctx->srecord_type == NULL_TREE) | |
1471 | { | |
1472 | tree t; | |
1473 | ||
1474 | ctx->srecord_type = lang_hooks.types.make_type (RECORD_TYPE); | |
1475 | ctx->sfield_map = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
1476 | for (t = TYPE_FIELDS (ctx->record_type); t ; t = TREE_CHAIN (t)) | |
1477 | { | |
d9a6bd32 | 1478 | sfield = build_decl (DECL_SOURCE_LOCATION (t), |
c2255bc4 | 1479 | FIELD_DECL, DECL_NAME (t), TREE_TYPE (t)); |
a68ab351 JJ |
1480 | DECL_ABSTRACT_ORIGIN (sfield) = DECL_ABSTRACT_ORIGIN (t); |
1481 | insert_field_into_struct (ctx->srecord_type, sfield); | |
1482 | splay_tree_insert (ctx->sfield_map, | |
1483 | (splay_tree_key) DECL_ABSTRACT_ORIGIN (t), | |
1484 | (splay_tree_value) sfield); | |
1485 | } | |
1486 | } | |
1487 | sfield = field; | |
1488 | insert_field_into_struct ((mask & 1) ? ctx->record_type | |
1489 | : ctx->srecord_type, field); | |
1490 | } | |
953ff289 | 1491 | |
a68ab351 | 1492 | if (mask & 1) |
d9a6bd32 | 1493 | splay_tree_insert (ctx->field_map, key, (splay_tree_value) field); |
a68ab351 | 1494 | if ((mask & 2) && ctx->sfield_map) |
d9a6bd32 | 1495 | splay_tree_insert (ctx->sfield_map, key, (splay_tree_value) sfield); |
953ff289 DN |
1496 | } |
1497 | ||
1498 | static tree | |
1499 | install_var_local (tree var, omp_context *ctx) | |
1500 | { | |
1501 | tree new_var = omp_copy_decl_1 (var, ctx); | |
1502 | insert_decl_map (&ctx->cb, var, new_var); | |
1503 | return new_var; | |
1504 | } | |
1505 | ||
1506 | /* Adjust the replacement for DECL in CTX for the new context. This means | |
1507 | copying the DECL_VALUE_EXPR, and fixing up the type. */ | |
1508 | ||
1509 | static void | |
1510 | fixup_remapped_decl (tree decl, omp_context *ctx, bool private_debug) | |
1511 | { | |
1512 | tree new_decl, size; | |
1513 | ||
1514 | new_decl = lookup_decl (decl, ctx); | |
1515 | ||
1516 | TREE_TYPE (new_decl) = remap_type (TREE_TYPE (decl), &ctx->cb); | |
1517 | ||
1518 | if ((!TREE_CONSTANT (DECL_SIZE (new_decl)) || private_debug) | |
1519 | && DECL_HAS_VALUE_EXPR_P (decl)) | |
1520 | { | |
1521 | tree ve = DECL_VALUE_EXPR (decl); | |
726a989a | 1522 | walk_tree (&ve, copy_tree_body_r, &ctx->cb, NULL); |
953ff289 DN |
1523 | SET_DECL_VALUE_EXPR (new_decl, ve); |
1524 | DECL_HAS_VALUE_EXPR_P (new_decl) = 1; | |
1525 | } | |
1526 | ||
1527 | if (!TREE_CONSTANT (DECL_SIZE (new_decl))) | |
1528 | { | |
1529 | size = remap_decl (DECL_SIZE (decl), &ctx->cb); | |
1530 | if (size == error_mark_node) | |
1531 | size = TYPE_SIZE (TREE_TYPE (new_decl)); | |
1532 | DECL_SIZE (new_decl) = size; | |
1533 | ||
1534 | size = remap_decl (DECL_SIZE_UNIT (decl), &ctx->cb); | |
1535 | if (size == error_mark_node) | |
1536 | size = TYPE_SIZE_UNIT (TREE_TYPE (new_decl)); | |
1537 | DECL_SIZE_UNIT (new_decl) = size; | |
1538 | } | |
1539 | } | |
1540 | ||
1541 | /* The callback for remap_decl. Search all containing contexts for a | |
1542 | mapping of the variable; this avoids having to duplicate the splay | |
1543 | tree ahead of time. We know a mapping doesn't already exist in the | |
1544 | given context. Create new mappings to implement default semantics. */ | |
1545 | ||
1546 | static tree | |
1547 | omp_copy_decl (tree var, copy_body_data *cb) | |
1548 | { | |
1549 | omp_context *ctx = (omp_context *) cb; | |
1550 | tree new_var; | |
1551 | ||
953ff289 DN |
1552 | if (TREE_CODE (var) == LABEL_DECL) |
1553 | { | |
c2255bc4 | 1554 | new_var = create_artificial_label (DECL_SOURCE_LOCATION (var)); |
50674e96 | 1555 | DECL_CONTEXT (new_var) = current_function_decl; |
953ff289 DN |
1556 | insert_decl_map (&ctx->cb, var, new_var); |
1557 | return new_var; | |
1558 | } | |
1559 | ||
a68ab351 | 1560 | while (!is_taskreg_ctx (ctx)) |
953ff289 DN |
1561 | { |
1562 | ctx = ctx->outer; | |
1563 | if (ctx == NULL) | |
1564 | return var; | |
1565 | new_var = maybe_lookup_decl (var, ctx); | |
1566 | if (new_var) | |
1567 | return new_var; | |
1568 | } | |
1569 | ||
8ca5b2a2 JJ |
1570 | if (is_global_var (var) || decl_function_context (var) != ctx->cb.src_fn) |
1571 | return var; | |
1572 | ||
953ff289 DN |
1573 | return error_mark_node; |
1574 | } | |
1575 | ||
50674e96 | 1576 | |
50674e96 DN |
1577 | /* Debugging dumps for parallel regions. */ |
1578 | void dump_omp_region (FILE *, struct omp_region *, int); | |
1579 | void debug_omp_region (struct omp_region *); | |
1580 | void debug_all_omp_regions (void); | |
1581 | ||
1582 | /* Dump the parallel region tree rooted at REGION. */ | |
1583 | ||
1584 | void | |
1585 | dump_omp_region (FILE *file, struct omp_region *region, int indent) | |
1586 | { | |
777f7f9a | 1587 | fprintf (file, "%*sbb %d: %s\n", indent, "", region->entry->index, |
726a989a | 1588 | gimple_code_name[region->type]); |
50674e96 DN |
1589 | |
1590 | if (region->inner) | |
1591 | dump_omp_region (file, region->inner, indent + 4); | |
1592 | ||
777f7f9a RH |
1593 | if (region->cont) |
1594 | { | |
726a989a | 1595 | fprintf (file, "%*sbb %d: GIMPLE_OMP_CONTINUE\n", indent, "", |
777f7f9a RH |
1596 | region->cont->index); |
1597 | } | |
b8698a0f | 1598 | |
50674e96 | 1599 | if (region->exit) |
726a989a | 1600 | fprintf (file, "%*sbb %d: GIMPLE_OMP_RETURN\n", indent, "", |
777f7f9a | 1601 | region->exit->index); |
50674e96 | 1602 | else |
777f7f9a | 1603 | fprintf (file, "%*s[no exit marker]\n", indent, ""); |
50674e96 DN |
1604 | |
1605 | if (region->next) | |
777f7f9a | 1606 | dump_omp_region (file, region->next, indent); |
50674e96 DN |
1607 | } |
1608 | ||
24e47c76 | 1609 | DEBUG_FUNCTION void |
50674e96 DN |
1610 | debug_omp_region (struct omp_region *region) |
1611 | { | |
1612 | dump_omp_region (stderr, region, 0); | |
1613 | } | |
1614 | ||
24e47c76 | 1615 | DEBUG_FUNCTION void |
50674e96 DN |
1616 | debug_all_omp_regions (void) |
1617 | { | |
1618 | dump_omp_region (stderr, root_omp_region, 0); | |
1619 | } | |
1620 | ||
1621 | ||
1622 | /* Create a new parallel region starting at STMT inside region PARENT. */ | |
1623 | ||
0645c1a2 | 1624 | static struct omp_region * |
726a989a RB |
1625 | new_omp_region (basic_block bb, enum gimple_code type, |
1626 | struct omp_region *parent) | |
50674e96 | 1627 | { |
d3bfe4de | 1628 | struct omp_region *region = XCNEW (struct omp_region); |
50674e96 DN |
1629 | |
1630 | region->outer = parent; | |
777f7f9a RH |
1631 | region->entry = bb; |
1632 | region->type = type; | |
50674e96 DN |
1633 | |
1634 | if (parent) | |
1635 | { | |
1636 | /* This is a nested region. Add it to the list of inner | |
1637 | regions in PARENT. */ | |
1638 | region->next = parent->inner; | |
1639 | parent->inner = region; | |
1640 | } | |
777f7f9a | 1641 | else |
50674e96 DN |
1642 | { |
1643 | /* This is a toplevel region. Add it to the list of toplevel | |
1644 | regions in ROOT_OMP_REGION. */ | |
1645 | region->next = root_omp_region; | |
1646 | root_omp_region = region; | |
1647 | } | |
777f7f9a RH |
1648 | |
1649 | return region; | |
1650 | } | |
1651 | ||
1652 | /* Release the memory associated with the region tree rooted at REGION. */ | |
1653 | ||
1654 | static void | |
1655 | free_omp_region_1 (struct omp_region *region) | |
1656 | { | |
1657 | struct omp_region *i, *n; | |
1658 | ||
1659 | for (i = region->inner; i ; i = n) | |
50674e96 | 1660 | { |
777f7f9a RH |
1661 | n = i->next; |
1662 | free_omp_region_1 (i); | |
50674e96 DN |
1663 | } |
1664 | ||
777f7f9a RH |
1665 | free (region); |
1666 | } | |
50674e96 | 1667 | |
777f7f9a RH |
1668 | /* Release the memory for the entire omp region tree. */ |
1669 | ||
1670 | void | |
1671 | free_omp_regions (void) | |
1672 | { | |
1673 | struct omp_region *r, *n; | |
1674 | for (r = root_omp_region; r ; r = n) | |
1675 | { | |
1676 | n = r->next; | |
1677 | free_omp_region_1 (r); | |
1678 | } | |
1679 | root_omp_region = NULL; | |
50674e96 DN |
1680 | } |
1681 | ||
1682 | ||
953ff289 DN |
1683 | /* Create a new context, with OUTER_CTX being the surrounding context. */ |
1684 | ||
1685 | static omp_context * | |
355fe088 | 1686 | new_omp_context (gimple *stmt, omp_context *outer_ctx) |
953ff289 DN |
1687 | { |
1688 | omp_context *ctx = XCNEW (omp_context); | |
1689 | ||
1690 | splay_tree_insert (all_contexts, (splay_tree_key) stmt, | |
1691 | (splay_tree_value) ctx); | |
1692 | ctx->stmt = stmt; | |
1693 | ||
1694 | if (outer_ctx) | |
1695 | { | |
1696 | ctx->outer = outer_ctx; | |
1697 | ctx->cb = outer_ctx->cb; | |
1698 | ctx->cb.block = NULL; | |
1699 | ctx->depth = outer_ctx->depth + 1; | |
1700 | } | |
1701 | else | |
1702 | { | |
1703 | ctx->cb.src_fn = current_function_decl; | |
1704 | ctx->cb.dst_fn = current_function_decl; | |
d52f5295 | 1705 | ctx->cb.src_node = cgraph_node::get (current_function_decl); |
fe660d7b | 1706 | gcc_checking_assert (ctx->cb.src_node); |
953ff289 DN |
1707 | ctx->cb.dst_node = ctx->cb.src_node; |
1708 | ctx->cb.src_cfun = cfun; | |
1709 | ctx->cb.copy_decl = omp_copy_decl; | |
1d65f45c | 1710 | ctx->cb.eh_lp_nr = 0; |
953ff289 DN |
1711 | ctx->cb.transform_call_graph_edges = CB_CGE_MOVE; |
1712 | ctx->depth = 1; | |
1713 | } | |
1714 | ||
b787e7a2 | 1715 | ctx->cb.decl_map = new hash_map<tree, tree>; |
953ff289 DN |
1716 | |
1717 | return ctx; | |
1718 | } | |
1719 | ||
726a989a | 1720 | static gimple_seq maybe_catch_exception (gimple_seq); |
2368a460 JJ |
1721 | |
1722 | /* Finalize task copyfn. */ | |
1723 | ||
1724 | static void | |
538dd0b7 | 1725 | finalize_task_copyfn (gomp_task *task_stmt) |
2368a460 JJ |
1726 | { |
1727 | struct function *child_cfun; | |
af16bc76 | 1728 | tree child_fn; |
355a7673 | 1729 | gimple_seq seq = NULL, new_seq; |
538dd0b7 | 1730 | gbind *bind; |
2368a460 | 1731 | |
726a989a | 1732 | child_fn = gimple_omp_task_copy_fn (task_stmt); |
2368a460 JJ |
1733 | if (child_fn == NULL_TREE) |
1734 | return; | |
1735 | ||
1736 | child_cfun = DECL_STRUCT_FUNCTION (child_fn); | |
d7ed20db | 1737 | DECL_STRUCT_FUNCTION (child_fn)->curr_properties = cfun->curr_properties; |
2368a460 | 1738 | |
2368a460 | 1739 | push_cfun (child_cfun); |
3ad065ef | 1740 | bind = gimplify_body (child_fn, false); |
726a989a RB |
1741 | gimple_seq_add_stmt (&seq, bind); |
1742 | new_seq = maybe_catch_exception (seq); | |
1743 | if (new_seq != seq) | |
1744 | { | |
1745 | bind = gimple_build_bind (NULL, new_seq, NULL); | |
355a7673 | 1746 | seq = NULL; |
726a989a RB |
1747 | gimple_seq_add_stmt (&seq, bind); |
1748 | } | |
1749 | gimple_set_body (child_fn, seq); | |
2368a460 | 1750 | pop_cfun (); |
2368a460 | 1751 | |
d7ed20db | 1752 | /* Inform the callgraph about the new function. */ |
edafad14 TV |
1753 | cgraph_node *node = cgraph_node::get_create (child_fn); |
1754 | node->parallelized_function = 1; | |
d52f5295 | 1755 | cgraph_node::add_new_function (child_fn, false); |
2368a460 JJ |
1756 | } |
1757 | ||
953ff289 DN |
1758 | /* Destroy a omp_context data structures. Called through the splay tree |
1759 | value delete callback. */ | |
1760 | ||
1761 | static void | |
1762 | delete_omp_context (splay_tree_value value) | |
1763 | { | |
1764 | omp_context *ctx = (omp_context *) value; | |
1765 | ||
b787e7a2 | 1766 | delete ctx->cb.decl_map; |
953ff289 DN |
1767 | |
1768 | if (ctx->field_map) | |
1769 | splay_tree_delete (ctx->field_map); | |
a68ab351 JJ |
1770 | if (ctx->sfield_map) |
1771 | splay_tree_delete (ctx->sfield_map); | |
953ff289 DN |
1772 | |
1773 | /* We hijacked DECL_ABSTRACT_ORIGIN earlier. We need to clear it before | |
1774 | it produces corrupt debug information. */ | |
1775 | if (ctx->record_type) | |
1776 | { | |
1777 | tree t; | |
910ad8de | 1778 | for (t = TYPE_FIELDS (ctx->record_type); t ; t = DECL_CHAIN (t)) |
953ff289 DN |
1779 | DECL_ABSTRACT_ORIGIN (t) = NULL; |
1780 | } | |
a68ab351 JJ |
1781 | if (ctx->srecord_type) |
1782 | { | |
1783 | tree t; | |
910ad8de | 1784 | for (t = TYPE_FIELDS (ctx->srecord_type); t ; t = DECL_CHAIN (t)) |
a68ab351 JJ |
1785 | DECL_ABSTRACT_ORIGIN (t) = NULL; |
1786 | } | |
953ff289 | 1787 | |
2368a460 | 1788 | if (is_task_ctx (ctx)) |
538dd0b7 | 1789 | finalize_task_copyfn (as_a <gomp_task *> (ctx->stmt)); |
2368a460 | 1790 | |
953ff289 DN |
1791 | XDELETE (ctx); |
1792 | } | |
1793 | ||
1794 | /* Fix up RECEIVER_DECL with a type that has been remapped to the child | |
1795 | context. */ | |
1796 | ||
1797 | static void | |
1798 | fixup_child_record_type (omp_context *ctx) | |
1799 | { | |
1800 | tree f, type = ctx->record_type; | |
1801 | ||
b2b40051 MJ |
1802 | if (!ctx->receiver_decl) |
1803 | return; | |
953ff289 DN |
1804 | /* ??? It isn't sufficient to just call remap_type here, because |
1805 | variably_modified_type_p doesn't work the way we expect for | |
1806 | record types. Testing each field for whether it needs remapping | |
1807 | and creating a new record by hand works, however. */ | |
910ad8de | 1808 | for (f = TYPE_FIELDS (type); f ; f = DECL_CHAIN (f)) |
953ff289 DN |
1809 | if (variably_modified_type_p (TREE_TYPE (f), ctx->cb.src_fn)) |
1810 | break; | |
1811 | if (f) | |
1812 | { | |
1813 | tree name, new_fields = NULL; | |
1814 | ||
1815 | type = lang_hooks.types.make_type (RECORD_TYPE); | |
1816 | name = DECL_NAME (TYPE_NAME (ctx->record_type)); | |
c2255bc4 AH |
1817 | name = build_decl (DECL_SOURCE_LOCATION (ctx->receiver_decl), |
1818 | TYPE_DECL, name, type); | |
953ff289 DN |
1819 | TYPE_NAME (type) = name; |
1820 | ||
910ad8de | 1821 | for (f = TYPE_FIELDS (ctx->record_type); f ; f = DECL_CHAIN (f)) |
953ff289 DN |
1822 | { |
1823 | tree new_f = copy_node (f); | |
1824 | DECL_CONTEXT (new_f) = type; | |
1825 | TREE_TYPE (new_f) = remap_type (TREE_TYPE (f), &ctx->cb); | |
910ad8de | 1826 | DECL_CHAIN (new_f) = new_fields; |
726a989a RB |
1827 | walk_tree (&DECL_SIZE (new_f), copy_tree_body_r, &ctx->cb, NULL); |
1828 | walk_tree (&DECL_SIZE_UNIT (new_f), copy_tree_body_r, | |
1829 | &ctx->cb, NULL); | |
1830 | walk_tree (&DECL_FIELD_OFFSET (new_f), copy_tree_body_r, | |
1831 | &ctx->cb, NULL); | |
953ff289 DN |
1832 | new_fields = new_f; |
1833 | ||
1834 | /* Arrange to be able to look up the receiver field | |
1835 | given the sender field. */ | |
1836 | splay_tree_insert (ctx->field_map, (splay_tree_key) f, | |
1837 | (splay_tree_value) new_f); | |
1838 | } | |
1839 | TYPE_FIELDS (type) = nreverse (new_fields); | |
1840 | layout_type (type); | |
1841 | } | |
1842 | ||
d9a6bd32 JJ |
1843 | /* In a target region we never modify any of the pointers in *.omp_data_i, |
1844 | so attempt to help the optimizers. */ | |
1845 | if (is_gimple_omp_offloaded (ctx->stmt)) | |
1846 | type = build_qualified_type (type, TYPE_QUAL_CONST); | |
1847 | ||
a2a2fe4b RB |
1848 | TREE_TYPE (ctx->receiver_decl) |
1849 | = build_qualified_type (build_reference_type (type), TYPE_QUAL_RESTRICT); | |
953ff289 DN |
1850 | } |
1851 | ||
1852 | /* Instantiate decls as necessary in CTX to satisfy the data sharing | |
86938de6 TV |
1853 | specified by CLAUSES. If BASE_POINTERS_RESTRICT, install var field with |
1854 | restrict. */ | |
953ff289 DN |
1855 | |
1856 | static void | |
86938de6 TV |
1857 | scan_sharing_clauses (tree clauses, omp_context *ctx, |
1858 | bool base_pointers_restrict = false) | |
953ff289 DN |
1859 | { |
1860 | tree c, decl; | |
1861 | bool scan_array_reductions = false; | |
1862 | ||
1863 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
1864 | { | |
1865 | bool by_ref; | |
1866 | ||
aaf46ef9 | 1867 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 DN |
1868 | { |
1869 | case OMP_CLAUSE_PRIVATE: | |
1870 | decl = OMP_CLAUSE_DECL (c); | |
a68ab351 JJ |
1871 | if (OMP_CLAUSE_PRIVATE_OUTER_REF (c)) |
1872 | goto do_private; | |
1873 | else if (!is_variable_sized (decl)) | |
953ff289 DN |
1874 | install_var_local (decl, ctx); |
1875 | break; | |
1876 | ||
1877 | case OMP_CLAUSE_SHARED: | |
9cf32741 | 1878 | decl = OMP_CLAUSE_DECL (c); |
acf0174b JJ |
1879 | /* Ignore shared directives in teams construct. */ |
1880 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_TEAMS) | |
9cf32741 JJ |
1881 | { |
1882 | /* Global variables don't need to be copied, | |
1883 | the receiver side will use them directly. */ | |
1884 | tree odecl = maybe_lookup_decl_in_outer_ctx (decl, ctx); | |
1885 | if (is_global_var (odecl)) | |
1886 | break; | |
1887 | insert_decl_map (&ctx->cb, decl, odecl); | |
1888 | break; | |
1889 | } | |
a68ab351 | 1890 | gcc_assert (is_taskreg_ctx (ctx)); |
5da250fc JJ |
1891 | gcc_assert (!COMPLETE_TYPE_P (TREE_TYPE (decl)) |
1892 | || !is_variable_sized (decl)); | |
8ca5b2a2 JJ |
1893 | /* Global variables don't need to be copied, |
1894 | the receiver side will use them directly. */ | |
1895 | if (is_global_var (maybe_lookup_decl_in_outer_ctx (decl, ctx))) | |
1896 | break; | |
d9a6bd32 | 1897 | if (OMP_CLAUSE_SHARED_FIRSTPRIVATE (c)) |
1a80d6b8 JJ |
1898 | { |
1899 | use_pointer_for_field (decl, ctx); | |
1900 | break; | |
1901 | } | |
1902 | by_ref = use_pointer_for_field (decl, NULL); | |
1903 | if ((! TREE_READONLY (decl) && !OMP_CLAUSE_SHARED_READONLY (c)) | |
953ff289 DN |
1904 | || TREE_ADDRESSABLE (decl) |
1905 | || by_ref | |
1906 | || is_reference (decl)) | |
1907 | { | |
1a80d6b8 | 1908 | by_ref = use_pointer_for_field (decl, ctx); |
a68ab351 | 1909 | install_var_field (decl, by_ref, 3, ctx); |
953ff289 DN |
1910 | install_var_local (decl, ctx); |
1911 | break; | |
1912 | } | |
1913 | /* We don't need to copy const scalar vars back. */ | |
aaf46ef9 | 1914 | OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_FIRSTPRIVATE); |
953ff289 DN |
1915 | goto do_private; |
1916 | ||
d9a6bd32 JJ |
1917 | case OMP_CLAUSE_REDUCTION: |
1918 | decl = OMP_CLAUSE_DECL (c); | |
1919 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION | |
1920 | && TREE_CODE (decl) == MEM_REF) | |
1921 | { | |
1922 | tree t = TREE_OPERAND (decl, 0); | |
e01d41e5 JJ |
1923 | if (TREE_CODE (t) == POINTER_PLUS_EXPR) |
1924 | t = TREE_OPERAND (t, 0); | |
d9a6bd32 JJ |
1925 | if (TREE_CODE (t) == INDIRECT_REF |
1926 | || TREE_CODE (t) == ADDR_EXPR) | |
1927 | t = TREE_OPERAND (t, 0); | |
1928 | install_var_local (t, ctx); | |
1929 | if (is_taskreg_ctx (ctx) | |
1930 | && !is_global_var (maybe_lookup_decl_in_outer_ctx (t, ctx)) | |
1931 | && !is_variable_sized (t)) | |
1932 | { | |
1933 | by_ref = use_pointer_for_field (t, ctx); | |
1934 | install_var_field (t, by_ref, 3, ctx); | |
1935 | } | |
1936 | break; | |
1937 | } | |
1938 | goto do_private; | |
1939 | ||
953ff289 DN |
1940 | case OMP_CLAUSE_LASTPRIVATE: |
1941 | /* Let the corresponding firstprivate clause create | |
1942 | the variable. */ | |
1943 | if (OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)) | |
1944 | break; | |
1945 | /* FALLTHRU */ | |
1946 | ||
1947 | case OMP_CLAUSE_FIRSTPRIVATE: | |
74bf76ed | 1948 | case OMP_CLAUSE_LINEAR: |
953ff289 DN |
1949 | decl = OMP_CLAUSE_DECL (c); |
1950 | do_private: | |
d9a6bd32 JJ |
1951 | if ((OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE |
1952 | || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_IS_DEVICE_PTR) | |
1953 | && is_gimple_omp_offloaded (ctx->stmt)) | |
1954 | { | |
1955 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE) | |
1956 | install_var_field (decl, !is_reference (decl), 3, ctx); | |
1957 | else if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) | |
1958 | install_var_field (decl, true, 3, ctx); | |
1959 | else | |
1960 | install_var_field (decl, false, 3, ctx); | |
1961 | } | |
953ff289 | 1962 | if (is_variable_sized (decl)) |
953ff289 | 1963 | { |
a68ab351 JJ |
1964 | if (is_task_ctx (ctx)) |
1965 | install_var_field (decl, false, 1, ctx); | |
1966 | break; | |
1967 | } | |
1968 | else if (is_taskreg_ctx (ctx)) | |
1969 | { | |
1970 | bool global | |
1971 | = is_global_var (maybe_lookup_decl_in_outer_ctx (decl, ctx)); | |
7c8f7639 | 1972 | by_ref = use_pointer_for_field (decl, NULL); |
a68ab351 JJ |
1973 | |
1974 | if (is_task_ctx (ctx) | |
1975 | && (global || by_ref || is_reference (decl))) | |
1976 | { | |
1977 | install_var_field (decl, false, 1, ctx); | |
1978 | if (!global) | |
1979 | install_var_field (decl, by_ref, 2, ctx); | |
1980 | } | |
1981 | else if (!global) | |
1982 | install_var_field (decl, by_ref, 3, ctx); | |
953ff289 DN |
1983 | } |
1984 | install_var_local (decl, ctx); | |
1985 | break; | |
1986 | ||
d9a6bd32 JJ |
1987 | case OMP_CLAUSE_USE_DEVICE_PTR: |
1988 | decl = OMP_CLAUSE_DECL (c); | |
1989 | if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) | |
1990 | install_var_field (decl, true, 3, ctx); | |
1991 | else | |
1992 | install_var_field (decl, false, 3, ctx); | |
1993 | if (DECL_SIZE (decl) | |
1994 | && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST) | |
1995 | { | |
1996 | tree decl2 = DECL_VALUE_EXPR (decl); | |
1997 | gcc_assert (TREE_CODE (decl2) == INDIRECT_REF); | |
1998 | decl2 = TREE_OPERAND (decl2, 0); | |
1999 | gcc_assert (DECL_P (decl2)); | |
2000 | install_var_local (decl2, ctx); | |
2001 | } | |
2002 | install_var_local (decl, ctx); | |
2003 | break; | |
2004 | ||
2005 | case OMP_CLAUSE_IS_DEVICE_PTR: | |
2006 | decl = OMP_CLAUSE_DECL (c); | |
2007 | goto do_private; | |
2008 | ||
acf0174b | 2009 | case OMP_CLAUSE__LOOPTEMP_: |
d9a6bd32 | 2010 | gcc_assert (is_taskreg_ctx (ctx)); |
acf0174b JJ |
2011 | decl = OMP_CLAUSE_DECL (c); |
2012 | install_var_field (decl, false, 3, ctx); | |
2013 | install_var_local (decl, ctx); | |
2014 | break; | |
2015 | ||
953ff289 | 2016 | case OMP_CLAUSE_COPYPRIVATE: |
953ff289 DN |
2017 | case OMP_CLAUSE_COPYIN: |
2018 | decl = OMP_CLAUSE_DECL (c); | |
7c8f7639 | 2019 | by_ref = use_pointer_for_field (decl, NULL); |
a68ab351 | 2020 | install_var_field (decl, by_ref, 3, ctx); |
953ff289 DN |
2021 | break; |
2022 | ||
2023 | case OMP_CLAUSE_DEFAULT: | |
2024 | ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c); | |
2025 | break; | |
2026 | ||
20906c66 | 2027 | case OMP_CLAUSE_FINAL: |
953ff289 DN |
2028 | case OMP_CLAUSE_IF: |
2029 | case OMP_CLAUSE_NUM_THREADS: | |
acf0174b JJ |
2030 | case OMP_CLAUSE_NUM_TEAMS: |
2031 | case OMP_CLAUSE_THREAD_LIMIT: | |
2032 | case OMP_CLAUSE_DEVICE: | |
953ff289 | 2033 | case OMP_CLAUSE_SCHEDULE: |
acf0174b JJ |
2034 | case OMP_CLAUSE_DIST_SCHEDULE: |
2035 | case OMP_CLAUSE_DEPEND: | |
d9a6bd32 JJ |
2036 | case OMP_CLAUSE_PRIORITY: |
2037 | case OMP_CLAUSE_GRAINSIZE: | |
2038 | case OMP_CLAUSE_NUM_TASKS: | |
9a771876 | 2039 | case OMP_CLAUSE__CILK_FOR_COUNT_: |
41dbbb37 TS |
2040 | case OMP_CLAUSE_NUM_GANGS: |
2041 | case OMP_CLAUSE_NUM_WORKERS: | |
2042 | case OMP_CLAUSE_VECTOR_LENGTH: | |
953ff289 | 2043 | if (ctx->outer) |
726a989a | 2044 | scan_omp_op (&OMP_CLAUSE_OPERAND (c, 0), ctx->outer); |
953ff289 DN |
2045 | break; |
2046 | ||
acf0174b JJ |
2047 | case OMP_CLAUSE_TO: |
2048 | case OMP_CLAUSE_FROM: | |
2049 | case OMP_CLAUSE_MAP: | |
2050 | if (ctx->outer) | |
2051 | scan_omp_op (&OMP_CLAUSE_SIZE (c), ctx->outer); | |
2052 | decl = OMP_CLAUSE_DECL (c); | |
2053 | /* Global variables with "omp declare target" attribute | |
2054 | don't need to be copied, the receiver side will use them | |
4a38b02b IV |
2055 | directly. However, global variables with "omp declare target link" |
2056 | attribute need to be copied. */ | |
acf0174b JJ |
2057 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP |
2058 | && DECL_P (decl) | |
e01d41e5 JJ |
2059 | && ((OMP_CLAUSE_MAP_KIND (c) != GOMP_MAP_FIRSTPRIVATE_POINTER |
2060 | && (OMP_CLAUSE_MAP_KIND (c) | |
2061 | != GOMP_MAP_FIRSTPRIVATE_REFERENCE)) | |
d9a6bd32 | 2062 | || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) |
acf0174b | 2063 | && is_global_var (maybe_lookup_decl_in_outer_ctx (decl, ctx)) |
4a38b02b IV |
2064 | && varpool_node::get_create (decl)->offloadable |
2065 | && !lookup_attribute ("omp declare target link", | |
2066 | DECL_ATTRIBUTES (decl))) | |
acf0174b JJ |
2067 | break; |
2068 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP | |
41dbbb37 | 2069 | && OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_POINTER) |
acf0174b | 2070 | { |
41dbbb37 TS |
2071 | /* Ignore GOMP_MAP_POINTER kind for arrays in regions that are |
2072 | not offloaded; there is nothing to map for those. */ | |
2073 | if (!is_gimple_omp_offloaded (ctx->stmt) | |
b8910447 JJ |
2074 | && !POINTER_TYPE_P (TREE_TYPE (decl)) |
2075 | && !OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION (c)) | |
acf0174b JJ |
2076 | break; |
2077 | } | |
d9a6bd32 | 2078 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP |
e01d41e5 JJ |
2079 | && (OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_FIRSTPRIVATE_POINTER |
2080 | || (OMP_CLAUSE_MAP_KIND (c) | |
2081 | == GOMP_MAP_FIRSTPRIVATE_REFERENCE))) | |
d9a6bd32 JJ |
2082 | { |
2083 | if (TREE_CODE (decl) == COMPONENT_REF | |
2084 | || (TREE_CODE (decl) == INDIRECT_REF | |
2085 | && TREE_CODE (TREE_OPERAND (decl, 0)) == COMPONENT_REF | |
2086 | && (TREE_CODE (TREE_TYPE (TREE_OPERAND (decl, 0))) | |
2087 | == REFERENCE_TYPE))) | |
2088 | break; | |
2089 | if (DECL_SIZE (decl) | |
2090 | && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST) | |
2091 | { | |
2092 | tree decl2 = DECL_VALUE_EXPR (decl); | |
2093 | gcc_assert (TREE_CODE (decl2) == INDIRECT_REF); | |
2094 | decl2 = TREE_OPERAND (decl2, 0); | |
2095 | gcc_assert (DECL_P (decl2)); | |
2096 | install_var_local (decl2, ctx); | |
2097 | } | |
2098 | install_var_local (decl, ctx); | |
2099 | break; | |
2100 | } | |
acf0174b JJ |
2101 | if (DECL_P (decl)) |
2102 | { | |
2103 | if (DECL_SIZE (decl) | |
2104 | && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST) | |
2105 | { | |
2106 | tree decl2 = DECL_VALUE_EXPR (decl); | |
2107 | gcc_assert (TREE_CODE (decl2) == INDIRECT_REF); | |
2108 | decl2 = TREE_OPERAND (decl2, 0); | |
2109 | gcc_assert (DECL_P (decl2)); | |
e01d41e5 | 2110 | install_var_field (decl2, true, 3, ctx); |
acf0174b JJ |
2111 | install_var_local (decl2, ctx); |
2112 | install_var_local (decl, ctx); | |
2113 | } | |
2114 | else | |
2115 | { | |
2116 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP | |
41dbbb37 | 2117 | && OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_POINTER |
acf0174b JJ |
2118 | && !OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION (c) |
2119 | && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) | |
2120 | install_var_field (decl, true, 7, ctx); | |
2121 | else | |
86938de6 TV |
2122 | install_var_field (decl, true, 3, ctx, |
2123 | base_pointers_restrict); | |
41dbbb37 | 2124 | if (is_gimple_omp_offloaded (ctx->stmt)) |
acf0174b JJ |
2125 | install_var_local (decl, ctx); |
2126 | } | |
2127 | } | |
2128 | else | |
2129 | { | |
2130 | tree base = get_base_address (decl); | |
2131 | tree nc = OMP_CLAUSE_CHAIN (c); | |
2132 | if (DECL_P (base) | |
2133 | && nc != NULL_TREE | |
2134 | && OMP_CLAUSE_CODE (nc) == OMP_CLAUSE_MAP | |
2135 | && OMP_CLAUSE_DECL (nc) == base | |
41dbbb37 | 2136 | && OMP_CLAUSE_MAP_KIND (nc) == GOMP_MAP_POINTER |
acf0174b JJ |
2137 | && integer_zerop (OMP_CLAUSE_SIZE (nc))) |
2138 | { | |
2139 | OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION (c) = 1; | |
2140 | OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION (nc) = 1; | |
2141 | } | |
2142 | else | |
2143 | { | |
f014c653 JJ |
2144 | if (ctx->outer) |
2145 | { | |
2146 | scan_omp_op (&OMP_CLAUSE_DECL (c), ctx->outer); | |
2147 | decl = OMP_CLAUSE_DECL (c); | |
2148 | } | |
acf0174b JJ |
2149 | gcc_assert (!splay_tree_lookup (ctx->field_map, |
2150 | (splay_tree_key) decl)); | |
2151 | tree field | |
2152 | = build_decl (OMP_CLAUSE_LOCATION (c), | |
2153 | FIELD_DECL, NULL_TREE, ptr_type_node); | |
2154 | DECL_ALIGN (field) = TYPE_ALIGN (ptr_type_node); | |
2155 | insert_field_into_struct (ctx->record_type, field); | |
2156 | splay_tree_insert (ctx->field_map, (splay_tree_key) decl, | |
2157 | (splay_tree_value) field); | |
2158 | } | |
2159 | } | |
2160 | break; | |
2161 | ||
b2b40051 MJ |
2162 | case OMP_CLAUSE__GRIDDIM_: |
2163 | if (ctx->outer) | |
2164 | { | |
2165 | scan_omp_op (&OMP_CLAUSE__GRIDDIM__SIZE (c), ctx->outer); | |
2166 | scan_omp_op (&OMP_CLAUSE__GRIDDIM__GROUP (c), ctx->outer); | |
2167 | } | |
2168 | break; | |
2169 | ||
953ff289 DN |
2170 | case OMP_CLAUSE_NOWAIT: |
2171 | case OMP_CLAUSE_ORDERED: | |
a68ab351 JJ |
2172 | case OMP_CLAUSE_COLLAPSE: |
2173 | case OMP_CLAUSE_UNTIED: | |
20906c66 | 2174 | case OMP_CLAUSE_MERGEABLE: |
acf0174b | 2175 | case OMP_CLAUSE_PROC_BIND: |
74bf76ed | 2176 | case OMP_CLAUSE_SAFELEN: |
d9a6bd32 JJ |
2177 | case OMP_CLAUSE_SIMDLEN: |
2178 | case OMP_CLAUSE_THREADS: | |
2179 | case OMP_CLAUSE_SIMD: | |
2180 | case OMP_CLAUSE_NOGROUP: | |
2181 | case OMP_CLAUSE_DEFAULTMAP: | |
41dbbb37 TS |
2182 | case OMP_CLAUSE_ASYNC: |
2183 | case OMP_CLAUSE_WAIT: | |
2184 | case OMP_CLAUSE_GANG: | |
2185 | case OMP_CLAUSE_WORKER: | |
2186 | case OMP_CLAUSE_VECTOR: | |
7a5e4956 | 2187 | case OMP_CLAUSE_TILE: |
c5a64cfe NS |
2188 | case OMP_CLAUSE_INDEPENDENT: |
2189 | case OMP_CLAUSE_AUTO: | |
2190 | case OMP_CLAUSE_SEQ: | |
953ff289 DN |
2191 | break; |
2192 | ||
acf0174b JJ |
2193 | case OMP_CLAUSE_ALIGNED: |
2194 | decl = OMP_CLAUSE_DECL (c); | |
2195 | if (is_global_var (decl) | |
2196 | && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) | |
2197 | install_var_local (decl, ctx); | |
2198 | break; | |
2199 | ||
41dbbb37 | 2200 | case OMP_CLAUSE_DEVICE_RESIDENT: |
41dbbb37 | 2201 | case OMP_CLAUSE__CACHE_: |
41dbbb37 TS |
2202 | sorry ("Clause not supported yet"); |
2203 | break; | |
2204 | ||
953ff289 DN |
2205 | default: |
2206 | gcc_unreachable (); | |
2207 | } | |
2208 | } | |
2209 | ||
2210 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
2211 | { | |
aaf46ef9 | 2212 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 DN |
2213 | { |
2214 | case OMP_CLAUSE_LASTPRIVATE: | |
2215 | /* Let the corresponding firstprivate clause create | |
2216 | the variable. */ | |
726a989a | 2217 | if (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)) |
a68ab351 | 2218 | scan_array_reductions = true; |
953ff289 DN |
2219 | if (OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)) |
2220 | break; | |
2221 | /* FALLTHRU */ | |
2222 | ||
953ff289 | 2223 | case OMP_CLAUSE_FIRSTPRIVATE: |
41dbbb37 | 2224 | case OMP_CLAUSE_PRIVATE: |
74bf76ed | 2225 | case OMP_CLAUSE_LINEAR: |
d9a6bd32 | 2226 | case OMP_CLAUSE_IS_DEVICE_PTR: |
953ff289 DN |
2227 | decl = OMP_CLAUSE_DECL (c); |
2228 | if (is_variable_sized (decl)) | |
d9a6bd32 JJ |
2229 | { |
2230 | if ((OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE | |
2231 | || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_IS_DEVICE_PTR) | |
2232 | && is_gimple_omp_offloaded (ctx->stmt)) | |
2233 | { | |
2234 | tree decl2 = DECL_VALUE_EXPR (decl); | |
2235 | gcc_assert (TREE_CODE (decl2) == INDIRECT_REF); | |
2236 | decl2 = TREE_OPERAND (decl2, 0); | |
2237 | gcc_assert (DECL_P (decl2)); | |
2238 | install_var_local (decl2, ctx); | |
2239 | fixup_remapped_decl (decl2, ctx, false); | |
2240 | } | |
2241 | install_var_local (decl, ctx); | |
2242 | } | |
953ff289 | 2243 | fixup_remapped_decl (decl, ctx, |
aaf46ef9 | 2244 | OMP_CLAUSE_CODE (c) == OMP_CLAUSE_PRIVATE |
953ff289 | 2245 | && OMP_CLAUSE_PRIVATE_DEBUG (c)); |
d9a6bd32 JJ |
2246 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR |
2247 | && OMP_CLAUSE_LINEAR_GIMPLE_SEQ (c)) | |
953ff289 | 2248 | scan_array_reductions = true; |
d9a6bd32 JJ |
2249 | break; |
2250 | ||
2251 | case OMP_CLAUSE_REDUCTION: | |
2252 | decl = OMP_CLAUSE_DECL (c); | |
2253 | if (TREE_CODE (decl) != MEM_REF) | |
2254 | { | |
2255 | if (is_variable_sized (decl)) | |
2256 | install_var_local (decl, ctx); | |
2257 | fixup_remapped_decl (decl, ctx, false); | |
2258 | } | |
2259 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) | |
f7468577 | 2260 | scan_array_reductions = true; |
953ff289 DN |
2261 | break; |
2262 | ||
2263 | case OMP_CLAUSE_SHARED: | |
acf0174b JJ |
2264 | /* Ignore shared directives in teams construct. */ |
2265 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_TEAMS) | |
2266 | break; | |
953ff289 | 2267 | decl = OMP_CLAUSE_DECL (c); |
d9a6bd32 JJ |
2268 | if (is_global_var (maybe_lookup_decl_in_outer_ctx (decl, ctx))) |
2269 | break; | |
2270 | if (OMP_CLAUSE_SHARED_FIRSTPRIVATE (c)) | |
2271 | { | |
2272 | if (is_global_var (maybe_lookup_decl_in_outer_ctx (decl, | |
2273 | ctx->outer))) | |
2274 | break; | |
2275 | bool by_ref = use_pointer_for_field (decl, ctx); | |
2276 | install_var_field (decl, by_ref, 11, ctx); | |
2277 | break; | |
2278 | } | |
2279 | fixup_remapped_decl (decl, ctx, false); | |
953ff289 DN |
2280 | break; |
2281 | ||
acf0174b | 2282 | case OMP_CLAUSE_MAP: |
41dbbb37 | 2283 | if (!is_gimple_omp_offloaded (ctx->stmt)) |
acf0174b JJ |
2284 | break; |
2285 | decl = OMP_CLAUSE_DECL (c); | |
2286 | if (DECL_P (decl) | |
e01d41e5 JJ |
2287 | && ((OMP_CLAUSE_MAP_KIND (c) != GOMP_MAP_FIRSTPRIVATE_POINTER |
2288 | && (OMP_CLAUSE_MAP_KIND (c) | |
2289 | != GOMP_MAP_FIRSTPRIVATE_REFERENCE)) | |
d9a6bd32 | 2290 | || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) |
acf0174b | 2291 | && is_global_var (maybe_lookup_decl_in_outer_ctx (decl, ctx)) |
1f6be682 | 2292 | && varpool_node::get_create (decl)->offloadable) |
acf0174b JJ |
2293 | break; |
2294 | if (DECL_P (decl)) | |
2295 | { | |
d9a6bd32 JJ |
2296 | if ((OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_POINTER |
2297 | || OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_FIRSTPRIVATE_POINTER) | |
acf0174b JJ |
2298 | && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE |
2299 | && !COMPLETE_TYPE_P (TREE_TYPE (decl))) | |
2300 | { | |
2301 | tree new_decl = lookup_decl (decl, ctx); | |
2302 | TREE_TYPE (new_decl) | |
2303 | = remap_type (TREE_TYPE (decl), &ctx->cb); | |
2304 | } | |
2305 | else if (DECL_SIZE (decl) | |
2306 | && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST) | |
2307 | { | |
2308 | tree decl2 = DECL_VALUE_EXPR (decl); | |
2309 | gcc_assert (TREE_CODE (decl2) == INDIRECT_REF); | |
2310 | decl2 = TREE_OPERAND (decl2, 0); | |
2311 | gcc_assert (DECL_P (decl2)); | |
2312 | fixup_remapped_decl (decl2, ctx, false); | |
2313 | fixup_remapped_decl (decl, ctx, true); | |
2314 | } | |
2315 | else | |
2316 | fixup_remapped_decl (decl, ctx, false); | |
2317 | } | |
2318 | break; | |
2319 | ||
953ff289 DN |
2320 | case OMP_CLAUSE_COPYPRIVATE: |
2321 | case OMP_CLAUSE_COPYIN: | |
2322 | case OMP_CLAUSE_DEFAULT: | |
2323 | case OMP_CLAUSE_IF: | |
2324 | case OMP_CLAUSE_NUM_THREADS: | |
acf0174b JJ |
2325 | case OMP_CLAUSE_NUM_TEAMS: |
2326 | case OMP_CLAUSE_THREAD_LIMIT: | |
2327 | case OMP_CLAUSE_DEVICE: | |
953ff289 | 2328 | case OMP_CLAUSE_SCHEDULE: |
acf0174b | 2329 | case OMP_CLAUSE_DIST_SCHEDULE: |
953ff289 DN |
2330 | case OMP_CLAUSE_NOWAIT: |
2331 | case OMP_CLAUSE_ORDERED: | |
a68ab351 JJ |
2332 | case OMP_CLAUSE_COLLAPSE: |
2333 | case OMP_CLAUSE_UNTIED: | |
20906c66 JJ |
2334 | case OMP_CLAUSE_FINAL: |
2335 | case OMP_CLAUSE_MERGEABLE: | |
acf0174b | 2336 | case OMP_CLAUSE_PROC_BIND: |
74bf76ed | 2337 | case OMP_CLAUSE_SAFELEN: |
d9a6bd32 | 2338 | case OMP_CLAUSE_SIMDLEN: |
acf0174b JJ |
2339 | case OMP_CLAUSE_ALIGNED: |
2340 | case OMP_CLAUSE_DEPEND: | |
2341 | case OMP_CLAUSE__LOOPTEMP_: | |
2342 | case OMP_CLAUSE_TO: | |
2343 | case OMP_CLAUSE_FROM: | |
d9a6bd32 JJ |
2344 | case OMP_CLAUSE_PRIORITY: |
2345 | case OMP_CLAUSE_GRAINSIZE: | |
2346 | case OMP_CLAUSE_NUM_TASKS: | |
2347 | case OMP_CLAUSE_THREADS: | |
2348 | case OMP_CLAUSE_SIMD: | |
2349 | case OMP_CLAUSE_NOGROUP: | |
2350 | case OMP_CLAUSE_DEFAULTMAP: | |
2351 | case OMP_CLAUSE_USE_DEVICE_PTR: | |
9a771876 | 2352 | case OMP_CLAUSE__CILK_FOR_COUNT_: |
41dbbb37 TS |
2353 | case OMP_CLAUSE_ASYNC: |
2354 | case OMP_CLAUSE_WAIT: | |
2355 | case OMP_CLAUSE_NUM_GANGS: | |
2356 | case OMP_CLAUSE_NUM_WORKERS: | |
2357 | case OMP_CLAUSE_VECTOR_LENGTH: | |
2358 | case OMP_CLAUSE_GANG: | |
2359 | case OMP_CLAUSE_WORKER: | |
2360 | case OMP_CLAUSE_VECTOR: | |
7a5e4956 | 2361 | case OMP_CLAUSE_TILE: |
c5a64cfe NS |
2362 | case OMP_CLAUSE_INDEPENDENT: |
2363 | case OMP_CLAUSE_AUTO: | |
2364 | case OMP_CLAUSE_SEQ: | |
b2b40051 | 2365 | case OMP_CLAUSE__GRIDDIM_: |
41dbbb37 TS |
2366 | break; |
2367 | ||
2368 | case OMP_CLAUSE_DEVICE_RESIDENT: | |
41dbbb37 | 2369 | case OMP_CLAUSE__CACHE_: |
41dbbb37 | 2370 | sorry ("Clause not supported yet"); |
953ff289 DN |
2371 | break; |
2372 | ||
2373 | default: | |
2374 | gcc_unreachable (); | |
2375 | } | |
2376 | } | |
2377 | ||
41dbbb37 TS |
2378 | gcc_checking_assert (!scan_array_reductions |
2379 | || !is_gimple_omp_oacc (ctx->stmt)); | |
953ff289 DN |
2380 | if (scan_array_reductions) |
2381 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
aaf46ef9 | 2382 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION |
953ff289 DN |
2383 | && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) |
2384 | { | |
26127932 JJ |
2385 | scan_omp (&OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c), ctx); |
2386 | scan_omp (&OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c), ctx); | |
953ff289 | 2387 | } |
a68ab351 | 2388 | else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE |
726a989a | 2389 | && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)) |
26127932 | 2390 | scan_omp (&OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c), ctx); |
f7468577 JJ |
2391 | else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR |
2392 | && OMP_CLAUSE_LINEAR_GIMPLE_SEQ (c)) | |
2393 | scan_omp (&OMP_CLAUSE_LINEAR_GIMPLE_SEQ (c), ctx); | |
953ff289 DN |
2394 | } |
2395 | ||
9a771876 JJ |
2396 | /* Create a new name for omp child function. Returns an identifier. If |
2397 | IS_CILK_FOR is true then the suffix for the child function is | |
2398 | "_cilk_for_fn." */ | |
953ff289 | 2399 | |
953ff289 | 2400 | static tree |
9a771876 | 2401 | create_omp_child_function_name (bool task_copy, bool is_cilk_for) |
953ff289 | 2402 | { |
9a771876 JJ |
2403 | if (is_cilk_for) |
2404 | return clone_function_name (current_function_decl, "_cilk_for_fn"); | |
2405 | return clone_function_name (current_function_decl, | |
2406 | task_copy ? "_omp_cpyfn" : "_omp_fn"); | |
2407 | } | |
2408 | ||
2409 | /* Returns the type of the induction variable for the child function for | |
2410 | _Cilk_for and the types for _high and _low variables based on TYPE. */ | |
2411 | ||
2412 | static tree | |
2413 | cilk_for_check_loop_diff_type (tree type) | |
2414 | { | |
2415 | if (TYPE_PRECISION (type) <= TYPE_PRECISION (uint32_type_node)) | |
2416 | { | |
2417 | if (TYPE_UNSIGNED (type)) | |
2418 | return uint32_type_node; | |
2419 | else | |
2420 | return integer_type_node; | |
2421 | } | |
2422 | else | |
2423 | { | |
2424 | if (TYPE_UNSIGNED (type)) | |
2425 | return uint64_type_node; | |
2426 | else | |
2427 | return long_long_integer_type_node; | |
2428 | } | |
953ff289 DN |
2429 | } |
2430 | ||
2431 | /* Build a decl for the omp child function. It'll not contain a body | |
2432 | yet, just the bare decl. */ | |
2433 | ||
2434 | static void | |
a68ab351 | 2435 | create_omp_child_function (omp_context *ctx, bool task_copy) |
953ff289 DN |
2436 | { |
2437 | tree decl, type, name, t; | |
2438 | ||
9a771876 JJ |
2439 | tree cilk_for_count |
2440 | = (flag_cilkplus && gimple_code (ctx->stmt) == GIMPLE_OMP_PARALLEL) | |
2441 | ? find_omp_clause (gimple_omp_parallel_clauses (ctx->stmt), | |
2442 | OMP_CLAUSE__CILK_FOR_COUNT_) : NULL_TREE; | |
2443 | tree cilk_var_type = NULL_TREE; | |
2444 | ||
2445 | name = create_omp_child_function_name (task_copy, | |
2446 | cilk_for_count != NULL_TREE); | |
a68ab351 JJ |
2447 | if (task_copy) |
2448 | type = build_function_type_list (void_type_node, ptr_type_node, | |
2449 | ptr_type_node, NULL_TREE); | |
9a771876 JJ |
2450 | else if (cilk_for_count) |
2451 | { | |
2452 | type = TREE_TYPE (OMP_CLAUSE_OPERAND (cilk_for_count, 0)); | |
2453 | cilk_var_type = cilk_for_check_loop_diff_type (type); | |
2454 | type = build_function_type_list (void_type_node, ptr_type_node, | |
2455 | cilk_var_type, cilk_var_type, NULL_TREE); | |
2456 | } | |
a68ab351 JJ |
2457 | else |
2458 | type = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE); | |
953ff289 | 2459 | |
9a771876 | 2460 | decl = build_decl (gimple_location (ctx->stmt), FUNCTION_DECL, name, type); |
953ff289 | 2461 | |
41dbbb37 TS |
2462 | gcc_checking_assert (!is_gimple_omp_oacc (ctx->stmt) |
2463 | || !task_copy); | |
a68ab351 JJ |
2464 | if (!task_copy) |
2465 | ctx->cb.dst_fn = decl; | |
2466 | else | |
726a989a | 2467 | gimple_omp_task_set_copy_fn (ctx->stmt, decl); |
953ff289 DN |
2468 | |
2469 | TREE_STATIC (decl) = 1; | |
2470 | TREE_USED (decl) = 1; | |
2471 | DECL_ARTIFICIAL (decl) = 1; | |
2472 | DECL_IGNORED_P (decl) = 0; | |
2473 | TREE_PUBLIC (decl) = 0; | |
2474 | DECL_UNINLINABLE (decl) = 1; | |
2475 | DECL_EXTERNAL (decl) = 0; | |
2476 | DECL_CONTEXT (decl) = NULL_TREE; | |
50674e96 | 2477 | DECL_INITIAL (decl) = make_node (BLOCK); |
1f6be682 IV |
2478 | if (cgraph_node::get (current_function_decl)->offloadable) |
2479 | cgraph_node::get_create (decl)->offloadable = 1; | |
acf0174b JJ |
2480 | else |
2481 | { | |
2482 | omp_context *octx; | |
2483 | for (octx = ctx; octx; octx = octx->outer) | |
41dbbb37 | 2484 | if (is_gimple_omp_offloaded (octx->stmt)) |
acf0174b | 2485 | { |
1f6be682 | 2486 | cgraph_node::get_create (decl)->offloadable = 1; |
1d899da2 TS |
2487 | if (ENABLE_OFFLOADING) |
2488 | g->have_offload = true; | |
2489 | ||
acf0174b JJ |
2490 | break; |
2491 | } | |
2492 | } | |
953ff289 | 2493 | |
d7823208 BS |
2494 | if (cgraph_node::get_create (decl)->offloadable |
2495 | && !lookup_attribute ("omp declare target", | |
2496 | DECL_ATTRIBUTES (current_function_decl))) | |
2497 | DECL_ATTRIBUTES (decl) | |
2498 | = tree_cons (get_identifier ("omp target entrypoint"), | |
2499 | NULL_TREE, DECL_ATTRIBUTES (decl)); | |
2500 | ||
c2255bc4 AH |
2501 | t = build_decl (DECL_SOURCE_LOCATION (decl), |
2502 | RESULT_DECL, NULL_TREE, void_type_node); | |
953ff289 DN |
2503 | DECL_ARTIFICIAL (t) = 1; |
2504 | DECL_IGNORED_P (t) = 1; | |
07485407 | 2505 | DECL_CONTEXT (t) = decl; |
953ff289 DN |
2506 | DECL_RESULT (decl) = t; |
2507 | ||
9a771876 JJ |
2508 | /* _Cilk_for's child function requires two extra parameters called |
2509 | __low and __high that are set the by Cilk runtime when it calls this | |
2510 | function. */ | |
2511 | if (cilk_for_count) | |
2512 | { | |
2513 | t = build_decl (DECL_SOURCE_LOCATION (decl), | |
2514 | PARM_DECL, get_identifier ("__high"), cilk_var_type); | |
2515 | DECL_ARTIFICIAL (t) = 1; | |
2516 | DECL_NAMELESS (t) = 1; | |
2517 | DECL_ARG_TYPE (t) = ptr_type_node; | |
2518 | DECL_CONTEXT (t) = current_function_decl; | |
2519 | TREE_USED (t) = 1; | |
2520 | DECL_CHAIN (t) = DECL_ARGUMENTS (decl); | |
2521 | DECL_ARGUMENTS (decl) = t; | |
2522 | ||
2523 | t = build_decl (DECL_SOURCE_LOCATION (decl), | |
2524 | PARM_DECL, get_identifier ("__low"), cilk_var_type); | |
2525 | DECL_ARTIFICIAL (t) = 1; | |
2526 | DECL_NAMELESS (t) = 1; | |
2527 | DECL_ARG_TYPE (t) = ptr_type_node; | |
2528 | DECL_CONTEXT (t) = current_function_decl; | |
2529 | TREE_USED (t) = 1; | |
2530 | DECL_CHAIN (t) = DECL_ARGUMENTS (decl); | |
2531 | DECL_ARGUMENTS (decl) = t; | |
2532 | } | |
2533 | ||
2534 | tree data_name = get_identifier (".omp_data_i"); | |
2535 | t = build_decl (DECL_SOURCE_LOCATION (decl), PARM_DECL, data_name, | |
2536 | ptr_type_node); | |
953ff289 | 2537 | DECL_ARTIFICIAL (t) = 1; |
cd3f04c8 | 2538 | DECL_NAMELESS (t) = 1; |
953ff289 | 2539 | DECL_ARG_TYPE (t) = ptr_type_node; |
50674e96 | 2540 | DECL_CONTEXT (t) = current_function_decl; |
953ff289 | 2541 | TREE_USED (t) = 1; |
d9a6bd32 | 2542 | TREE_READONLY (t) = 1; |
9a771876 JJ |
2543 | if (cilk_for_count) |
2544 | DECL_CHAIN (t) = DECL_ARGUMENTS (decl); | |
953ff289 | 2545 | DECL_ARGUMENTS (decl) = t; |
a68ab351 JJ |
2546 | if (!task_copy) |
2547 | ctx->receiver_decl = t; | |
2548 | else | |
2549 | { | |
c2255bc4 AH |
2550 | t = build_decl (DECL_SOURCE_LOCATION (decl), |
2551 | PARM_DECL, get_identifier (".omp_data_o"), | |
a68ab351 JJ |
2552 | ptr_type_node); |
2553 | DECL_ARTIFICIAL (t) = 1; | |
cd3f04c8 | 2554 | DECL_NAMELESS (t) = 1; |
a68ab351 JJ |
2555 | DECL_ARG_TYPE (t) = ptr_type_node; |
2556 | DECL_CONTEXT (t) = current_function_decl; | |
2557 | TREE_USED (t) = 1; | |
628c189e | 2558 | TREE_ADDRESSABLE (t) = 1; |
910ad8de | 2559 | DECL_CHAIN (t) = DECL_ARGUMENTS (decl); |
a68ab351 JJ |
2560 | DECL_ARGUMENTS (decl) = t; |
2561 | } | |
953ff289 | 2562 | |
b8698a0f | 2563 | /* Allocate memory for the function structure. The call to |
50674e96 | 2564 | allocate_struct_function clobbers CFUN, so we need to restore |
953ff289 | 2565 | it afterward. */ |
db2960f4 | 2566 | push_struct_function (decl); |
726a989a | 2567 | cfun->function_end_locus = gimple_location (ctx->stmt); |
db2960f4 | 2568 | pop_cfun (); |
953ff289 DN |
2569 | } |
2570 | ||
acf0174b JJ |
2571 | /* Callback for walk_gimple_seq. Check if combined parallel |
2572 | contains gimple_omp_for_combined_into_p OMP_FOR. */ | |
2573 | ||
2574 | static tree | |
2575 | find_combined_for (gimple_stmt_iterator *gsi_p, | |
2576 | bool *handled_ops_p, | |
2577 | struct walk_stmt_info *wi) | |
2578 | { | |
355fe088 | 2579 | gimple *stmt = gsi_stmt (*gsi_p); |
acf0174b JJ |
2580 | |
2581 | *handled_ops_p = true; | |
2582 | switch (gimple_code (stmt)) | |
2583 | { | |
2584 | WALK_SUBSTMTS; | |
2585 | ||
2586 | case GIMPLE_OMP_FOR: | |
2587 | if (gimple_omp_for_combined_into_p (stmt) | |
d9a6bd32 JJ |
2588 | && gimple_omp_for_kind (stmt) |
2589 | == *(const enum gf_mask *) (wi->info)) | |
acf0174b JJ |
2590 | { |
2591 | wi->info = stmt; | |
2592 | return integer_zero_node; | |
2593 | } | |
2594 | break; | |
2595 | default: | |
2596 | break; | |
2597 | } | |
2598 | return NULL; | |
2599 | } | |
2600 | ||
d9a6bd32 JJ |
2601 | /* Add _LOOPTEMP_ clauses on OpenMP parallel or task. */ |
2602 | ||
2603 | static void | |
2604 | add_taskreg_looptemp_clauses (enum gf_mask msk, gimple *stmt, | |
2605 | omp_context *outer_ctx) | |
2606 | { | |
2607 | struct walk_stmt_info wi; | |
2608 | ||
2609 | memset (&wi, 0, sizeof (wi)); | |
2610 | wi.val_only = true; | |
2611 | wi.info = (void *) &msk; | |
2612 | walk_gimple_seq (gimple_omp_body (stmt), find_combined_for, NULL, &wi); | |
2613 | if (wi.info != (void *) &msk) | |
2614 | { | |
2615 | gomp_for *for_stmt = as_a <gomp_for *> ((gimple *) wi.info); | |
2616 | struct omp_for_data fd; | |
2617 | extract_omp_for_data (for_stmt, &fd, NULL); | |
2618 | /* We need two temporaries with fd.loop.v type (istart/iend) | |
2619 | and then (fd.collapse - 1) temporaries with the same | |
2620 | type for count2 ... countN-1 vars if not constant. */ | |
2621 | size_t count = 2, i; | |
2622 | tree type = fd.iter_type; | |
2623 | if (fd.collapse > 1 | |
2624 | && TREE_CODE (fd.loop.n2) != INTEGER_CST) | |
2625 | { | |
2626 | count += fd.collapse - 1; | |
e01d41e5 | 2627 | /* If there are lastprivate clauses on the inner |
d9a6bd32 JJ |
2628 | GIMPLE_OMP_FOR, add one more temporaries for the total number |
2629 | of iterations (product of count1 ... countN-1). */ | |
e01d41e5 JJ |
2630 | if (find_omp_clause (gimple_omp_for_clauses (for_stmt), |
2631 | OMP_CLAUSE_LASTPRIVATE)) | |
2632 | count++; | |
2633 | else if (msk == GF_OMP_FOR_KIND_FOR | |
2634 | && find_omp_clause (gimple_omp_parallel_clauses (stmt), | |
2635 | OMP_CLAUSE_LASTPRIVATE)) | |
d9a6bd32 JJ |
2636 | count++; |
2637 | } | |
2638 | for (i = 0; i < count; i++) | |
2639 | { | |
2640 | tree temp = create_tmp_var (type); | |
2641 | tree c = build_omp_clause (UNKNOWN_LOCATION, OMP_CLAUSE__LOOPTEMP_); | |
2642 | insert_decl_map (&outer_ctx->cb, temp, temp); | |
2643 | OMP_CLAUSE_DECL (c) = temp; | |
2644 | OMP_CLAUSE_CHAIN (c) = gimple_omp_taskreg_clauses (stmt); | |
2645 | gimple_omp_taskreg_set_clauses (stmt, c); | |
2646 | } | |
2647 | } | |
2648 | } | |
2649 | ||
953ff289 DN |
2650 | /* Scan an OpenMP parallel directive. */ |
2651 | ||
2652 | static void | |
726a989a | 2653 | scan_omp_parallel (gimple_stmt_iterator *gsi, omp_context *outer_ctx) |
953ff289 DN |
2654 | { |
2655 | omp_context *ctx; | |
2656 | tree name; | |
538dd0b7 | 2657 | gomp_parallel *stmt = as_a <gomp_parallel *> (gsi_stmt (*gsi)); |
953ff289 DN |
2658 | |
2659 | /* Ignore parallel directives with empty bodies, unless there | |
2660 | are copyin clauses. */ | |
2661 | if (optimize > 0 | |
726a989a RB |
2662 | && empty_body_p (gimple_omp_body (stmt)) |
2663 | && find_omp_clause (gimple_omp_parallel_clauses (stmt), | |
2664 | OMP_CLAUSE_COPYIN) == NULL) | |
953ff289 | 2665 | { |
726a989a | 2666 | gsi_replace (gsi, gimple_build_nop (), false); |
953ff289 DN |
2667 | return; |
2668 | } | |
2669 | ||
acf0174b | 2670 | if (gimple_omp_parallel_combined_p (stmt)) |
d9a6bd32 | 2671 | add_taskreg_looptemp_clauses (GF_OMP_FOR_KIND_FOR, stmt, outer_ctx); |
acf0174b | 2672 | |
726a989a | 2673 | ctx = new_omp_context (stmt, outer_ctx); |
5771c391 | 2674 | taskreg_contexts.safe_push (ctx); |
a68ab351 | 2675 | if (taskreg_nesting_level > 1) |
50674e96 | 2676 | ctx->is_nested = true; |
953ff289 | 2677 | ctx->field_map = splay_tree_new (splay_tree_compare_pointers, 0, 0); |
953ff289 DN |
2678 | ctx->default_kind = OMP_CLAUSE_DEFAULT_SHARED; |
2679 | ctx->record_type = lang_hooks.types.make_type (RECORD_TYPE); | |
953ff289 | 2680 | name = create_tmp_var_name (".omp_data_s"); |
c2255bc4 AH |
2681 | name = build_decl (gimple_location (stmt), |
2682 | TYPE_DECL, name, ctx->record_type); | |
cd3f04c8 JJ |
2683 | DECL_ARTIFICIAL (name) = 1; |
2684 | DECL_NAMELESS (name) = 1; | |
953ff289 | 2685 | TYPE_NAME (ctx->record_type) = name; |
f7484978 | 2686 | TYPE_ARTIFICIAL (ctx->record_type) = 1; |
b2b40051 MJ |
2687 | if (!gimple_omp_parallel_grid_phony (stmt)) |
2688 | { | |
2689 | create_omp_child_function (ctx, false); | |
2690 | gimple_omp_parallel_set_child_fn (stmt, ctx->cb.dst_fn); | |
2691 | } | |
953ff289 | 2692 | |
726a989a | 2693 | scan_sharing_clauses (gimple_omp_parallel_clauses (stmt), ctx); |
26127932 | 2694 | scan_omp (gimple_omp_body_ptr (stmt), ctx); |
953ff289 DN |
2695 | |
2696 | if (TYPE_FIELDS (ctx->record_type) == NULL) | |
2697 | ctx->record_type = ctx->receiver_decl = NULL; | |
953ff289 DN |
2698 | } |
2699 | ||
a68ab351 JJ |
2700 | /* Scan an OpenMP task directive. */ |
2701 | ||
2702 | static void | |
726a989a | 2703 | scan_omp_task (gimple_stmt_iterator *gsi, omp_context *outer_ctx) |
a68ab351 JJ |
2704 | { |
2705 | omp_context *ctx; | |
726a989a | 2706 | tree name, t; |
538dd0b7 | 2707 | gomp_task *stmt = as_a <gomp_task *> (gsi_stmt (*gsi)); |
a68ab351 JJ |
2708 | |
2709 | /* Ignore task directives with empty bodies. */ | |
2710 | if (optimize > 0 | |
726a989a | 2711 | && empty_body_p (gimple_omp_body (stmt))) |
a68ab351 | 2712 | { |
726a989a | 2713 | gsi_replace (gsi, gimple_build_nop (), false); |
a68ab351 JJ |
2714 | return; |
2715 | } | |
2716 | ||
d9a6bd32 JJ |
2717 | if (gimple_omp_task_taskloop_p (stmt)) |
2718 | add_taskreg_looptemp_clauses (GF_OMP_FOR_KIND_TASKLOOP, stmt, outer_ctx); | |
2719 | ||
726a989a | 2720 | ctx = new_omp_context (stmt, outer_ctx); |
5771c391 | 2721 | taskreg_contexts.safe_push (ctx); |
a68ab351 JJ |
2722 | if (taskreg_nesting_level > 1) |
2723 | ctx->is_nested = true; | |
2724 | ctx->field_map = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
2725 | ctx->default_kind = OMP_CLAUSE_DEFAULT_SHARED; | |
2726 | ctx->record_type = lang_hooks.types.make_type (RECORD_TYPE); | |
2727 | name = create_tmp_var_name (".omp_data_s"); | |
c2255bc4 AH |
2728 | name = build_decl (gimple_location (stmt), |
2729 | TYPE_DECL, name, ctx->record_type); | |
cd3f04c8 JJ |
2730 | DECL_ARTIFICIAL (name) = 1; |
2731 | DECL_NAMELESS (name) = 1; | |
a68ab351 | 2732 | TYPE_NAME (ctx->record_type) = name; |
f7484978 | 2733 | TYPE_ARTIFICIAL (ctx->record_type) = 1; |
a68ab351 | 2734 | create_omp_child_function (ctx, false); |
726a989a | 2735 | gimple_omp_task_set_child_fn (stmt, ctx->cb.dst_fn); |
a68ab351 | 2736 | |
726a989a | 2737 | scan_sharing_clauses (gimple_omp_task_clauses (stmt), ctx); |
a68ab351 JJ |
2738 | |
2739 | if (ctx->srecord_type) | |
2740 | { | |
2741 | name = create_tmp_var_name (".omp_data_a"); | |
c2255bc4 AH |
2742 | name = build_decl (gimple_location (stmt), |
2743 | TYPE_DECL, name, ctx->srecord_type); | |
cd3f04c8 JJ |
2744 | DECL_ARTIFICIAL (name) = 1; |
2745 | DECL_NAMELESS (name) = 1; | |
a68ab351 | 2746 | TYPE_NAME (ctx->srecord_type) = name; |
f7484978 | 2747 | TYPE_ARTIFICIAL (ctx->srecord_type) = 1; |
a68ab351 JJ |
2748 | create_omp_child_function (ctx, true); |
2749 | } | |
2750 | ||
26127932 | 2751 | scan_omp (gimple_omp_body_ptr (stmt), ctx); |
a68ab351 JJ |
2752 | |
2753 | if (TYPE_FIELDS (ctx->record_type) == NULL) | |
2754 | { | |
2755 | ctx->record_type = ctx->receiver_decl = NULL; | |
726a989a RB |
2756 | t = build_int_cst (long_integer_type_node, 0); |
2757 | gimple_omp_task_set_arg_size (stmt, t); | |
2758 | t = build_int_cst (long_integer_type_node, 1); | |
2759 | gimple_omp_task_set_arg_align (stmt, t); | |
a68ab351 | 2760 | } |
5771c391 JJ |
2761 | } |
2762 | ||
2763 | ||
2764 | /* If any decls have been made addressable during scan_omp, | |
2765 | adjust their fields if needed, and layout record types | |
2766 | of parallel/task constructs. */ | |
2767 | ||
2768 | static void | |
2769 | finish_taskreg_scan (omp_context *ctx) | |
2770 | { | |
2771 | if (ctx->record_type == NULL_TREE) | |
2772 | return; | |
2773 | ||
2774 | /* If any task_shared_vars were needed, verify all | |
2775 | OMP_CLAUSE_SHARED clauses on GIMPLE_OMP_{PARALLEL,TASK} | |
2776 | statements if use_pointer_for_field hasn't changed | |
2777 | because of that. If it did, update field types now. */ | |
2778 | if (task_shared_vars) | |
2779 | { | |
2780 | tree c; | |
2781 | ||
2782 | for (c = gimple_omp_taskreg_clauses (ctx->stmt); | |
2783 | c; c = OMP_CLAUSE_CHAIN (c)) | |
d9a6bd32 JJ |
2784 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED |
2785 | && !OMP_CLAUSE_SHARED_FIRSTPRIVATE (c)) | |
5771c391 JJ |
2786 | { |
2787 | tree decl = OMP_CLAUSE_DECL (c); | |
2788 | ||
2789 | /* Global variables don't need to be copied, | |
2790 | the receiver side will use them directly. */ | |
2791 | if (is_global_var (maybe_lookup_decl_in_outer_ctx (decl, ctx))) | |
2792 | continue; | |
2793 | if (!bitmap_bit_p (task_shared_vars, DECL_UID (decl)) | |
2794 | || !use_pointer_for_field (decl, ctx)) | |
2795 | continue; | |
2796 | tree field = lookup_field (decl, ctx); | |
2797 | if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE | |
2798 | && TREE_TYPE (TREE_TYPE (field)) == TREE_TYPE (decl)) | |
2799 | continue; | |
2800 | TREE_TYPE (field) = build_pointer_type (TREE_TYPE (decl)); | |
2801 | TREE_THIS_VOLATILE (field) = 0; | |
2802 | DECL_USER_ALIGN (field) = 0; | |
2803 | DECL_ALIGN (field) = TYPE_ALIGN (TREE_TYPE (field)); | |
2804 | if (TYPE_ALIGN (ctx->record_type) < DECL_ALIGN (field)) | |
2805 | TYPE_ALIGN (ctx->record_type) = DECL_ALIGN (field); | |
2806 | if (ctx->srecord_type) | |
2807 | { | |
2808 | tree sfield = lookup_sfield (decl, ctx); | |
2809 | TREE_TYPE (sfield) = TREE_TYPE (field); | |
2810 | TREE_THIS_VOLATILE (sfield) = 0; | |
2811 | DECL_USER_ALIGN (sfield) = 0; | |
2812 | DECL_ALIGN (sfield) = DECL_ALIGN (field); | |
2813 | if (TYPE_ALIGN (ctx->srecord_type) < DECL_ALIGN (sfield)) | |
2814 | TYPE_ALIGN (ctx->srecord_type) = DECL_ALIGN (sfield); | |
2815 | } | |
2816 | } | |
2817 | } | |
2818 | ||
2819 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_PARALLEL) | |
2820 | { | |
2821 | layout_type (ctx->record_type); | |
2822 | fixup_child_record_type (ctx); | |
2823 | } | |
a68ab351 JJ |
2824 | else |
2825 | { | |
5771c391 | 2826 | location_t loc = gimple_location (ctx->stmt); |
a68ab351 JJ |
2827 | tree *p, vla_fields = NULL_TREE, *q = &vla_fields; |
2828 | /* Move VLA fields to the end. */ | |
2829 | p = &TYPE_FIELDS (ctx->record_type); | |
2830 | while (*p) | |
2831 | if (!TYPE_SIZE_UNIT (TREE_TYPE (*p)) | |
2832 | || ! TREE_CONSTANT (TYPE_SIZE_UNIT (TREE_TYPE (*p)))) | |
2833 | { | |
2834 | *q = *p; | |
2835 | *p = TREE_CHAIN (*p); | |
2836 | TREE_CHAIN (*q) = NULL_TREE; | |
2837 | q = &TREE_CHAIN (*q); | |
2838 | } | |
2839 | else | |
910ad8de | 2840 | p = &DECL_CHAIN (*p); |
a68ab351 | 2841 | *p = vla_fields; |
d9a6bd32 JJ |
2842 | if (gimple_omp_task_taskloop_p (ctx->stmt)) |
2843 | { | |
2844 | /* Move fields corresponding to first and second _looptemp_ | |
2845 | clause first. There are filled by GOMP_taskloop | |
2846 | and thus need to be in specific positions. */ | |
2847 | tree c1 = gimple_omp_task_clauses (ctx->stmt); | |
2848 | c1 = find_omp_clause (c1, OMP_CLAUSE__LOOPTEMP_); | |
2849 | tree c2 = find_omp_clause (OMP_CLAUSE_CHAIN (c1), | |
2850 | OMP_CLAUSE__LOOPTEMP_); | |
2851 | tree f1 = lookup_field (OMP_CLAUSE_DECL (c1), ctx); | |
2852 | tree f2 = lookup_field (OMP_CLAUSE_DECL (c2), ctx); | |
2853 | p = &TYPE_FIELDS (ctx->record_type); | |
2854 | while (*p) | |
2855 | if (*p == f1 || *p == f2) | |
2856 | *p = DECL_CHAIN (*p); | |
2857 | else | |
2858 | p = &DECL_CHAIN (*p); | |
2859 | DECL_CHAIN (f1) = f2; | |
2860 | DECL_CHAIN (f2) = TYPE_FIELDS (ctx->record_type); | |
2861 | TYPE_FIELDS (ctx->record_type) = f1; | |
2862 | if (ctx->srecord_type) | |
2863 | { | |
2864 | f1 = lookup_sfield (OMP_CLAUSE_DECL (c1), ctx); | |
2865 | f2 = lookup_sfield (OMP_CLAUSE_DECL (c2), ctx); | |
2866 | p = &TYPE_FIELDS (ctx->srecord_type); | |
2867 | while (*p) | |
2868 | if (*p == f1 || *p == f2) | |
2869 | *p = DECL_CHAIN (*p); | |
2870 | else | |
2871 | p = &DECL_CHAIN (*p); | |
2872 | DECL_CHAIN (f1) = f2; | |
2873 | DECL_CHAIN (f2) = TYPE_FIELDS (ctx->srecord_type); | |
2874 | TYPE_FIELDS (ctx->srecord_type) = f1; | |
2875 | } | |
2876 | } | |
a68ab351 JJ |
2877 | layout_type (ctx->record_type); |
2878 | fixup_child_record_type (ctx); | |
2879 | if (ctx->srecord_type) | |
2880 | layout_type (ctx->srecord_type); | |
5771c391 JJ |
2881 | tree t = fold_convert_loc (loc, long_integer_type_node, |
2882 | TYPE_SIZE_UNIT (ctx->record_type)); | |
2883 | gimple_omp_task_set_arg_size (ctx->stmt, t); | |
726a989a | 2884 | t = build_int_cst (long_integer_type_node, |
a68ab351 | 2885 | TYPE_ALIGN_UNIT (ctx->record_type)); |
5771c391 | 2886 | gimple_omp_task_set_arg_align (ctx->stmt, t); |
a68ab351 JJ |
2887 | } |
2888 | } | |
2889 | ||
e4834818 | 2890 | /* Find the enclosing offload context. */ |
953ff289 | 2891 | |
41dbbb37 TS |
2892 | static omp_context * |
2893 | enclosing_target_ctx (omp_context *ctx) | |
2894 | { | |
e4834818 NS |
2895 | for (; ctx; ctx = ctx->outer) |
2896 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_TARGET) | |
2897 | break; | |
2898 | ||
41dbbb37 TS |
2899 | return ctx; |
2900 | } | |
2901 | ||
e4834818 NS |
2902 | /* Return true if ctx is part of an oacc kernels region. */ |
2903 | ||
41dbbb37 | 2904 | static bool |
e4834818 | 2905 | ctx_in_oacc_kernels_region (omp_context *ctx) |
41dbbb37 | 2906 | { |
e4834818 NS |
2907 | for (;ctx != NULL; ctx = ctx->outer) |
2908 | { | |
2909 | gimple *stmt = ctx->stmt; | |
2910 | if (gimple_code (stmt) == GIMPLE_OMP_TARGET | |
2911 | && gimple_omp_target_kind (stmt) == GF_OMP_TARGET_KIND_OACC_KERNELS) | |
2912 | return true; | |
2913 | } | |
2914 | ||
2915 | return false; | |
2916 | } | |
2917 | ||
2918 | /* Check the parallelism clauses inside a kernels regions. | |
2919 | Until kernels handling moves to use the same loop indirection | |
2920 | scheme as parallel, we need to do this checking early. */ | |
2921 | ||
2922 | static unsigned | |
2923 | check_oacc_kernel_gwv (gomp_for *stmt, omp_context *ctx) | |
2924 | { | |
2925 | bool checking = true; | |
2926 | unsigned outer_mask = 0; | |
2927 | unsigned this_mask = 0; | |
2928 | bool has_seq = false, has_auto = false; | |
2929 | ||
2930 | if (ctx->outer) | |
2931 | outer_mask = check_oacc_kernel_gwv (NULL, ctx->outer); | |
2932 | if (!stmt) | |
2933 | { | |
2934 | checking = false; | |
2935 | if (gimple_code (ctx->stmt) != GIMPLE_OMP_FOR) | |
2936 | return outer_mask; | |
2937 | stmt = as_a <gomp_for *> (ctx->stmt); | |
2938 | } | |
2939 | ||
2940 | for (tree c = gimple_omp_for_clauses (stmt); c; c = OMP_CLAUSE_CHAIN (c)) | |
2941 | { | |
2942 | switch (OMP_CLAUSE_CODE (c)) | |
2943 | { | |
2944 | case OMP_CLAUSE_GANG: | |
2945 | this_mask |= GOMP_DIM_MASK (GOMP_DIM_GANG); | |
2946 | break; | |
2947 | case OMP_CLAUSE_WORKER: | |
2948 | this_mask |= GOMP_DIM_MASK (GOMP_DIM_WORKER); | |
2949 | break; | |
2950 | case OMP_CLAUSE_VECTOR: | |
2951 | this_mask |= GOMP_DIM_MASK (GOMP_DIM_VECTOR); | |
2952 | break; | |
2953 | case OMP_CLAUSE_SEQ: | |
2954 | has_seq = true; | |
2955 | break; | |
2956 | case OMP_CLAUSE_AUTO: | |
2957 | has_auto = true; | |
2958 | break; | |
2959 | default: | |
2960 | break; | |
2961 | } | |
2962 | } | |
2963 | ||
2964 | if (checking) | |
2965 | { | |
2966 | if (has_seq && (this_mask || has_auto)) | |
2967 | error_at (gimple_location (stmt), "%<seq%> overrides other" | |
2968 | " OpenACC loop specifiers"); | |
2969 | else if (has_auto && this_mask) | |
2970 | error_at (gimple_location (stmt), "%<auto%> conflicts with other" | |
2971 | " OpenACC loop specifiers"); | |
2972 | ||
2973 | if (this_mask & outer_mask) | |
2974 | error_at (gimple_location (stmt), "inner loop uses same" | |
2975 | " OpenACC parallelism as containing loop"); | |
2976 | } | |
2977 | ||
2978 | return outer_mask | this_mask; | |
41dbbb37 TS |
2979 | } |
2980 | ||
2981 | /* Scan a GIMPLE_OMP_FOR. */ | |
953ff289 DN |
2982 | |
2983 | static void | |
538dd0b7 | 2984 | scan_omp_for (gomp_for *stmt, omp_context *outer_ctx) |
953ff289 | 2985 | { |
50674e96 | 2986 | omp_context *ctx; |
726a989a | 2987 | size_t i; |
41dbbb37 TS |
2988 | tree clauses = gimple_omp_for_clauses (stmt); |
2989 | ||
50674e96 | 2990 | ctx = new_omp_context (stmt, outer_ctx); |
953ff289 | 2991 | |
41dbbb37 TS |
2992 | if (is_gimple_omp_oacc (stmt)) |
2993 | { | |
e4834818 NS |
2994 | omp_context *tgt = enclosing_target_ctx (outer_ctx); |
2995 | ||
2996 | if (!tgt || is_oacc_parallel (tgt)) | |
2997 | for (tree c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
2998 | { | |
2999 | char const *check = NULL; | |
3000 | ||
3001 | switch (OMP_CLAUSE_CODE (c)) | |
3002 | { | |
3003 | case OMP_CLAUSE_GANG: | |
3004 | check = "gang"; | |
3005 | break; | |
3006 | ||
3007 | case OMP_CLAUSE_WORKER: | |
3008 | check = "worker"; | |
3009 | break; | |
3010 | ||
3011 | case OMP_CLAUSE_VECTOR: | |
3012 | check = "vector"; | |
3013 | break; | |
3014 | ||
3015 | default: | |
3016 | break; | |
3017 | } | |
3018 | ||
3019 | if (check && OMP_CLAUSE_OPERAND (c, 0)) | |
3020 | error_at (gimple_location (stmt), | |
3021 | "argument not permitted on %qs clause in" | |
3022 | " OpenACC %<parallel%>", check); | |
3023 | } | |
3024 | ||
3025 | if (tgt && is_oacc_kernels (tgt)) | |
3026 | { | |
3027 | /* Strip out reductions, as they are not handled yet. */ | |
3028 | tree *prev_ptr = &clauses; | |
3029 | ||
3030 | while (tree probe = *prev_ptr) | |
41dbbb37 | 3031 | { |
e4834818 NS |
3032 | tree *next_ptr = &OMP_CLAUSE_CHAIN (probe); |
3033 | ||
3034 | if (OMP_CLAUSE_CODE (probe) == OMP_CLAUSE_REDUCTION) | |
3035 | *prev_ptr = *next_ptr; | |
3036 | else | |
3037 | prev_ptr = next_ptr; | |
41dbbb37 | 3038 | } |
e4834818 NS |
3039 | |
3040 | gimple_omp_for_set_clauses (stmt, clauses); | |
3041 | check_oacc_kernel_gwv (stmt, ctx); | |
41dbbb37 TS |
3042 | } |
3043 | } | |
3044 | ||
3045 | scan_sharing_clauses (clauses, ctx); | |
953ff289 | 3046 | |
26127932 | 3047 | scan_omp (gimple_omp_for_pre_body_ptr (stmt), ctx); |
726a989a | 3048 | for (i = 0; i < gimple_omp_for_collapse (stmt); i++) |
a68ab351 | 3049 | { |
726a989a RB |
3050 | scan_omp_op (gimple_omp_for_index_ptr (stmt, i), ctx); |
3051 | scan_omp_op (gimple_omp_for_initial_ptr (stmt, i), ctx); | |
3052 | scan_omp_op (gimple_omp_for_final_ptr (stmt, i), ctx); | |
3053 | scan_omp_op (gimple_omp_for_incr_ptr (stmt, i), ctx); | |
a68ab351 | 3054 | } |
26127932 | 3055 | scan_omp (gimple_omp_body_ptr (stmt), ctx); |
953ff289 DN |
3056 | } |
3057 | ||
3058 | /* Scan an OpenMP sections directive. */ | |
3059 | ||
3060 | static void | |
538dd0b7 | 3061 | scan_omp_sections (gomp_sections *stmt, omp_context *outer_ctx) |
953ff289 | 3062 | { |
953ff289 DN |
3063 | omp_context *ctx; |
3064 | ||
3065 | ctx = new_omp_context (stmt, outer_ctx); | |
726a989a | 3066 | scan_sharing_clauses (gimple_omp_sections_clauses (stmt), ctx); |
26127932 | 3067 | scan_omp (gimple_omp_body_ptr (stmt), ctx); |
953ff289 DN |
3068 | } |
3069 | ||
3070 | /* Scan an OpenMP single directive. */ | |
3071 | ||
3072 | static void | |
538dd0b7 | 3073 | scan_omp_single (gomp_single *stmt, omp_context *outer_ctx) |
953ff289 | 3074 | { |
953ff289 DN |
3075 | omp_context *ctx; |
3076 | tree name; | |
3077 | ||
3078 | ctx = new_omp_context (stmt, outer_ctx); | |
3079 | ctx->field_map = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
3080 | ctx->record_type = lang_hooks.types.make_type (RECORD_TYPE); | |
3081 | name = create_tmp_var_name (".omp_copy_s"); | |
c2255bc4 AH |
3082 | name = build_decl (gimple_location (stmt), |
3083 | TYPE_DECL, name, ctx->record_type); | |
953ff289 DN |
3084 | TYPE_NAME (ctx->record_type) = name; |
3085 | ||
726a989a | 3086 | scan_sharing_clauses (gimple_omp_single_clauses (stmt), ctx); |
26127932 | 3087 | scan_omp (gimple_omp_body_ptr (stmt), ctx); |
953ff289 DN |
3088 | |
3089 | if (TYPE_FIELDS (ctx->record_type) == NULL) | |
3090 | ctx->record_type = NULL; | |
3091 | else | |
3092 | layout_type (ctx->record_type); | |
3093 | } | |
3094 | ||
86938de6 TV |
3095 | /* Return true if the CLAUSES of an omp target guarantee that the base pointers |
3096 | used in the corresponding offloaded function are restrict. */ | |
3097 | ||
3098 | static bool | |
3099 | omp_target_base_pointers_restrict_p (tree clauses) | |
3100 | { | |
3101 | /* The analysis relies on the GOMP_MAP_FORCE_* mapping kinds, which are only | |
3102 | used by OpenACC. */ | |
3103 | if (flag_openacc == 0) | |
3104 | return false; | |
3105 | ||
3106 | /* I. Basic example: | |
3107 | ||
3108 | void foo (void) | |
3109 | { | |
3110 | unsigned int a[2], b[2]; | |
3111 | ||
3112 | #pragma acc kernels \ | |
3113 | copyout (a) \ | |
3114 | copyout (b) | |
3115 | { | |
3116 | a[0] = 0; | |
3117 | b[0] = 1; | |
3118 | } | |
3119 | } | |
3120 | ||
3121 | After gimplification, we have: | |
3122 | ||
3123 | #pragma omp target oacc_kernels \ | |
3124 | map(force_from:a [len: 8]) \ | |
3125 | map(force_from:b [len: 8]) | |
3126 | { | |
3127 | a[0] = 0; | |
3128 | b[0] = 1; | |
3129 | } | |
3130 | ||
3131 | Because both mappings have the force prefix, we know that they will be | |
3132 | allocated when calling the corresponding offloaded function, which means we | |
3133 | can mark the base pointers for a and b in the offloaded function as | |
3134 | restrict. */ | |
3135 | ||
3136 | tree c; | |
3137 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
3138 | { | |
3139 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_MAP) | |
3140 | return false; | |
3141 | ||
3142 | switch (OMP_CLAUSE_MAP_KIND (c)) | |
3143 | { | |
3144 | case GOMP_MAP_FORCE_ALLOC: | |
3145 | case GOMP_MAP_FORCE_TO: | |
3146 | case GOMP_MAP_FORCE_FROM: | |
3147 | case GOMP_MAP_FORCE_TOFROM: | |
3148 | break; | |
3149 | default: | |
3150 | return false; | |
3151 | } | |
3152 | } | |
3153 | ||
3154 | return true; | |
3155 | } | |
3156 | ||
41dbbb37 | 3157 | /* Scan a GIMPLE_OMP_TARGET. */ |
acf0174b JJ |
3158 | |
3159 | static void | |
538dd0b7 | 3160 | scan_omp_target (gomp_target *stmt, omp_context *outer_ctx) |
acf0174b JJ |
3161 | { |
3162 | omp_context *ctx; | |
3163 | tree name; | |
41dbbb37 TS |
3164 | bool offloaded = is_gimple_omp_offloaded (stmt); |
3165 | tree clauses = gimple_omp_target_clauses (stmt); | |
acf0174b JJ |
3166 | |
3167 | ctx = new_omp_context (stmt, outer_ctx); | |
3168 | ctx->field_map = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
3169 | ctx->default_kind = OMP_CLAUSE_DEFAULT_SHARED; | |
3170 | ctx->record_type = lang_hooks.types.make_type (RECORD_TYPE); | |
3171 | name = create_tmp_var_name (".omp_data_t"); | |
3172 | name = build_decl (gimple_location (stmt), | |
3173 | TYPE_DECL, name, ctx->record_type); | |
3174 | DECL_ARTIFICIAL (name) = 1; | |
3175 | DECL_NAMELESS (name) = 1; | |
3176 | TYPE_NAME (ctx->record_type) = name; | |
f7484978 | 3177 | TYPE_ARTIFICIAL (ctx->record_type) = 1; |
86938de6 TV |
3178 | |
3179 | bool base_pointers_restrict = false; | |
41dbbb37 | 3180 | if (offloaded) |
acf0174b JJ |
3181 | { |
3182 | create_omp_child_function (ctx, false); | |
3183 | gimple_omp_target_set_child_fn (stmt, ctx->cb.dst_fn); | |
86938de6 TV |
3184 | |
3185 | base_pointers_restrict = omp_target_base_pointers_restrict_p (clauses); | |
3186 | if (base_pointers_restrict | |
3187 | && dump_file && (dump_flags & TDF_DETAILS)) | |
3188 | fprintf (dump_file, | |
3189 | "Base pointers in offloaded function are restrict\n"); | |
acf0174b JJ |
3190 | } |
3191 | ||
86938de6 | 3192 | scan_sharing_clauses (clauses, ctx, base_pointers_restrict); |
acf0174b JJ |
3193 | scan_omp (gimple_omp_body_ptr (stmt), ctx); |
3194 | ||
3195 | if (TYPE_FIELDS (ctx->record_type) == NULL) | |
3196 | ctx->record_type = ctx->receiver_decl = NULL; | |
3197 | else | |
3198 | { | |
3199 | TYPE_FIELDS (ctx->record_type) | |
3200 | = nreverse (TYPE_FIELDS (ctx->record_type)); | |
b2b29377 MM |
3201 | if (flag_checking) |
3202 | { | |
3203 | unsigned int align = DECL_ALIGN (TYPE_FIELDS (ctx->record_type)); | |
3204 | for (tree field = TYPE_FIELDS (ctx->record_type); | |
3205 | field; | |
3206 | field = DECL_CHAIN (field)) | |
3207 | gcc_assert (DECL_ALIGN (field) == align); | |
3208 | } | |
acf0174b | 3209 | layout_type (ctx->record_type); |
41dbbb37 | 3210 | if (offloaded) |
acf0174b JJ |
3211 | fixup_child_record_type (ctx); |
3212 | } | |
3213 | } | |
3214 | ||
3215 | /* Scan an OpenMP teams directive. */ | |
3216 | ||
3217 | static void | |
538dd0b7 | 3218 | scan_omp_teams (gomp_teams *stmt, omp_context *outer_ctx) |
acf0174b JJ |
3219 | { |
3220 | omp_context *ctx = new_omp_context (stmt, outer_ctx); | |
3221 | scan_sharing_clauses (gimple_omp_teams_clauses (stmt), ctx); | |
3222 | scan_omp (gimple_omp_body_ptr (stmt), ctx); | |
3223 | } | |
953ff289 | 3224 | |
41dbbb37 | 3225 | /* Check nesting restrictions. */ |
26127932 | 3226 | static bool |
355fe088 | 3227 | check_omp_nesting_restrictions (gimple *stmt, omp_context *ctx) |
a6fc8e21 | 3228 | { |
d9a6bd32 JJ |
3229 | tree c; |
3230 | ||
b2b40051 MJ |
3231 | if (ctx && gimple_code (ctx->stmt) == GIMPLE_OMP_GRID_BODY) |
3232 | /* GRID_BODY is an artificial construct, nesting rules will be checked in | |
3233 | the original copy of its contents. */ | |
3234 | return true; | |
3235 | ||
41dbbb37 TS |
3236 | /* No nesting of non-OpenACC STMT (that is, an OpenMP one, or a GOMP builtin) |
3237 | inside an OpenACC CTX. */ | |
3238 | if (!(is_gimple_omp (stmt) | |
3239 | && is_gimple_omp_oacc (stmt))) | |
3240 | { | |
d9f4ea18 JJ |
3241 | for (omp_context *octx = ctx; octx != NULL; octx = octx->outer) |
3242 | if (is_gimple_omp (octx->stmt) | |
3243 | && is_gimple_omp_oacc (octx->stmt) | |
4bf9e5a8 TS |
3244 | /* Except for atomic codes that we share with OpenMP. */ |
3245 | && ! (gimple_code (stmt) == GIMPLE_OMP_ATOMIC_LOAD | |
3246 | || gimple_code (stmt) == GIMPLE_OMP_ATOMIC_STORE)) | |
41dbbb37 TS |
3247 | { |
3248 | error_at (gimple_location (stmt), | |
3249 | "non-OpenACC construct inside of OpenACC region"); | |
3250 | return false; | |
3251 | } | |
3252 | } | |
3253 | ||
74bf76ed JJ |
3254 | if (ctx != NULL) |
3255 | { | |
3256 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_FOR | |
0aadce73 | 3257 | && gimple_omp_for_kind (ctx->stmt) & GF_OMP_FOR_SIMD) |
74bf76ed | 3258 | { |
d9a6bd32 JJ |
3259 | c = NULL_TREE; |
3260 | if (gimple_code (stmt) == GIMPLE_OMP_ORDERED) | |
3261 | { | |
3262 | c = gimple_omp_ordered_clauses (as_a <gomp_ordered *> (stmt)); | |
d9f4ea18 JJ |
3263 | if (find_omp_clause (c, OMP_CLAUSE_SIMD)) |
3264 | { | |
3265 | if (find_omp_clause (c, OMP_CLAUSE_THREADS) | |
3266 | && (ctx->outer == NULL | |
3267 | || !gimple_omp_for_combined_into_p (ctx->stmt) | |
3268 | || gimple_code (ctx->outer->stmt) != GIMPLE_OMP_FOR | |
3269 | || (gimple_omp_for_kind (ctx->outer->stmt) | |
3270 | != GF_OMP_FOR_KIND_FOR) | |
3271 | || !gimple_omp_for_combined_p (ctx->outer->stmt))) | |
3272 | { | |
3273 | error_at (gimple_location (stmt), | |
3274 | "%<ordered simd threads%> must be closely " | |
3275 | "nested inside of %<for simd%> region"); | |
3276 | return false; | |
3277 | } | |
3278 | return true; | |
3279 | } | |
d9a6bd32 | 3280 | } |
74bf76ed | 3281 | error_at (gimple_location (stmt), |
d9a6bd32 | 3282 | "OpenMP constructs other than %<#pragma omp ordered simd%>" |
d9f4ea18 | 3283 | " may not be nested inside %<simd%> region"); |
74bf76ed JJ |
3284 | return false; |
3285 | } | |
acf0174b JJ |
3286 | else if (gimple_code (ctx->stmt) == GIMPLE_OMP_TEAMS) |
3287 | { | |
3288 | if ((gimple_code (stmt) != GIMPLE_OMP_FOR | |
3289 | || (gimple_omp_for_kind (stmt) | |
3290 | != GF_OMP_FOR_KIND_DISTRIBUTE)) | |
3291 | && gimple_code (stmt) != GIMPLE_OMP_PARALLEL) | |
3292 | { | |
3293 | error_at (gimple_location (stmt), | |
d9f4ea18 JJ |
3294 | "only %<distribute%> or %<parallel%> regions are " |
3295 | "allowed to be strictly nested inside %<teams%> " | |
3296 | "region"); | |
acf0174b JJ |
3297 | return false; |
3298 | } | |
3299 | } | |
74bf76ed | 3300 | } |
726a989a | 3301 | switch (gimple_code (stmt)) |
a6fc8e21 | 3302 | { |
726a989a | 3303 | case GIMPLE_OMP_FOR: |
0aadce73 | 3304 | if (gimple_omp_for_kind (stmt) & GF_OMP_FOR_SIMD) |
74bf76ed | 3305 | return true; |
acf0174b JJ |
3306 | if (gimple_omp_for_kind (stmt) == GF_OMP_FOR_KIND_DISTRIBUTE) |
3307 | { | |
3308 | if (ctx != NULL && gimple_code (ctx->stmt) != GIMPLE_OMP_TEAMS) | |
3309 | { | |
3310 | error_at (gimple_location (stmt), | |
d9f4ea18 JJ |
3311 | "%<distribute%> region must be strictly nested " |
3312 | "inside %<teams%> construct"); | |
acf0174b JJ |
3313 | return false; |
3314 | } | |
3315 | return true; | |
3316 | } | |
d9a6bd32 JJ |
3317 | /* We split taskloop into task and nested taskloop in it. */ |
3318 | if (gimple_omp_for_kind (stmt) == GF_OMP_FOR_KIND_TASKLOOP) | |
3319 | return true; | |
68d58afb NS |
3320 | if (gimple_omp_for_kind (stmt) == GF_OMP_FOR_KIND_OACC_LOOP) |
3321 | { | |
3322 | bool ok = false; | |
3323 | ||
3324 | if (ctx) | |
3325 | switch (gimple_code (ctx->stmt)) | |
3326 | { | |
3327 | case GIMPLE_OMP_FOR: | |
3328 | ok = (gimple_omp_for_kind (ctx->stmt) | |
3329 | == GF_OMP_FOR_KIND_OACC_LOOP); | |
3330 | break; | |
3331 | ||
3332 | case GIMPLE_OMP_TARGET: | |
3333 | switch (gimple_omp_target_kind (ctx->stmt)) | |
3334 | { | |
3335 | case GF_OMP_TARGET_KIND_OACC_PARALLEL: | |
3336 | case GF_OMP_TARGET_KIND_OACC_KERNELS: | |
3337 | ok = true; | |
3338 | break; | |
3339 | ||
3340 | default: | |
3341 | break; | |
3342 | } | |
3343 | ||
3344 | default: | |
3345 | break; | |
3346 | } | |
3347 | else if (get_oacc_fn_attrib (current_function_decl)) | |
3348 | ok = true; | |
3349 | if (!ok) | |
3350 | { | |
3351 | error_at (gimple_location (stmt), | |
3352 | "OpenACC loop directive must be associated with" | |
3353 | " an OpenACC compute region"); | |
3354 | return false; | |
3355 | } | |
3356 | } | |
acf0174b JJ |
3357 | /* FALLTHRU */ |
3358 | case GIMPLE_CALL: | |
3359 | if (is_gimple_call (stmt) | |
3360 | && (DECL_FUNCTION_CODE (gimple_call_fndecl (stmt)) | |
3361 | == BUILT_IN_GOMP_CANCEL | |
3362 | || DECL_FUNCTION_CODE (gimple_call_fndecl (stmt)) | |
3363 | == BUILT_IN_GOMP_CANCELLATION_POINT)) | |
3364 | { | |
3365 | const char *bad = NULL; | |
3366 | const char *kind = NULL; | |
d9f4ea18 JJ |
3367 | const char *construct |
3368 | = (DECL_FUNCTION_CODE (gimple_call_fndecl (stmt)) | |
3369 | == BUILT_IN_GOMP_CANCEL) | |
3370 | ? "#pragma omp cancel" | |
3371 | : "#pragma omp cancellation point"; | |
acf0174b JJ |
3372 | if (ctx == NULL) |
3373 | { | |
3374 | error_at (gimple_location (stmt), "orphaned %qs construct", | |
d9f4ea18 | 3375 | construct); |
acf0174b JJ |
3376 | return false; |
3377 | } | |
9541ffee | 3378 | switch (tree_fits_shwi_p (gimple_call_arg (stmt, 0)) |
9439e9a1 | 3379 | ? tree_to_shwi (gimple_call_arg (stmt, 0)) |
acf0174b JJ |
3380 | : 0) |
3381 | { | |
3382 | case 1: | |
3383 | if (gimple_code (ctx->stmt) != GIMPLE_OMP_PARALLEL) | |
3384 | bad = "#pragma omp parallel"; | |
3385 | else if (DECL_FUNCTION_CODE (gimple_call_fndecl (stmt)) | |
3386 | == BUILT_IN_GOMP_CANCEL | |
3387 | && !integer_zerop (gimple_call_arg (stmt, 1))) | |
3388 | ctx->cancellable = true; | |
3389 | kind = "parallel"; | |
3390 | break; | |
3391 | case 2: | |
3392 | if (gimple_code (ctx->stmt) != GIMPLE_OMP_FOR | |
3393 | || gimple_omp_for_kind (ctx->stmt) != GF_OMP_FOR_KIND_FOR) | |
3394 | bad = "#pragma omp for"; | |
3395 | else if (DECL_FUNCTION_CODE (gimple_call_fndecl (stmt)) | |
3396 | == BUILT_IN_GOMP_CANCEL | |
3397 | && !integer_zerop (gimple_call_arg (stmt, 1))) | |
3398 | { | |
3399 | ctx->cancellable = true; | |
3400 | if (find_omp_clause (gimple_omp_for_clauses (ctx->stmt), | |
3401 | OMP_CLAUSE_NOWAIT)) | |
3402 | warning_at (gimple_location (stmt), 0, | |
3403 | "%<#pragma omp cancel for%> inside " | |
3404 | "%<nowait%> for construct"); | |
3405 | if (find_omp_clause (gimple_omp_for_clauses (ctx->stmt), | |
3406 | OMP_CLAUSE_ORDERED)) | |
3407 | warning_at (gimple_location (stmt), 0, | |
3408 | "%<#pragma omp cancel for%> inside " | |
3409 | "%<ordered%> for construct"); | |
3410 | } | |
3411 | kind = "for"; | |
3412 | break; | |
3413 | case 4: | |
3414 | if (gimple_code (ctx->stmt) != GIMPLE_OMP_SECTIONS | |
3415 | && gimple_code (ctx->stmt) != GIMPLE_OMP_SECTION) | |
3416 | bad = "#pragma omp sections"; | |
3417 | else if (DECL_FUNCTION_CODE (gimple_call_fndecl (stmt)) | |
3418 | == BUILT_IN_GOMP_CANCEL | |
3419 | && !integer_zerop (gimple_call_arg (stmt, 1))) | |
3420 | { | |
3421 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_SECTIONS) | |
3422 | { | |
3423 | ctx->cancellable = true; | |
3424 | if (find_omp_clause (gimple_omp_sections_clauses | |
3425 | (ctx->stmt), | |
3426 | OMP_CLAUSE_NOWAIT)) | |
3427 | warning_at (gimple_location (stmt), 0, | |
3428 | "%<#pragma omp cancel sections%> inside " | |
3429 | "%<nowait%> sections construct"); | |
3430 | } | |
3431 | else | |
3432 | { | |
3433 | gcc_assert (ctx->outer | |
3434 | && gimple_code (ctx->outer->stmt) | |
3435 | == GIMPLE_OMP_SECTIONS); | |
3436 | ctx->outer->cancellable = true; | |
3437 | if (find_omp_clause (gimple_omp_sections_clauses | |
3438 | (ctx->outer->stmt), | |
3439 | OMP_CLAUSE_NOWAIT)) | |
3440 | warning_at (gimple_location (stmt), 0, | |
3441 | "%<#pragma omp cancel sections%> inside " | |
3442 | "%<nowait%> sections construct"); | |
3443 | } | |
3444 | } | |
3445 | kind = "sections"; | |
3446 | break; | |
3447 | case 8: | |
3448 | if (gimple_code (ctx->stmt) != GIMPLE_OMP_TASK) | |
3449 | bad = "#pragma omp task"; | |
3450 | else | |
d9f4ea18 JJ |
3451 | { |
3452 | for (omp_context *octx = ctx->outer; | |
3453 | octx; octx = octx->outer) | |
3454 | { | |
3455 | switch (gimple_code (octx->stmt)) | |
3456 | { | |
3457 | case GIMPLE_OMP_TASKGROUP: | |
3458 | break; | |
3459 | case GIMPLE_OMP_TARGET: | |
3460 | if (gimple_omp_target_kind (octx->stmt) | |
3461 | != GF_OMP_TARGET_KIND_REGION) | |
3462 | continue; | |
3463 | /* FALLTHRU */ | |
3464 | case GIMPLE_OMP_PARALLEL: | |
3465 | case GIMPLE_OMP_TEAMS: | |
3466 | error_at (gimple_location (stmt), | |
3467 | "%<%s taskgroup%> construct not closely " | |
3468 | "nested inside of %<taskgroup%> region", | |
3469 | construct); | |
3470 | return false; | |
3471 | default: | |
3472 | continue; | |
3473 | } | |
3474 | break; | |
3475 | } | |
3476 | ctx->cancellable = true; | |
3477 | } | |
acf0174b JJ |
3478 | kind = "taskgroup"; |
3479 | break; | |
3480 | default: | |
3481 | error_at (gimple_location (stmt), "invalid arguments"); | |
3482 | return false; | |
3483 | } | |
3484 | if (bad) | |
3485 | { | |
3486 | error_at (gimple_location (stmt), | |
3487 | "%<%s %s%> construct not closely nested inside of %qs", | |
d9f4ea18 | 3488 | construct, kind, bad); |
acf0174b JJ |
3489 | return false; |
3490 | } | |
3491 | } | |
74bf76ed | 3492 | /* FALLTHRU */ |
726a989a RB |
3493 | case GIMPLE_OMP_SECTIONS: |
3494 | case GIMPLE_OMP_SINGLE: | |
a6fc8e21 | 3495 | for (; ctx != NULL; ctx = ctx->outer) |
726a989a | 3496 | switch (gimple_code (ctx->stmt)) |
a6fc8e21 | 3497 | { |
726a989a | 3498 | case GIMPLE_OMP_FOR: |
d9f4ea18 JJ |
3499 | if (gimple_omp_for_kind (ctx->stmt) != GF_OMP_FOR_KIND_FOR |
3500 | && gimple_omp_for_kind (ctx->stmt) != GF_OMP_FOR_KIND_TASKLOOP) | |
3501 | break; | |
3502 | /* FALLTHRU */ | |
726a989a RB |
3503 | case GIMPLE_OMP_SECTIONS: |
3504 | case GIMPLE_OMP_SINGLE: | |
3505 | case GIMPLE_OMP_ORDERED: | |
3506 | case GIMPLE_OMP_MASTER: | |
3507 | case GIMPLE_OMP_TASK: | |
acf0174b | 3508 | case GIMPLE_OMP_CRITICAL: |
726a989a | 3509 | if (is_gimple_call (stmt)) |
a68ab351 | 3510 | { |
acf0174b JJ |
3511 | if (DECL_FUNCTION_CODE (gimple_call_fndecl (stmt)) |
3512 | != BUILT_IN_GOMP_BARRIER) | |
3513 | return true; | |
26127932 JJ |
3514 | error_at (gimple_location (stmt), |
3515 | "barrier region may not be closely nested inside " | |
d9f4ea18 JJ |
3516 | "of work-sharing, %<critical%>, %<ordered%>, " |
3517 | "%<master%>, explicit %<task%> or %<taskloop%> " | |
3518 | "region"); | |
26127932 | 3519 | return false; |
a68ab351 | 3520 | } |
26127932 JJ |
3521 | error_at (gimple_location (stmt), |
3522 | "work-sharing region may not be closely nested inside " | |
d9f4ea18 JJ |
3523 | "of work-sharing, %<critical%>, %<ordered%>, " |
3524 | "%<master%>, explicit %<task%> or %<taskloop%> region"); | |
26127932 | 3525 | return false; |
726a989a | 3526 | case GIMPLE_OMP_PARALLEL: |
d9f4ea18 | 3527 | case GIMPLE_OMP_TEAMS: |
26127932 | 3528 | return true; |
d9f4ea18 JJ |
3529 | case GIMPLE_OMP_TARGET: |
3530 | if (gimple_omp_target_kind (ctx->stmt) | |
3531 | == GF_OMP_TARGET_KIND_REGION) | |
3532 | return true; | |
3533 | break; | |
a6fc8e21 JJ |
3534 | default: |
3535 | break; | |
3536 | } | |
3537 | break; | |
726a989a | 3538 | case GIMPLE_OMP_MASTER: |
a6fc8e21 | 3539 | for (; ctx != NULL; ctx = ctx->outer) |
726a989a | 3540 | switch (gimple_code (ctx->stmt)) |
a6fc8e21 | 3541 | { |
726a989a | 3542 | case GIMPLE_OMP_FOR: |
d9f4ea18 JJ |
3543 | if (gimple_omp_for_kind (ctx->stmt) != GF_OMP_FOR_KIND_FOR |
3544 | && gimple_omp_for_kind (ctx->stmt) != GF_OMP_FOR_KIND_TASKLOOP) | |
3545 | break; | |
3546 | /* FALLTHRU */ | |
726a989a RB |
3547 | case GIMPLE_OMP_SECTIONS: |
3548 | case GIMPLE_OMP_SINGLE: | |
3549 | case GIMPLE_OMP_TASK: | |
26127932 | 3550 | error_at (gimple_location (stmt), |
d9f4ea18 JJ |
3551 | "%<master%> region may not be closely nested inside " |
3552 | "of work-sharing, explicit %<task%> or %<taskloop%> " | |
3553 | "region"); | |
26127932 | 3554 | return false; |
726a989a | 3555 | case GIMPLE_OMP_PARALLEL: |
d9f4ea18 | 3556 | case GIMPLE_OMP_TEAMS: |
26127932 | 3557 | return true; |
d9f4ea18 JJ |
3558 | case GIMPLE_OMP_TARGET: |
3559 | if (gimple_omp_target_kind (ctx->stmt) | |
3560 | == GF_OMP_TARGET_KIND_REGION) | |
3561 | return true; | |
3562 | break; | |
a6fc8e21 JJ |
3563 | default: |
3564 | break; | |
3565 | } | |
3566 | break; | |
d9a6bd32 JJ |
3567 | case GIMPLE_OMP_TASK: |
3568 | for (c = gimple_omp_task_clauses (stmt); c; c = OMP_CLAUSE_CHAIN (c)) | |
3569 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_DEPEND | |
3570 | && (OMP_CLAUSE_DEPEND_KIND (c) == OMP_CLAUSE_DEPEND_SOURCE | |
3571 | || OMP_CLAUSE_DEPEND_KIND (c) == OMP_CLAUSE_DEPEND_SINK)) | |
3572 | { | |
3573 | enum omp_clause_depend_kind kind = OMP_CLAUSE_DEPEND_KIND (c); | |
3574 | error_at (OMP_CLAUSE_LOCATION (c), | |
3575 | "%<depend(%s)%> is only allowed in %<omp ordered%>", | |
3576 | kind == OMP_CLAUSE_DEPEND_SOURCE ? "source" : "sink"); | |
3577 | return false; | |
3578 | } | |
3579 | break; | |
726a989a | 3580 | case GIMPLE_OMP_ORDERED: |
d9a6bd32 JJ |
3581 | for (c = gimple_omp_ordered_clauses (as_a <gomp_ordered *> (stmt)); |
3582 | c; c = OMP_CLAUSE_CHAIN (c)) | |
3583 | { | |
3584 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_DEPEND) | |
3585 | { | |
3586 | gcc_assert (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_THREADS | |
d9f4ea18 | 3587 | || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SIMD); |
d9a6bd32 JJ |
3588 | continue; |
3589 | } | |
3590 | enum omp_clause_depend_kind kind = OMP_CLAUSE_DEPEND_KIND (c); | |
3591 | if (kind == OMP_CLAUSE_DEPEND_SOURCE | |
3592 | || kind == OMP_CLAUSE_DEPEND_SINK) | |
3593 | { | |
3594 | tree oclause; | |
3595 | /* Look for containing ordered(N) loop. */ | |
3596 | if (ctx == NULL | |
3597 | || gimple_code (ctx->stmt) != GIMPLE_OMP_FOR | |
3598 | || (oclause | |
3599 | = find_omp_clause (gimple_omp_for_clauses (ctx->stmt), | |
3600 | OMP_CLAUSE_ORDERED)) == NULL_TREE) | |
3601 | { | |
3602 | error_at (OMP_CLAUSE_LOCATION (c), | |
d9f4ea18 JJ |
3603 | "%<ordered%> construct with %<depend%> clause " |
3604 | "must be closely nested inside an %<ordered%> " | |
3605 | "loop"); | |
d9a6bd32 JJ |
3606 | return false; |
3607 | } | |
3608 | else if (OMP_CLAUSE_ORDERED_EXPR (oclause) == NULL_TREE) | |
3609 | { | |
3610 | error_at (OMP_CLAUSE_LOCATION (c), | |
d9f4ea18 JJ |
3611 | "%<ordered%> construct with %<depend%> clause " |
3612 | "must be closely nested inside a loop with " | |
3613 | "%<ordered%> clause with a parameter"); | |
d9a6bd32 JJ |
3614 | return false; |
3615 | } | |
3616 | } | |
3617 | else | |
3618 | { | |
3619 | error_at (OMP_CLAUSE_LOCATION (c), | |
d9f4ea18 JJ |
3620 | "invalid depend kind in omp %<ordered%> %<depend%>"); |
3621 | return false; | |
3622 | } | |
3623 | } | |
3624 | c = gimple_omp_ordered_clauses (as_a <gomp_ordered *> (stmt)); | |
3625 | if (find_omp_clause (c, OMP_CLAUSE_SIMD)) | |
3626 | { | |
3627 | /* ordered simd must be closely nested inside of simd region, | |
3628 | and simd region must not encounter constructs other than | |
3629 | ordered simd, therefore ordered simd may be either orphaned, | |
3630 | or ctx->stmt must be simd. The latter case is handled already | |
3631 | earlier. */ | |
3632 | if (ctx != NULL) | |
3633 | { | |
3634 | error_at (gimple_location (stmt), | |
3635 | "%<ordered%> %<simd%> must be closely nested inside " | |
3636 | "%<simd%> region"); | |
d9a6bd32 JJ |
3637 | return false; |
3638 | } | |
3639 | } | |
a6fc8e21 | 3640 | for (; ctx != NULL; ctx = ctx->outer) |
726a989a | 3641 | switch (gimple_code (ctx->stmt)) |
a6fc8e21 | 3642 | { |
726a989a RB |
3643 | case GIMPLE_OMP_CRITICAL: |
3644 | case GIMPLE_OMP_TASK: | |
d9f4ea18 JJ |
3645 | case GIMPLE_OMP_ORDERED: |
3646 | ordered_in_taskloop: | |
26127932 | 3647 | error_at (gimple_location (stmt), |
d9f4ea18 JJ |
3648 | "%<ordered%> region may not be closely nested inside " |
3649 | "of %<critical%>, %<ordered%>, explicit %<task%> or " | |
3650 | "%<taskloop%> region"); | |
26127932 | 3651 | return false; |
726a989a | 3652 | case GIMPLE_OMP_FOR: |
d9f4ea18 JJ |
3653 | if (gimple_omp_for_kind (ctx->stmt) == GF_OMP_FOR_KIND_TASKLOOP) |
3654 | goto ordered_in_taskloop; | |
726a989a | 3655 | if (find_omp_clause (gimple_omp_for_clauses (ctx->stmt), |
a6fc8e21 | 3656 | OMP_CLAUSE_ORDERED) == NULL) |
26127932 JJ |
3657 | { |
3658 | error_at (gimple_location (stmt), | |
d9f4ea18 JJ |
3659 | "%<ordered%> region must be closely nested inside " |
3660 | "a loop region with an %<ordered%> clause"); | |
26127932 JJ |
3661 | return false; |
3662 | } | |
3663 | return true; | |
d9f4ea18 JJ |
3664 | case GIMPLE_OMP_TARGET: |
3665 | if (gimple_omp_target_kind (ctx->stmt) | |
3666 | != GF_OMP_TARGET_KIND_REGION) | |
3667 | break; | |
3668 | /* FALLTHRU */ | |
726a989a | 3669 | case GIMPLE_OMP_PARALLEL: |
d9f4ea18 | 3670 | case GIMPLE_OMP_TEAMS: |
acf0174b | 3671 | error_at (gimple_location (stmt), |
d9f4ea18 JJ |
3672 | "%<ordered%> region must be closely nested inside " |
3673 | "a loop region with an %<ordered%> clause"); | |
acf0174b | 3674 | return false; |
a6fc8e21 JJ |
3675 | default: |
3676 | break; | |
3677 | } | |
3678 | break; | |
726a989a | 3679 | case GIMPLE_OMP_CRITICAL: |
538dd0b7 DM |
3680 | { |
3681 | tree this_stmt_name | |
3682 | = gimple_omp_critical_name (as_a <gomp_critical *> (stmt)); | |
3683 | for (; ctx != NULL; ctx = ctx->outer) | |
3684 | if (gomp_critical *other_crit | |
3685 | = dyn_cast <gomp_critical *> (ctx->stmt)) | |
3686 | if (this_stmt_name == gimple_omp_critical_name (other_crit)) | |
3687 | { | |
3688 | error_at (gimple_location (stmt), | |
d9f4ea18 JJ |
3689 | "%<critical%> region may not be nested inside " |
3690 | "a %<critical%> region with the same name"); | |
538dd0b7 DM |
3691 | return false; |
3692 | } | |
3693 | } | |
a6fc8e21 | 3694 | break; |
acf0174b JJ |
3695 | case GIMPLE_OMP_TEAMS: |
3696 | if (ctx == NULL | |
3697 | || gimple_code (ctx->stmt) != GIMPLE_OMP_TARGET | |
3698 | || gimple_omp_target_kind (ctx->stmt) != GF_OMP_TARGET_KIND_REGION) | |
3699 | { | |
3700 | error_at (gimple_location (stmt), | |
d9f4ea18 JJ |
3701 | "%<teams%> construct not closely nested inside of " |
3702 | "%<target%> construct"); | |
acf0174b JJ |
3703 | return false; |
3704 | } | |
3705 | break; | |
f014c653 | 3706 | case GIMPLE_OMP_TARGET: |
d9a6bd32 JJ |
3707 | for (c = gimple_omp_target_clauses (stmt); c; c = OMP_CLAUSE_CHAIN (c)) |
3708 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_DEPEND | |
3709 | && (OMP_CLAUSE_DEPEND_KIND (c) == OMP_CLAUSE_DEPEND_SOURCE | |
3710 | || OMP_CLAUSE_DEPEND_KIND (c) == OMP_CLAUSE_DEPEND_SINK)) | |
3711 | { | |
3712 | enum omp_clause_depend_kind kind = OMP_CLAUSE_DEPEND_KIND (c); | |
3713 | error_at (OMP_CLAUSE_LOCATION (c), | |
3714 | "%<depend(%s)%> is only allowed in %<omp ordered%>", | |
3715 | kind == OMP_CLAUSE_DEPEND_SOURCE ? "source" : "sink"); | |
3716 | return false; | |
3717 | } | |
f014c653 | 3718 | for (; ctx != NULL; ctx = ctx->outer) |
41dbbb37 TS |
3719 | { |
3720 | if (gimple_code (ctx->stmt) != GIMPLE_OMP_TARGET) | |
3721 | { | |
3722 | if (is_gimple_omp (stmt) | |
3723 | && is_gimple_omp_oacc (stmt) | |
3724 | && is_gimple_omp (ctx->stmt)) | |
3725 | { | |
3726 | error_at (gimple_location (stmt), | |
3727 | "OpenACC construct inside of non-OpenACC region"); | |
3728 | return false; | |
3729 | } | |
3730 | continue; | |
3731 | } | |
3732 | ||
3733 | const char *stmt_name, *ctx_stmt_name; | |
3734 | switch (gimple_omp_target_kind (stmt)) | |
3735 | { | |
3736 | case GF_OMP_TARGET_KIND_REGION: stmt_name = "target"; break; | |
3737 | case GF_OMP_TARGET_KIND_DATA: stmt_name = "target data"; break; | |
3738 | case GF_OMP_TARGET_KIND_UPDATE: stmt_name = "target update"; break; | |
d9a6bd32 JJ |
3739 | case GF_OMP_TARGET_KIND_ENTER_DATA: |
3740 | stmt_name = "target enter data"; break; | |
3741 | case GF_OMP_TARGET_KIND_EXIT_DATA: | |
3742 | stmt_name = "target exit data"; break; | |
41dbbb37 TS |
3743 | case GF_OMP_TARGET_KIND_OACC_PARALLEL: stmt_name = "parallel"; break; |
3744 | case GF_OMP_TARGET_KIND_OACC_KERNELS: stmt_name = "kernels"; break; | |
3745 | case GF_OMP_TARGET_KIND_OACC_DATA: stmt_name = "data"; break; | |
3746 | case GF_OMP_TARGET_KIND_OACC_UPDATE: stmt_name = "update"; break; | |
d9a6bd32 JJ |
3747 | case GF_OMP_TARGET_KIND_OACC_ENTER_EXIT_DATA: |
3748 | stmt_name = "enter/exit data"; break; | |
37d5ad46 JB |
3749 | case GF_OMP_TARGET_KIND_OACC_HOST_DATA: stmt_name = "host_data"; |
3750 | break; | |
41dbbb37 TS |
3751 | default: gcc_unreachable (); |
3752 | } | |
3753 | switch (gimple_omp_target_kind (ctx->stmt)) | |
3754 | { | |
3755 | case GF_OMP_TARGET_KIND_REGION: ctx_stmt_name = "target"; break; | |
3756 | case GF_OMP_TARGET_KIND_DATA: ctx_stmt_name = "target data"; break; | |
d9a6bd32 JJ |
3757 | case GF_OMP_TARGET_KIND_OACC_PARALLEL: |
3758 | ctx_stmt_name = "parallel"; break; | |
3759 | case GF_OMP_TARGET_KIND_OACC_KERNELS: | |
3760 | ctx_stmt_name = "kernels"; break; | |
41dbbb37 | 3761 | case GF_OMP_TARGET_KIND_OACC_DATA: ctx_stmt_name = "data"; break; |
37d5ad46 JB |
3762 | case GF_OMP_TARGET_KIND_OACC_HOST_DATA: |
3763 | ctx_stmt_name = "host_data"; break; | |
41dbbb37 TS |
3764 | default: gcc_unreachable (); |
3765 | } | |
3766 | ||
3767 | /* OpenACC/OpenMP mismatch? */ | |
3768 | if (is_gimple_omp_oacc (stmt) | |
3769 | != is_gimple_omp_oacc (ctx->stmt)) | |
3770 | { | |
3771 | error_at (gimple_location (stmt), | |
d9f4ea18 | 3772 | "%s %qs construct inside of %s %qs region", |
41dbbb37 TS |
3773 | (is_gimple_omp_oacc (stmt) |
3774 | ? "OpenACC" : "OpenMP"), stmt_name, | |
3775 | (is_gimple_omp_oacc (ctx->stmt) | |
3776 | ? "OpenACC" : "OpenMP"), ctx_stmt_name); | |
3777 | return false; | |
3778 | } | |
3779 | if (is_gimple_omp_offloaded (ctx->stmt)) | |
3780 | { | |
3781 | /* No GIMPLE_OMP_TARGET inside offloaded OpenACC CTX. */ | |
3782 | if (is_gimple_omp_oacc (ctx->stmt)) | |
3783 | { | |
3784 | error_at (gimple_location (stmt), | |
d9f4ea18 | 3785 | "%qs construct inside of %qs region", |
41dbbb37 TS |
3786 | stmt_name, ctx_stmt_name); |
3787 | return false; | |
3788 | } | |
3789 | else | |
3790 | { | |
41dbbb37 | 3791 | warning_at (gimple_location (stmt), 0, |
d9f4ea18 | 3792 | "%qs construct inside of %qs region", |
41dbbb37 TS |
3793 | stmt_name, ctx_stmt_name); |
3794 | } | |
3795 | } | |
3796 | } | |
f014c653 | 3797 | break; |
a6fc8e21 JJ |
3798 | default: |
3799 | break; | |
3800 | } | |
26127932 | 3801 | return true; |
a6fc8e21 JJ |
3802 | } |
3803 | ||
3804 | ||
726a989a RB |
3805 | /* Helper function scan_omp. |
3806 | ||
3807 | Callback for walk_tree or operators in walk_gimple_stmt used to | |
41dbbb37 | 3808 | scan for OMP directives in TP. */ |
953ff289 DN |
3809 | |
3810 | static tree | |
726a989a | 3811 | scan_omp_1_op (tree *tp, int *walk_subtrees, void *data) |
953ff289 | 3812 | { |
d3bfe4de KG |
3813 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data; |
3814 | omp_context *ctx = (omp_context *) wi->info; | |
953ff289 DN |
3815 | tree t = *tp; |
3816 | ||
726a989a RB |
3817 | switch (TREE_CODE (t)) |
3818 | { | |
3819 | case VAR_DECL: | |
3820 | case PARM_DECL: | |
3821 | case LABEL_DECL: | |
3822 | case RESULT_DECL: | |
3823 | if (ctx) | |
b2b40051 MJ |
3824 | { |
3825 | tree repl = remap_decl (t, &ctx->cb); | |
3826 | gcc_checking_assert (TREE_CODE (repl) != ERROR_MARK); | |
3827 | *tp = repl; | |
3828 | } | |
726a989a RB |
3829 | break; |
3830 | ||
3831 | default: | |
3832 | if (ctx && TYPE_P (t)) | |
3833 | *tp = remap_type (t, &ctx->cb); | |
3834 | else if (!DECL_P (t)) | |
a900ae6b JJ |
3835 | { |
3836 | *walk_subtrees = 1; | |
3837 | if (ctx) | |
70f34814 RG |
3838 | { |
3839 | tree tem = remap_type (TREE_TYPE (t), &ctx->cb); | |
3840 | if (tem != TREE_TYPE (t)) | |
3841 | { | |
3842 | if (TREE_CODE (t) == INTEGER_CST) | |
807e902e | 3843 | *tp = wide_int_to_tree (tem, t); |
70f34814 RG |
3844 | else |
3845 | TREE_TYPE (t) = tem; | |
3846 | } | |
3847 | } | |
a900ae6b | 3848 | } |
726a989a RB |
3849 | break; |
3850 | } | |
3851 | ||
3852 | return NULL_TREE; | |
3853 | } | |
3854 | ||
c02065fc AH |
3855 | /* Return true if FNDECL is a setjmp or a longjmp. */ |
3856 | ||
3857 | static bool | |
3858 | setjmp_or_longjmp_p (const_tree fndecl) | |
3859 | { | |
3860 | if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
3861 | && (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_SETJMP | |
3862 | || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_LONGJMP)) | |
3863 | return true; | |
3864 | ||
3865 | tree declname = DECL_NAME (fndecl); | |
3866 | if (!declname) | |
3867 | return false; | |
3868 | const char *name = IDENTIFIER_POINTER (declname); | |
3869 | return !strcmp (name, "setjmp") || !strcmp (name, "longjmp"); | |
3870 | } | |
3871 | ||
726a989a RB |
3872 | |
3873 | /* Helper function for scan_omp. | |
3874 | ||
41dbbb37 | 3875 | Callback for walk_gimple_stmt used to scan for OMP directives in |
726a989a RB |
3876 | the current statement in GSI. */ |
3877 | ||
3878 | static tree | |
3879 | scan_omp_1_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p, | |
3880 | struct walk_stmt_info *wi) | |
3881 | { | |
355fe088 | 3882 | gimple *stmt = gsi_stmt (*gsi); |
726a989a RB |
3883 | omp_context *ctx = (omp_context *) wi->info; |
3884 | ||
3885 | if (gimple_has_location (stmt)) | |
3886 | input_location = gimple_location (stmt); | |
953ff289 | 3887 | |
41dbbb37 | 3888 | /* Check the nesting restrictions. */ |
acf0174b JJ |
3889 | bool remove = false; |
3890 | if (is_gimple_omp (stmt)) | |
3891 | remove = !check_omp_nesting_restrictions (stmt, ctx); | |
3892 | else if (is_gimple_call (stmt)) | |
3893 | { | |
3894 | tree fndecl = gimple_call_fndecl (stmt); | |
c02065fc AH |
3895 | if (fndecl) |
3896 | { | |
3897 | if (setjmp_or_longjmp_p (fndecl) | |
3898 | && ctx | |
3899 | && gimple_code (ctx->stmt) == GIMPLE_OMP_FOR | |
0aadce73 | 3900 | && gimple_omp_for_kind (ctx->stmt) & GF_OMP_FOR_SIMD) |
c02065fc AH |
3901 | { |
3902 | remove = true; | |
3903 | error_at (gimple_location (stmt), | |
3904 | "setjmp/longjmp inside simd construct"); | |
3905 | } | |
3906 | else if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
3907 | switch (DECL_FUNCTION_CODE (fndecl)) | |
3908 | { | |
3909 | case BUILT_IN_GOMP_BARRIER: | |
3910 | case BUILT_IN_GOMP_CANCEL: | |
3911 | case BUILT_IN_GOMP_CANCELLATION_POINT: | |
3912 | case BUILT_IN_GOMP_TASKYIELD: | |
3913 | case BUILT_IN_GOMP_TASKWAIT: | |
3914 | case BUILT_IN_GOMP_TASKGROUP_START: | |
3915 | case BUILT_IN_GOMP_TASKGROUP_END: | |
3916 | remove = !check_omp_nesting_restrictions (stmt, ctx); | |
3917 | break; | |
3918 | default: | |
3919 | break; | |
3920 | } | |
3921 | } | |
acf0174b JJ |
3922 | } |
3923 | if (remove) | |
3924 | { | |
3925 | stmt = gimple_build_nop (); | |
3926 | gsi_replace (gsi, stmt, false); | |
a68ab351 | 3927 | } |
a6fc8e21 | 3928 | |
726a989a RB |
3929 | *handled_ops_p = true; |
3930 | ||
3931 | switch (gimple_code (stmt)) | |
953ff289 | 3932 | { |
726a989a | 3933 | case GIMPLE_OMP_PARALLEL: |
a68ab351 | 3934 | taskreg_nesting_level++; |
726a989a | 3935 | scan_omp_parallel (gsi, ctx); |
a68ab351 JJ |
3936 | taskreg_nesting_level--; |
3937 | break; | |
3938 | ||
726a989a | 3939 | case GIMPLE_OMP_TASK: |
a68ab351 | 3940 | taskreg_nesting_level++; |
726a989a | 3941 | scan_omp_task (gsi, ctx); |
a68ab351 | 3942 | taskreg_nesting_level--; |
953ff289 DN |
3943 | break; |
3944 | ||
726a989a | 3945 | case GIMPLE_OMP_FOR: |
538dd0b7 | 3946 | scan_omp_for (as_a <gomp_for *> (stmt), ctx); |
953ff289 DN |
3947 | break; |
3948 | ||
726a989a | 3949 | case GIMPLE_OMP_SECTIONS: |
538dd0b7 | 3950 | scan_omp_sections (as_a <gomp_sections *> (stmt), ctx); |
953ff289 DN |
3951 | break; |
3952 | ||
726a989a | 3953 | case GIMPLE_OMP_SINGLE: |
538dd0b7 | 3954 | scan_omp_single (as_a <gomp_single *> (stmt), ctx); |
953ff289 DN |
3955 | break; |
3956 | ||
726a989a RB |
3957 | case GIMPLE_OMP_SECTION: |
3958 | case GIMPLE_OMP_MASTER: | |
acf0174b | 3959 | case GIMPLE_OMP_TASKGROUP: |
726a989a RB |
3960 | case GIMPLE_OMP_ORDERED: |
3961 | case GIMPLE_OMP_CRITICAL: | |
b2b40051 | 3962 | case GIMPLE_OMP_GRID_BODY: |
726a989a | 3963 | ctx = new_omp_context (stmt, ctx); |
26127932 | 3964 | scan_omp (gimple_omp_body_ptr (stmt), ctx); |
953ff289 DN |
3965 | break; |
3966 | ||
acf0174b | 3967 | case GIMPLE_OMP_TARGET: |
538dd0b7 | 3968 | scan_omp_target (as_a <gomp_target *> (stmt), ctx); |
acf0174b JJ |
3969 | break; |
3970 | ||
3971 | case GIMPLE_OMP_TEAMS: | |
538dd0b7 | 3972 | scan_omp_teams (as_a <gomp_teams *> (stmt), ctx); |
acf0174b JJ |
3973 | break; |
3974 | ||
726a989a | 3975 | case GIMPLE_BIND: |
953ff289 DN |
3976 | { |
3977 | tree var; | |
953ff289 | 3978 | |
726a989a RB |
3979 | *handled_ops_p = false; |
3980 | if (ctx) | |
538dd0b7 DM |
3981 | for (var = gimple_bind_vars (as_a <gbind *> (stmt)); |
3982 | var ; | |
3983 | var = DECL_CHAIN (var)) | |
726a989a | 3984 | insert_decl_map (&ctx->cb, var, var); |
953ff289 DN |
3985 | } |
3986 | break; | |
953ff289 | 3987 | default: |
726a989a | 3988 | *handled_ops_p = false; |
953ff289 DN |
3989 | break; |
3990 | } | |
3991 | ||
3992 | return NULL_TREE; | |
3993 | } | |
3994 | ||
3995 | ||
726a989a | 3996 | /* Scan all the statements starting at the current statement. CTX |
41dbbb37 | 3997 | contains context information about the OMP directives and |
726a989a | 3998 | clauses found during the scan. */ |
953ff289 DN |
3999 | |
4000 | static void | |
26127932 | 4001 | scan_omp (gimple_seq *body_p, omp_context *ctx) |
953ff289 DN |
4002 | { |
4003 | location_t saved_location; | |
4004 | struct walk_stmt_info wi; | |
4005 | ||
4006 | memset (&wi, 0, sizeof (wi)); | |
953ff289 | 4007 | wi.info = ctx; |
953ff289 DN |
4008 | wi.want_locations = true; |
4009 | ||
4010 | saved_location = input_location; | |
26127932 | 4011 | walk_gimple_seq_mod (body_p, scan_omp_1_stmt, scan_omp_1_op, &wi); |
953ff289 DN |
4012 | input_location = saved_location; |
4013 | } | |
4014 | \f | |
4015 | /* Re-gimplification and code generation routines. */ | |
4016 | ||
4017 | /* Build a call to GOMP_barrier. */ | |
4018 | ||
355fe088 | 4019 | static gimple * |
acf0174b JJ |
4020 | build_omp_barrier (tree lhs) |
4021 | { | |
4022 | tree fndecl = builtin_decl_explicit (lhs ? BUILT_IN_GOMP_BARRIER_CANCEL | |
4023 | : BUILT_IN_GOMP_BARRIER); | |
538dd0b7 | 4024 | gcall *g = gimple_build_call (fndecl, 0); |
acf0174b JJ |
4025 | if (lhs) |
4026 | gimple_call_set_lhs (g, lhs); | |
4027 | return g; | |
953ff289 DN |
4028 | } |
4029 | ||
4030 | /* If a context was created for STMT when it was scanned, return it. */ | |
4031 | ||
4032 | static omp_context * | |
355fe088 | 4033 | maybe_lookup_ctx (gimple *stmt) |
953ff289 DN |
4034 | { |
4035 | splay_tree_node n; | |
4036 | n = splay_tree_lookup (all_contexts, (splay_tree_key) stmt); | |
4037 | return n ? (omp_context *) n->value : NULL; | |
4038 | } | |
4039 | ||
50674e96 DN |
4040 | |
4041 | /* Find the mapping for DECL in CTX or the immediately enclosing | |
4042 | context that has a mapping for DECL. | |
4043 | ||
4044 | If CTX is a nested parallel directive, we may have to use the decl | |
4045 | mappings created in CTX's parent context. Suppose that we have the | |
4046 | following parallel nesting (variable UIDs showed for clarity): | |
4047 | ||
4048 | iD.1562 = 0; | |
4049 | #omp parallel shared(iD.1562) -> outer parallel | |
4050 | iD.1562 = iD.1562 + 1; | |
4051 | ||
4052 | #omp parallel shared (iD.1562) -> inner parallel | |
4053 | iD.1562 = iD.1562 - 1; | |
4054 | ||
4055 | Each parallel structure will create a distinct .omp_data_s structure | |
4056 | for copying iD.1562 in/out of the directive: | |
4057 | ||
4058 | outer parallel .omp_data_s.1.i -> iD.1562 | |
4059 | inner parallel .omp_data_s.2.i -> iD.1562 | |
4060 | ||
4061 | A shared variable mapping will produce a copy-out operation before | |
4062 | the parallel directive and a copy-in operation after it. So, in | |
4063 | this case we would have: | |
4064 | ||
4065 | iD.1562 = 0; | |
4066 | .omp_data_o.1.i = iD.1562; | |
4067 | #omp parallel shared(iD.1562) -> outer parallel | |
4068 | .omp_data_i.1 = &.omp_data_o.1 | |
4069 | .omp_data_i.1->i = .omp_data_i.1->i + 1; | |
4070 | ||
4071 | .omp_data_o.2.i = iD.1562; -> ** | |
4072 | #omp parallel shared(iD.1562) -> inner parallel | |
4073 | .omp_data_i.2 = &.omp_data_o.2 | |
4074 | .omp_data_i.2->i = .omp_data_i.2->i - 1; | |
4075 | ||
4076 | ||
4077 | ** This is a problem. The symbol iD.1562 cannot be referenced | |
4078 | inside the body of the outer parallel region. But since we are | |
4079 | emitting this copy operation while expanding the inner parallel | |
4080 | directive, we need to access the CTX structure of the outer | |
4081 | parallel directive to get the correct mapping: | |
4082 | ||
4083 | .omp_data_o.2.i = .omp_data_i.1->i | |
4084 | ||
4085 | Since there may be other workshare or parallel directives enclosing | |
4086 | the parallel directive, it may be necessary to walk up the context | |
4087 | parent chain. This is not a problem in general because nested | |
4088 | parallelism happens only rarely. */ | |
4089 | ||
4090 | static tree | |
4091 | lookup_decl_in_outer_ctx (tree decl, omp_context *ctx) | |
4092 | { | |
4093 | tree t; | |
4094 | omp_context *up; | |
4095 | ||
50674e96 DN |
4096 | for (up = ctx->outer, t = NULL; up && t == NULL; up = up->outer) |
4097 | t = maybe_lookup_decl (decl, up); | |
4098 | ||
d2dda7fe | 4099 | gcc_assert (!ctx->is_nested || t || is_global_var (decl)); |
50674e96 | 4100 | |
64964499 | 4101 | return t ? t : decl; |
50674e96 DN |
4102 | } |
4103 | ||
4104 | ||
8ca5b2a2 JJ |
4105 | /* Similar to lookup_decl_in_outer_ctx, but return DECL if not found |
4106 | in outer contexts. */ | |
4107 | ||
4108 | static tree | |
4109 | maybe_lookup_decl_in_outer_ctx (tree decl, omp_context *ctx) | |
4110 | { | |
4111 | tree t = NULL; | |
4112 | omp_context *up; | |
4113 | ||
d2dda7fe JJ |
4114 | for (up = ctx->outer, t = NULL; up && t == NULL; up = up->outer) |
4115 | t = maybe_lookup_decl (decl, up); | |
8ca5b2a2 JJ |
4116 | |
4117 | return t ? t : decl; | |
4118 | } | |
4119 | ||
4120 | ||
f2c9f71d | 4121 | /* Construct the initialization value for reduction operation OP. */ |
953ff289 DN |
4122 | |
4123 | tree | |
f2c9f71d | 4124 | omp_reduction_init_op (location_t loc, enum tree_code op, tree type) |
953ff289 | 4125 | { |
f2c9f71d | 4126 | switch (op) |
953ff289 DN |
4127 | { |
4128 | case PLUS_EXPR: | |
4129 | case MINUS_EXPR: | |
4130 | case BIT_IOR_EXPR: | |
4131 | case BIT_XOR_EXPR: | |
4132 | case TRUTH_OR_EXPR: | |
4133 | case TRUTH_ORIF_EXPR: | |
4134 | case TRUTH_XOR_EXPR: | |
4135 | case NE_EXPR: | |
e8160c9a | 4136 | return build_zero_cst (type); |
953ff289 DN |
4137 | |
4138 | case MULT_EXPR: | |
4139 | case TRUTH_AND_EXPR: | |
4140 | case TRUTH_ANDIF_EXPR: | |
4141 | case EQ_EXPR: | |
db3927fb | 4142 | return fold_convert_loc (loc, type, integer_one_node); |
953ff289 DN |
4143 | |
4144 | case BIT_AND_EXPR: | |
db3927fb | 4145 | return fold_convert_loc (loc, type, integer_minus_one_node); |
953ff289 DN |
4146 | |
4147 | case MAX_EXPR: | |
4148 | if (SCALAR_FLOAT_TYPE_P (type)) | |
4149 | { | |
4150 | REAL_VALUE_TYPE max, min; | |
3d3dbadd | 4151 | if (HONOR_INFINITIES (type)) |
953ff289 DN |
4152 | { |
4153 | real_inf (&max); | |
4154 | real_arithmetic (&min, NEGATE_EXPR, &max, NULL); | |
4155 | } | |
4156 | else | |
4157 | real_maxval (&min, 1, TYPE_MODE (type)); | |
4158 | return build_real (type, min); | |
4159 | } | |
3ff2d74e TV |
4160 | else if (POINTER_TYPE_P (type)) |
4161 | { | |
4162 | wide_int min | |
4163 | = wi::min_value (TYPE_PRECISION (type), TYPE_SIGN (type)); | |
4164 | return wide_int_to_tree (type, min); | |
4165 | } | |
953ff289 DN |
4166 | else |
4167 | { | |
4168 | gcc_assert (INTEGRAL_TYPE_P (type)); | |
4169 | return TYPE_MIN_VALUE (type); | |
4170 | } | |
4171 | ||
4172 | case MIN_EXPR: | |
4173 | if (SCALAR_FLOAT_TYPE_P (type)) | |
4174 | { | |
4175 | REAL_VALUE_TYPE max; | |
3d3dbadd | 4176 | if (HONOR_INFINITIES (type)) |
953ff289 DN |
4177 | real_inf (&max); |
4178 | else | |
4179 | real_maxval (&max, 0, TYPE_MODE (type)); | |
4180 | return build_real (type, max); | |
4181 | } | |
3ff2d74e TV |
4182 | else if (POINTER_TYPE_P (type)) |
4183 | { | |
4184 | wide_int max | |
4185 | = wi::max_value (TYPE_PRECISION (type), TYPE_SIGN (type)); | |
4186 | return wide_int_to_tree (type, max); | |
4187 | } | |
953ff289 DN |
4188 | else |
4189 | { | |
4190 | gcc_assert (INTEGRAL_TYPE_P (type)); | |
4191 | return TYPE_MAX_VALUE (type); | |
4192 | } | |
4193 | ||
4194 | default: | |
4195 | gcc_unreachable (); | |
4196 | } | |
4197 | } | |
4198 | ||
f2c9f71d TS |
4199 | /* Construct the initialization value for reduction CLAUSE. */ |
4200 | ||
4201 | tree | |
4202 | omp_reduction_init (tree clause, tree type) | |
4203 | { | |
4204 | return omp_reduction_init_op (OMP_CLAUSE_LOCATION (clause), | |
4205 | OMP_CLAUSE_REDUCTION_CODE (clause), type); | |
4206 | } | |
4207 | ||
acf0174b JJ |
4208 | /* Return alignment to be assumed for var in CLAUSE, which should be |
4209 | OMP_CLAUSE_ALIGNED. */ | |
4210 | ||
4211 | static tree | |
4212 | omp_clause_aligned_alignment (tree clause) | |
4213 | { | |
4214 | if (OMP_CLAUSE_ALIGNED_ALIGNMENT (clause)) | |
4215 | return OMP_CLAUSE_ALIGNED_ALIGNMENT (clause); | |
4216 | ||
4217 | /* Otherwise return implementation defined alignment. */ | |
4218 | unsigned int al = 1; | |
ef4bddc2 | 4219 | machine_mode mode, vmode; |
acf0174b JJ |
4220 | int vs = targetm.vectorize.autovectorize_vector_sizes (); |
4221 | if (vs) | |
4222 | vs = 1 << floor_log2 (vs); | |
4223 | static enum mode_class classes[] | |
4224 | = { MODE_INT, MODE_VECTOR_INT, MODE_FLOAT, MODE_VECTOR_FLOAT }; | |
4225 | for (int i = 0; i < 4; i += 2) | |
4226 | for (mode = GET_CLASS_NARROWEST_MODE (classes[i]); | |
4227 | mode != VOIDmode; | |
4228 | mode = GET_MODE_WIDER_MODE (mode)) | |
4229 | { | |
4230 | vmode = targetm.vectorize.preferred_simd_mode (mode); | |
4231 | if (GET_MODE_CLASS (vmode) != classes[i + 1]) | |
4232 | continue; | |
4233 | while (vs | |
4234 | && GET_MODE_SIZE (vmode) < vs | |
4235 | && GET_MODE_2XWIDER_MODE (vmode) != VOIDmode) | |
4236 | vmode = GET_MODE_2XWIDER_MODE (vmode); | |
4237 | ||
4238 | tree type = lang_hooks.types.type_for_mode (mode, 1); | |
4239 | if (type == NULL_TREE || TYPE_MODE (type) != mode) | |
4240 | continue; | |
4241 | type = build_vector_type (type, GET_MODE_SIZE (vmode) | |
4242 | / GET_MODE_SIZE (mode)); | |
4243 | if (TYPE_MODE (type) != vmode) | |
4244 | continue; | |
4245 | if (TYPE_ALIGN_UNIT (type) > al) | |
4246 | al = TYPE_ALIGN_UNIT (type); | |
4247 | } | |
4248 | return build_int_cst (integer_type_node, al); | |
4249 | } | |
4250 | ||
74bf76ed JJ |
4251 | /* Return maximum possible vectorization factor for the target. */ |
4252 | ||
4253 | static int | |
4254 | omp_max_vf (void) | |
4255 | { | |
4256 | if (!optimize | |
4257 | || optimize_debug | |
ab2ffbeb | 4258 | || !flag_tree_loop_optimize |
ea0f3e87 XDL |
4259 | || (!flag_tree_loop_vectorize |
4260 | && (global_options_set.x_flag_tree_loop_vectorize | |
4261 | || global_options_set.x_flag_tree_vectorize))) | |
74bf76ed JJ |
4262 | return 1; |
4263 | ||
4264 | int vs = targetm.vectorize.autovectorize_vector_sizes (); | |
4265 | if (vs) | |
4266 | { | |
4267 | vs = 1 << floor_log2 (vs); | |
4268 | return vs; | |
4269 | } | |
ef4bddc2 | 4270 | machine_mode vqimode = targetm.vectorize.preferred_simd_mode (QImode); |
74bf76ed JJ |
4271 | if (GET_MODE_CLASS (vqimode) == MODE_VECTOR_INT) |
4272 | return GET_MODE_NUNITS (vqimode); | |
4273 | return 1; | |
4274 | } | |
4275 | ||
4276 | /* Helper function of lower_rec_input_clauses, used for #pragma omp simd | |
4277 | privatization. */ | |
4278 | ||
4279 | static bool | |
4280 | lower_rec_simd_input_clauses (tree new_var, omp_context *ctx, int &max_vf, | |
4281 | tree &idx, tree &lane, tree &ivar, tree &lvar) | |
4282 | { | |
4283 | if (max_vf == 0) | |
4284 | { | |
4285 | max_vf = omp_max_vf (); | |
4286 | if (max_vf > 1) | |
4287 | { | |
4288 | tree c = find_omp_clause (gimple_omp_for_clauses (ctx->stmt), | |
4289 | OMP_CLAUSE_SAFELEN); | |
b46ebd6c JJ |
4290 | if (c && TREE_CODE (OMP_CLAUSE_SAFELEN_EXPR (c)) != INTEGER_CST) |
4291 | max_vf = 1; | |
4292 | else if (c && compare_tree_int (OMP_CLAUSE_SAFELEN_EXPR (c), | |
4293 | max_vf) == -1) | |
9439e9a1 | 4294 | max_vf = tree_to_shwi (OMP_CLAUSE_SAFELEN_EXPR (c)); |
74bf76ed JJ |
4295 | } |
4296 | if (max_vf > 1) | |
4297 | { | |
b731b390 JJ |
4298 | idx = create_tmp_var (unsigned_type_node); |
4299 | lane = create_tmp_var (unsigned_type_node); | |
74bf76ed JJ |
4300 | } |
4301 | } | |
4302 | if (max_vf == 1) | |
4303 | return false; | |
4304 | ||
4305 | tree atype = build_array_type_nelts (TREE_TYPE (new_var), max_vf); | |
b731b390 | 4306 | tree avar = create_tmp_var_raw (atype); |
74bf76ed JJ |
4307 | if (TREE_ADDRESSABLE (new_var)) |
4308 | TREE_ADDRESSABLE (avar) = 1; | |
4309 | DECL_ATTRIBUTES (avar) | |
4310 | = tree_cons (get_identifier ("omp simd array"), NULL, | |
4311 | DECL_ATTRIBUTES (avar)); | |
4312 | gimple_add_tmp_var (avar); | |
4313 | ivar = build4 (ARRAY_REF, TREE_TYPE (new_var), avar, idx, | |
4314 | NULL_TREE, NULL_TREE); | |
4315 | lvar = build4 (ARRAY_REF, TREE_TYPE (new_var), avar, lane, | |
4316 | NULL_TREE, NULL_TREE); | |
acf0174b JJ |
4317 | if (DECL_P (new_var)) |
4318 | { | |
4319 | SET_DECL_VALUE_EXPR (new_var, lvar); | |
4320 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
4321 | } | |
74bf76ed JJ |
4322 | return true; |
4323 | } | |
4324 | ||
decaaec8 JJ |
4325 | /* Helper function of lower_rec_input_clauses. For a reference |
4326 | in simd reduction, add an underlying variable it will reference. */ | |
4327 | ||
4328 | static void | |
4329 | handle_simd_reference (location_t loc, tree new_vard, gimple_seq *ilist) | |
4330 | { | |
4331 | tree z = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (new_vard))); | |
4332 | if (TREE_CONSTANT (z)) | |
4333 | { | |
d9a6bd32 JJ |
4334 | z = create_tmp_var_raw (TREE_TYPE (TREE_TYPE (new_vard)), |
4335 | get_name (new_vard)); | |
decaaec8 JJ |
4336 | gimple_add_tmp_var (z); |
4337 | TREE_ADDRESSABLE (z) = 1; | |
4338 | z = build_fold_addr_expr_loc (loc, z); | |
4339 | gimplify_assign (new_vard, z, ilist); | |
4340 | } | |
4341 | } | |
4342 | ||
953ff289 DN |
4343 | /* Generate code to implement the input clauses, FIRSTPRIVATE and COPYIN, |
4344 | from the receiver (aka child) side and initializers for REFERENCE_TYPE | |
4345 | private variables. Initialization statements go in ILIST, while calls | |
4346 | to destructors go in DLIST. */ | |
4347 | ||
4348 | static void | |
726a989a | 4349 | lower_rec_input_clauses (tree clauses, gimple_seq *ilist, gimple_seq *dlist, |
acf0174b | 4350 | omp_context *ctx, struct omp_for_data *fd) |
953ff289 | 4351 | { |
5039610b | 4352 | tree c, dtor, copyin_seq, x, ptr; |
953ff289 | 4353 | bool copyin_by_ref = false; |
8ca5b2a2 | 4354 | bool lastprivate_firstprivate = false; |
acf0174b | 4355 | bool reduction_omp_orig_ref = false; |
953ff289 | 4356 | int pass; |
74bf76ed | 4357 | bool is_simd = (gimple_code (ctx->stmt) == GIMPLE_OMP_FOR |
0aadce73 | 4358 | && gimple_omp_for_kind (ctx->stmt) & GF_OMP_FOR_SIMD); |
74bf76ed JJ |
4359 | int max_vf = 0; |
4360 | tree lane = NULL_TREE, idx = NULL_TREE; | |
4361 | tree ivar = NULL_TREE, lvar = NULL_TREE; | |
4362 | gimple_seq llist[2] = { NULL, NULL }; | |
953ff289 | 4363 | |
953ff289 DN |
4364 | copyin_seq = NULL; |
4365 | ||
74bf76ed JJ |
4366 | /* Set max_vf=1 (which will later enforce safelen=1) in simd loops |
4367 | with data sharing clauses referencing variable sized vars. That | |
4368 | is unnecessarily hard to support and very unlikely to result in | |
4369 | vectorized code anyway. */ | |
4370 | if (is_simd) | |
4371 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
4372 | switch (OMP_CLAUSE_CODE (c)) | |
4373 | { | |
da6f124d JJ |
4374 | case OMP_CLAUSE_LINEAR: |
4375 | if (OMP_CLAUSE_LINEAR_ARRAY (c)) | |
4376 | max_vf = 1; | |
4377 | /* FALLTHRU */ | |
74bf76ed JJ |
4378 | case OMP_CLAUSE_PRIVATE: |
4379 | case OMP_CLAUSE_FIRSTPRIVATE: | |
4380 | case OMP_CLAUSE_LASTPRIVATE: | |
74bf76ed JJ |
4381 | if (is_variable_sized (OMP_CLAUSE_DECL (c))) |
4382 | max_vf = 1; | |
4383 | break; | |
d9a6bd32 JJ |
4384 | case OMP_CLAUSE_REDUCTION: |
4385 | if (TREE_CODE (OMP_CLAUSE_DECL (c)) == MEM_REF | |
4386 | || is_variable_sized (OMP_CLAUSE_DECL (c))) | |
4387 | max_vf = 1; | |
4388 | break; | |
74bf76ed JJ |
4389 | default: |
4390 | continue; | |
4391 | } | |
4392 | ||
953ff289 DN |
4393 | /* Do all the fixed sized types in the first pass, and the variable sized |
4394 | types in the second pass. This makes sure that the scalar arguments to | |
b8698a0f | 4395 | the variable sized types are processed before we use them in the |
953ff289 DN |
4396 | variable sized operations. */ |
4397 | for (pass = 0; pass < 2; ++pass) | |
4398 | { | |
4399 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
4400 | { | |
aaf46ef9 | 4401 | enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c); |
953ff289 DN |
4402 | tree var, new_var; |
4403 | bool by_ref; | |
db3927fb | 4404 | location_t clause_loc = OMP_CLAUSE_LOCATION (c); |
953ff289 DN |
4405 | |
4406 | switch (c_kind) | |
4407 | { | |
4408 | case OMP_CLAUSE_PRIVATE: | |
4409 | if (OMP_CLAUSE_PRIVATE_DEBUG (c)) | |
4410 | continue; | |
4411 | break; | |
4412 | case OMP_CLAUSE_SHARED: | |
acf0174b JJ |
4413 | /* Ignore shared directives in teams construct. */ |
4414 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_TEAMS) | |
4415 | continue; | |
8ca5b2a2 JJ |
4416 | if (maybe_lookup_decl (OMP_CLAUSE_DECL (c), ctx) == NULL) |
4417 | { | |
d9a6bd32 JJ |
4418 | gcc_assert (OMP_CLAUSE_SHARED_FIRSTPRIVATE (c) |
4419 | || is_global_var (OMP_CLAUSE_DECL (c))); | |
8ca5b2a2 JJ |
4420 | continue; |
4421 | } | |
953ff289 | 4422 | case OMP_CLAUSE_FIRSTPRIVATE: |
953ff289 | 4423 | case OMP_CLAUSE_COPYIN: |
d9a6bd32 | 4424 | break; |
acf0174b | 4425 | case OMP_CLAUSE_LINEAR: |
d9a6bd32 JJ |
4426 | if (!OMP_CLAUSE_LINEAR_NO_COPYIN (c) |
4427 | && !OMP_CLAUSE_LINEAR_NO_COPYOUT (c)) | |
4428 | lastprivate_firstprivate = true; | |
acf0174b | 4429 | break; |
953ff289 | 4430 | case OMP_CLAUSE_REDUCTION: |
acf0174b JJ |
4431 | if (OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c)) |
4432 | reduction_omp_orig_ref = true; | |
953ff289 | 4433 | break; |
acf0174b | 4434 | case OMP_CLAUSE__LOOPTEMP_: |
d9a6bd32 | 4435 | /* Handle _looptemp_ clauses only on parallel/task. */ |
acf0174b JJ |
4436 | if (fd) |
4437 | continue; | |
74bf76ed | 4438 | break; |
077b0dfb | 4439 | case OMP_CLAUSE_LASTPRIVATE: |
8ca5b2a2 JJ |
4440 | if (OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)) |
4441 | { | |
4442 | lastprivate_firstprivate = true; | |
d9a6bd32 | 4443 | if (pass != 0 || is_taskloop_ctx (ctx)) |
8ca5b2a2 JJ |
4444 | continue; |
4445 | } | |
92d28cbb JJ |
4446 | /* Even without corresponding firstprivate, if |
4447 | decl is Fortran allocatable, it needs outer var | |
4448 | reference. */ | |
4449 | else if (pass == 0 | |
4450 | && lang_hooks.decls.omp_private_outer_ref | |
4451 | (OMP_CLAUSE_DECL (c))) | |
4452 | lastprivate_firstprivate = true; | |
077b0dfb | 4453 | break; |
acf0174b JJ |
4454 | case OMP_CLAUSE_ALIGNED: |
4455 | if (pass == 0) | |
4456 | continue; | |
4457 | var = OMP_CLAUSE_DECL (c); | |
4458 | if (TREE_CODE (TREE_TYPE (var)) == POINTER_TYPE | |
4459 | && !is_global_var (var)) | |
4460 | { | |
4461 | new_var = maybe_lookup_decl (var, ctx); | |
4462 | if (new_var == NULL_TREE) | |
4463 | new_var = maybe_lookup_decl_in_outer_ctx (var, ctx); | |
4464 | x = builtin_decl_explicit (BUILT_IN_ASSUME_ALIGNED); | |
4465 | x = build_call_expr_loc (clause_loc, x, 2, new_var, | |
4466 | omp_clause_aligned_alignment (c)); | |
4467 | x = fold_convert_loc (clause_loc, TREE_TYPE (new_var), x); | |
4468 | x = build2 (MODIFY_EXPR, TREE_TYPE (new_var), new_var, x); | |
4469 | gimplify_and_add (x, ilist); | |
4470 | } | |
4471 | else if (TREE_CODE (TREE_TYPE (var)) == ARRAY_TYPE | |
4472 | && is_global_var (var)) | |
4473 | { | |
4474 | tree ptype = build_pointer_type (TREE_TYPE (var)), t, t2; | |
4475 | new_var = lookup_decl (var, ctx); | |
4476 | t = maybe_lookup_decl_in_outer_ctx (var, ctx); | |
4477 | t = build_fold_addr_expr_loc (clause_loc, t); | |
4478 | t2 = builtin_decl_explicit (BUILT_IN_ASSUME_ALIGNED); | |
4479 | t = build_call_expr_loc (clause_loc, t2, 2, t, | |
4480 | omp_clause_aligned_alignment (c)); | |
4481 | t = fold_convert_loc (clause_loc, ptype, t); | |
b731b390 | 4482 | x = create_tmp_var (ptype); |
acf0174b JJ |
4483 | t = build2 (MODIFY_EXPR, ptype, x, t); |
4484 | gimplify_and_add (t, ilist); | |
4485 | t = build_simple_mem_ref_loc (clause_loc, x); | |
4486 | SET_DECL_VALUE_EXPR (new_var, t); | |
4487 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
4488 | } | |
4489 | continue; | |
953ff289 DN |
4490 | default: |
4491 | continue; | |
4492 | } | |
4493 | ||
4494 | new_var = var = OMP_CLAUSE_DECL (c); | |
d9a6bd32 JJ |
4495 | if (c_kind == OMP_CLAUSE_REDUCTION && TREE_CODE (var) == MEM_REF) |
4496 | { | |
4497 | var = TREE_OPERAND (var, 0); | |
e01d41e5 JJ |
4498 | if (TREE_CODE (var) == POINTER_PLUS_EXPR) |
4499 | var = TREE_OPERAND (var, 0); | |
d9a6bd32 JJ |
4500 | if (TREE_CODE (var) == INDIRECT_REF |
4501 | || TREE_CODE (var) == ADDR_EXPR) | |
4502 | var = TREE_OPERAND (var, 0); | |
4503 | if (is_variable_sized (var)) | |
4504 | { | |
4505 | gcc_assert (DECL_HAS_VALUE_EXPR_P (var)); | |
4506 | var = DECL_VALUE_EXPR (var); | |
4507 | gcc_assert (TREE_CODE (var) == INDIRECT_REF); | |
4508 | var = TREE_OPERAND (var, 0); | |
4509 | gcc_assert (DECL_P (var)); | |
4510 | } | |
4511 | new_var = var; | |
4512 | } | |
953ff289 DN |
4513 | if (c_kind != OMP_CLAUSE_COPYIN) |
4514 | new_var = lookup_decl (var, ctx); | |
4515 | ||
4516 | if (c_kind == OMP_CLAUSE_SHARED || c_kind == OMP_CLAUSE_COPYIN) | |
4517 | { | |
4518 | if (pass != 0) | |
4519 | continue; | |
4520 | } | |
d9a6bd32 JJ |
4521 | /* C/C++ array section reductions. */ |
4522 | else if (c_kind == OMP_CLAUSE_REDUCTION | |
4523 | && var != OMP_CLAUSE_DECL (c)) | |
953ff289 DN |
4524 | { |
4525 | if (pass == 0) | |
4526 | continue; | |
4527 | ||
e01d41e5 | 4528 | tree bias = TREE_OPERAND (OMP_CLAUSE_DECL (c), 1); |
d9a6bd32 | 4529 | tree orig_var = TREE_OPERAND (OMP_CLAUSE_DECL (c), 0); |
e01d41e5 JJ |
4530 | if (TREE_CODE (orig_var) == POINTER_PLUS_EXPR) |
4531 | { | |
4532 | tree b = TREE_OPERAND (orig_var, 1); | |
4533 | b = maybe_lookup_decl (b, ctx); | |
4534 | if (b == NULL) | |
4535 | { | |
4536 | b = TREE_OPERAND (orig_var, 1); | |
4537 | b = maybe_lookup_decl_in_outer_ctx (b, ctx); | |
4538 | } | |
4539 | if (integer_zerop (bias)) | |
4540 | bias = b; | |
4541 | else | |
4542 | { | |
4543 | bias = fold_convert_loc (clause_loc, | |
4544 | TREE_TYPE (b), bias); | |
4545 | bias = fold_build2_loc (clause_loc, PLUS_EXPR, | |
4546 | TREE_TYPE (b), b, bias); | |
4547 | } | |
4548 | orig_var = TREE_OPERAND (orig_var, 0); | |
4549 | } | |
d9a6bd32 JJ |
4550 | if (TREE_CODE (orig_var) == INDIRECT_REF |
4551 | || TREE_CODE (orig_var) == ADDR_EXPR) | |
4552 | orig_var = TREE_OPERAND (orig_var, 0); | |
4553 | tree d = OMP_CLAUSE_DECL (c); | |
4554 | tree type = TREE_TYPE (d); | |
4555 | gcc_assert (TREE_CODE (type) == ARRAY_TYPE); | |
4556 | tree v = TYPE_MAX_VALUE (TYPE_DOMAIN (type)); | |
4557 | const char *name = get_name (orig_var); | |
4558 | if (TREE_CONSTANT (v)) | |
a68ab351 | 4559 | { |
d9a6bd32 JJ |
4560 | x = create_tmp_var_raw (type, name); |
4561 | gimple_add_tmp_var (x); | |
4562 | TREE_ADDRESSABLE (x) = 1; | |
4563 | x = build_fold_addr_expr_loc (clause_loc, x); | |
4564 | } | |
4565 | else | |
4566 | { | |
4567 | tree atmp | |
4568 | = builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN); | |
4569 | tree t = maybe_lookup_decl (v, ctx); | |
4570 | if (t) | |
4571 | v = t; | |
4572 | else | |
4573 | v = maybe_lookup_decl_in_outer_ctx (v, ctx); | |
4574 | gimplify_expr (&v, ilist, NULL, is_gimple_val, fb_rvalue); | |
4575 | t = fold_build2_loc (clause_loc, PLUS_EXPR, | |
4576 | TREE_TYPE (v), v, | |
4577 | build_int_cst (TREE_TYPE (v), 1)); | |
4578 | t = fold_build2_loc (clause_loc, MULT_EXPR, | |
4579 | TREE_TYPE (v), t, | |
4580 | TYPE_SIZE_UNIT (TREE_TYPE (type))); | |
4581 | tree al = size_int (TYPE_ALIGN (TREE_TYPE (type))); | |
4582 | x = build_call_expr_loc (clause_loc, atmp, 2, t, al); | |
4583 | } | |
4584 | ||
4585 | tree ptype = build_pointer_type (TREE_TYPE (type)); | |
4586 | x = fold_convert_loc (clause_loc, ptype, x); | |
4587 | tree y = create_tmp_var (ptype, name); | |
4588 | gimplify_assign (y, x, ilist); | |
4589 | x = y; | |
e01d41e5 JJ |
4590 | tree yb = y; |
4591 | ||
4592 | if (!integer_zerop (bias)) | |
4593 | { | |
48a78aee JJ |
4594 | bias = fold_convert_loc (clause_loc, pointer_sized_int_node, |
4595 | bias); | |
4596 | yb = fold_convert_loc (clause_loc, pointer_sized_int_node, | |
4597 | x); | |
4598 | yb = fold_build2_loc (clause_loc, MINUS_EXPR, | |
4599 | pointer_sized_int_node, yb, bias); | |
4600 | x = fold_convert_loc (clause_loc, TREE_TYPE (x), yb); | |
e01d41e5 JJ |
4601 | yb = create_tmp_var (ptype, name); |
4602 | gimplify_assign (yb, x, ilist); | |
4603 | x = yb; | |
4604 | } | |
4605 | ||
4606 | d = TREE_OPERAND (d, 0); | |
4607 | if (TREE_CODE (d) == POINTER_PLUS_EXPR) | |
4608 | d = TREE_OPERAND (d, 0); | |
4609 | if (TREE_CODE (d) == ADDR_EXPR) | |
d9a6bd32 JJ |
4610 | { |
4611 | if (orig_var != var) | |
4612 | { | |
4613 | gcc_assert (is_variable_sized (orig_var)); | |
4614 | x = fold_convert_loc (clause_loc, TREE_TYPE (new_var), | |
4615 | x); | |
4616 | gimplify_assign (new_var, x, ilist); | |
4617 | tree new_orig_var = lookup_decl (orig_var, ctx); | |
4618 | tree t = build_fold_indirect_ref (new_var); | |
4619 | DECL_IGNORED_P (new_var) = 0; | |
4620 | TREE_THIS_NOTRAP (t); | |
4621 | SET_DECL_VALUE_EXPR (new_orig_var, t); | |
4622 | DECL_HAS_VALUE_EXPR_P (new_orig_var) = 1; | |
4623 | } | |
4624 | else | |
4625 | { | |
4626 | x = build2 (MEM_REF, TREE_TYPE (new_var), x, | |
4627 | build_int_cst (ptype, 0)); | |
4628 | SET_DECL_VALUE_EXPR (new_var, x); | |
4629 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
4630 | } | |
4631 | } | |
4632 | else | |
4633 | { | |
4634 | gcc_assert (orig_var == var); | |
e01d41e5 | 4635 | if (TREE_CODE (d) == INDIRECT_REF) |
d9a6bd32 JJ |
4636 | { |
4637 | x = create_tmp_var (ptype, name); | |
4638 | TREE_ADDRESSABLE (x) = 1; | |
e01d41e5 | 4639 | gimplify_assign (x, yb, ilist); |
d9a6bd32 JJ |
4640 | x = build_fold_addr_expr_loc (clause_loc, x); |
4641 | } | |
4642 | x = fold_convert_loc (clause_loc, TREE_TYPE (new_var), x); | |
4643 | gimplify_assign (new_var, x, ilist); | |
4644 | } | |
4645 | tree y1 = create_tmp_var (ptype, NULL); | |
4646 | gimplify_assign (y1, y, ilist); | |
4647 | tree i2 = NULL_TREE, y2 = NULL_TREE; | |
4648 | tree body2 = NULL_TREE, end2 = NULL_TREE; | |
4649 | tree y3 = NULL_TREE, y4 = NULL_TREE; | |
4650 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) || is_simd) | |
4651 | { | |
4652 | y2 = create_tmp_var (ptype, NULL); | |
4653 | gimplify_assign (y2, y, ilist); | |
4654 | tree ref = build_outer_var_ref (var, ctx); | |
4655 | /* For ref build_outer_var_ref already performs this. */ | |
e01d41e5 | 4656 | if (TREE_CODE (d) == INDIRECT_REF) |
d9a6bd32 | 4657 | gcc_assert (is_reference (var)); |
e01d41e5 | 4658 | else if (TREE_CODE (d) == ADDR_EXPR) |
d9a6bd32 JJ |
4659 | ref = build_fold_addr_expr (ref); |
4660 | else if (is_reference (var)) | |
4661 | ref = build_fold_addr_expr (ref); | |
4662 | ref = fold_convert_loc (clause_loc, ptype, ref); | |
4663 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) | |
4664 | && OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c)) | |
4665 | { | |
4666 | y3 = create_tmp_var (ptype, NULL); | |
4667 | gimplify_assign (y3, unshare_expr (ref), ilist); | |
4668 | } | |
4669 | if (is_simd) | |
4670 | { | |
4671 | y4 = create_tmp_var (ptype, NULL); | |
4672 | gimplify_assign (y4, ref, dlist); | |
4673 | } | |
4674 | } | |
4675 | tree i = create_tmp_var (TREE_TYPE (v), NULL); | |
4676 | gimplify_assign (i, build_int_cst (TREE_TYPE (v), 0), ilist); | |
4677 | tree body = create_artificial_label (UNKNOWN_LOCATION); | |
4678 | tree end = create_artificial_label (UNKNOWN_LOCATION); | |
4679 | gimple_seq_add_stmt (ilist, gimple_build_label (body)); | |
4680 | if (y2) | |
4681 | { | |
4682 | i2 = create_tmp_var (TREE_TYPE (v), NULL); | |
4683 | gimplify_assign (i2, build_int_cst (TREE_TYPE (v), 0), dlist); | |
4684 | body2 = create_artificial_label (UNKNOWN_LOCATION); | |
4685 | end2 = create_artificial_label (UNKNOWN_LOCATION); | |
4686 | gimple_seq_add_stmt (dlist, gimple_build_label (body2)); | |
4687 | } | |
4688 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) | |
4689 | { | |
4690 | tree placeholder = OMP_CLAUSE_REDUCTION_PLACEHOLDER (c); | |
4691 | tree decl_placeholder | |
4692 | = OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c); | |
4693 | SET_DECL_VALUE_EXPR (decl_placeholder, | |
4694 | build_simple_mem_ref (y1)); | |
4695 | DECL_HAS_VALUE_EXPR_P (decl_placeholder) = 1; | |
4696 | SET_DECL_VALUE_EXPR (placeholder, | |
4697 | y3 ? build_simple_mem_ref (y3) | |
4698 | : error_mark_node); | |
4699 | DECL_HAS_VALUE_EXPR_P (placeholder) = 1; | |
4700 | x = lang_hooks.decls.omp_clause_default_ctor | |
4701 | (c, build_simple_mem_ref (y1), | |
4702 | y3 ? build_simple_mem_ref (y3) : NULL_TREE); | |
4703 | if (x) | |
4704 | gimplify_and_add (x, ilist); | |
4705 | if (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)) | |
4706 | { | |
4707 | gimple_seq tseq = OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c); | |
4708 | lower_omp (&tseq, ctx); | |
4709 | gimple_seq_add_seq (ilist, tseq); | |
4710 | } | |
4711 | OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = NULL; | |
4712 | if (is_simd) | |
4713 | { | |
4714 | SET_DECL_VALUE_EXPR (decl_placeholder, | |
4715 | build_simple_mem_ref (y2)); | |
4716 | SET_DECL_VALUE_EXPR (placeholder, | |
4717 | build_simple_mem_ref (y4)); | |
4718 | gimple_seq tseq = OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c); | |
4719 | lower_omp (&tseq, ctx); | |
4720 | gimple_seq_add_seq (dlist, tseq); | |
4721 | OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = NULL; | |
4722 | } | |
4723 | DECL_HAS_VALUE_EXPR_P (placeholder) = 0; | |
4724 | DECL_HAS_VALUE_EXPR_P (decl_placeholder) = 0; | |
4725 | x = lang_hooks.decls.omp_clause_dtor | |
4726 | (c, build_simple_mem_ref (y2)); | |
4727 | if (x) | |
4728 | { | |
4729 | gimple_seq tseq = NULL; | |
4730 | dtor = x; | |
4731 | gimplify_stmt (&dtor, &tseq); | |
4732 | gimple_seq_add_seq (dlist, tseq); | |
4733 | } | |
4734 | } | |
4735 | else | |
4736 | { | |
4737 | x = omp_reduction_init (c, TREE_TYPE (type)); | |
4738 | enum tree_code code = OMP_CLAUSE_REDUCTION_CODE (c); | |
4739 | ||
4740 | /* reduction(-:var) sums up the partial results, so it | |
4741 | acts identically to reduction(+:var). */ | |
4742 | if (code == MINUS_EXPR) | |
4743 | code = PLUS_EXPR; | |
4744 | ||
4745 | gimplify_assign (build_simple_mem_ref (y1), x, ilist); | |
4746 | if (is_simd) | |
4747 | { | |
4748 | x = build2 (code, TREE_TYPE (type), | |
4749 | build_simple_mem_ref (y4), | |
4750 | build_simple_mem_ref (y2)); | |
4751 | gimplify_assign (build_simple_mem_ref (y4), x, dlist); | |
4752 | } | |
4753 | } | |
4754 | gimple *g | |
4755 | = gimple_build_assign (y1, POINTER_PLUS_EXPR, y1, | |
4756 | TYPE_SIZE_UNIT (TREE_TYPE (type))); | |
4757 | gimple_seq_add_stmt (ilist, g); | |
4758 | if (y3) | |
4759 | { | |
4760 | g = gimple_build_assign (y3, POINTER_PLUS_EXPR, y3, | |
4761 | TYPE_SIZE_UNIT (TREE_TYPE (type))); | |
4762 | gimple_seq_add_stmt (ilist, g); | |
4763 | } | |
4764 | g = gimple_build_assign (i, PLUS_EXPR, i, | |
4765 | build_int_cst (TREE_TYPE (i), 1)); | |
4766 | gimple_seq_add_stmt (ilist, g); | |
4767 | g = gimple_build_cond (LE_EXPR, i, v, body, end); | |
4768 | gimple_seq_add_stmt (ilist, g); | |
4769 | gimple_seq_add_stmt (ilist, gimple_build_label (end)); | |
4770 | if (y2) | |
4771 | { | |
4772 | g = gimple_build_assign (y2, POINTER_PLUS_EXPR, y2, | |
4773 | TYPE_SIZE_UNIT (TREE_TYPE (type))); | |
4774 | gimple_seq_add_stmt (dlist, g); | |
4775 | if (y4) | |
4776 | { | |
4777 | g = gimple_build_assign | |
4778 | (y4, POINTER_PLUS_EXPR, y4, | |
4779 | TYPE_SIZE_UNIT (TREE_TYPE (type))); | |
4780 | gimple_seq_add_stmt (dlist, g); | |
4781 | } | |
4782 | g = gimple_build_assign (i2, PLUS_EXPR, i2, | |
4783 | build_int_cst (TREE_TYPE (i2), 1)); | |
4784 | gimple_seq_add_stmt (dlist, g); | |
4785 | g = gimple_build_cond (LE_EXPR, i2, v, body2, end2); | |
4786 | gimple_seq_add_stmt (dlist, g); | |
4787 | gimple_seq_add_stmt (dlist, gimple_build_label (end2)); | |
4788 | } | |
4789 | continue; | |
4790 | } | |
4791 | else if (is_variable_sized (var)) | |
4792 | { | |
4793 | /* For variable sized types, we need to allocate the | |
4794 | actual storage here. Call alloca and store the | |
4795 | result in the pointer decl that we created elsewhere. */ | |
4796 | if (pass == 0) | |
4797 | continue; | |
4798 | ||
4799 | if (c_kind != OMP_CLAUSE_FIRSTPRIVATE || !is_task_ctx (ctx)) | |
4800 | { | |
4801 | gcall *stmt; | |
4802 | tree tmp, atmp; | |
4803 | ||
4804 | ptr = DECL_VALUE_EXPR (new_var); | |
4805 | gcc_assert (TREE_CODE (ptr) == INDIRECT_REF); | |
4806 | ptr = TREE_OPERAND (ptr, 0); | |
a68ab351 JJ |
4807 | gcc_assert (DECL_P (ptr)); |
4808 | x = TYPE_SIZE_UNIT (TREE_TYPE (new_var)); | |
726a989a RB |
4809 | |
4810 | /* void *tmp = __builtin_alloca */ | |
d9a6bd32 JJ |
4811 | atmp = builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN); |
4812 | stmt = gimple_build_call (atmp, 2, x, | |
4813 | size_int (DECL_ALIGN (var))); | |
b731b390 | 4814 | tmp = create_tmp_var_raw (ptr_type_node); |
726a989a RB |
4815 | gimple_add_tmp_var (tmp); |
4816 | gimple_call_set_lhs (stmt, tmp); | |
4817 | ||
4818 | gimple_seq_add_stmt (ilist, stmt); | |
4819 | ||
db3927fb | 4820 | x = fold_convert_loc (clause_loc, TREE_TYPE (ptr), tmp); |
726a989a | 4821 | gimplify_assign (ptr, x, ilist); |
a68ab351 | 4822 | } |
953ff289 | 4823 | } |
182190f2 | 4824 | else if (is_reference (var) && !is_oacc_parallel (ctx)) |
953ff289 | 4825 | { |
50674e96 DN |
4826 | /* For references that are being privatized for Fortran, |
4827 | allocate new backing storage for the new pointer | |
4828 | variable. This allows us to avoid changing all the | |
4829 | code that expects a pointer to something that expects | |
acf0174b | 4830 | a direct variable. */ |
953ff289 DN |
4831 | if (pass == 0) |
4832 | continue; | |
4833 | ||
4834 | x = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (new_var))); | |
a68ab351 JJ |
4835 | if (c_kind == OMP_CLAUSE_FIRSTPRIVATE && is_task_ctx (ctx)) |
4836 | { | |
4837 | x = build_receiver_ref (var, false, ctx); | |
db3927fb | 4838 | x = build_fold_addr_expr_loc (clause_loc, x); |
a68ab351 JJ |
4839 | } |
4840 | else if (TREE_CONSTANT (x)) | |
953ff289 | 4841 | { |
decaaec8 JJ |
4842 | /* For reduction in SIMD loop, defer adding the |
4843 | initialization of the reference, because if we decide | |
4844 | to use SIMD array for it, the initilization could cause | |
4845 | expansion ICE. */ | |
4846 | if (c_kind == OMP_CLAUSE_REDUCTION && is_simd) | |
4ceffa27 JJ |
4847 | x = NULL_TREE; |
4848 | else | |
4849 | { | |
4ceffa27 | 4850 | x = create_tmp_var_raw (TREE_TYPE (TREE_TYPE (new_var)), |
d9a6bd32 | 4851 | get_name (var)); |
4ceffa27 JJ |
4852 | gimple_add_tmp_var (x); |
4853 | TREE_ADDRESSABLE (x) = 1; | |
4854 | x = build_fold_addr_expr_loc (clause_loc, x); | |
4855 | } | |
953ff289 DN |
4856 | } |
4857 | else | |
4858 | { | |
d9a6bd32 JJ |
4859 | tree atmp |
4860 | = builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN); | |
4861 | tree rtype = TREE_TYPE (TREE_TYPE (new_var)); | |
4862 | tree al = size_int (TYPE_ALIGN (rtype)); | |
4863 | x = build_call_expr_loc (clause_loc, atmp, 2, x, al); | |
953ff289 DN |
4864 | } |
4865 | ||
4ceffa27 JJ |
4866 | if (x) |
4867 | { | |
4868 | x = fold_convert_loc (clause_loc, TREE_TYPE (new_var), x); | |
4869 | gimplify_assign (new_var, x, ilist); | |
4870 | } | |
953ff289 | 4871 | |
70f34814 | 4872 | new_var = build_simple_mem_ref_loc (clause_loc, new_var); |
953ff289 DN |
4873 | } |
4874 | else if (c_kind == OMP_CLAUSE_REDUCTION | |
4875 | && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) | |
4876 | { | |
4877 | if (pass == 0) | |
4878 | continue; | |
4879 | } | |
4880 | else if (pass != 0) | |
4881 | continue; | |
4882 | ||
aaf46ef9 | 4883 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 DN |
4884 | { |
4885 | case OMP_CLAUSE_SHARED: | |
acf0174b JJ |
4886 | /* Ignore shared directives in teams construct. */ |
4887 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_TEAMS) | |
4888 | continue; | |
8ca5b2a2 JJ |
4889 | /* Shared global vars are just accessed directly. */ |
4890 | if (is_global_var (new_var)) | |
4891 | break; | |
d9a6bd32 JJ |
4892 | /* For taskloop firstprivate/lastprivate, represented |
4893 | as firstprivate and shared clause on the task, new_var | |
4894 | is the firstprivate var. */ | |
4895 | if (OMP_CLAUSE_SHARED_FIRSTPRIVATE (c)) | |
4896 | break; | |
953ff289 DN |
4897 | /* Set up the DECL_VALUE_EXPR for shared variables now. This |
4898 | needs to be delayed until after fixup_child_record_type so | |
4899 | that we get the correct type during the dereference. */ | |
7c8f7639 | 4900 | by_ref = use_pointer_for_field (var, ctx); |
953ff289 DN |
4901 | x = build_receiver_ref (var, by_ref, ctx); |
4902 | SET_DECL_VALUE_EXPR (new_var, x); | |
4903 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
4904 | ||
4905 | /* ??? If VAR is not passed by reference, and the variable | |
4906 | hasn't been initialized yet, then we'll get a warning for | |
4907 | the store into the omp_data_s structure. Ideally, we'd be | |
b8698a0f | 4908 | able to notice this and not store anything at all, but |
953ff289 DN |
4909 | we're generating code too early. Suppress the warning. */ |
4910 | if (!by_ref) | |
4911 | TREE_NO_WARNING (var) = 1; | |
4912 | break; | |
4913 | ||
4914 | case OMP_CLAUSE_LASTPRIVATE: | |
4915 | if (OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)) | |
4916 | break; | |
4917 | /* FALLTHRU */ | |
4918 | ||
4919 | case OMP_CLAUSE_PRIVATE: | |
a68ab351 JJ |
4920 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_PRIVATE) |
4921 | x = build_outer_var_ref (var, ctx); | |
4922 | else if (OMP_CLAUSE_PRIVATE_OUTER_REF (c)) | |
4923 | { | |
4924 | if (is_task_ctx (ctx)) | |
4925 | x = build_receiver_ref (var, false, ctx); | |
4926 | else | |
4927 | x = build_outer_var_ref (var, ctx); | |
4928 | } | |
4929 | else | |
4930 | x = NULL; | |
74bf76ed | 4931 | do_private: |
acf0174b | 4932 | tree nx; |
d9a6bd32 JJ |
4933 | nx = lang_hooks.decls.omp_clause_default_ctor |
4934 | (c, unshare_expr (new_var), x); | |
74bf76ed JJ |
4935 | if (is_simd) |
4936 | { | |
4937 | tree y = lang_hooks.decls.omp_clause_dtor (c, new_var); | |
acf0174b | 4938 | if ((TREE_ADDRESSABLE (new_var) || nx || y |
74bf76ed JJ |
4939 | || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE) |
4940 | && lower_rec_simd_input_clauses (new_var, ctx, max_vf, | |
4941 | idx, lane, ivar, lvar)) | |
4942 | { | |
acf0174b | 4943 | if (nx) |
74bf76ed JJ |
4944 | x = lang_hooks.decls.omp_clause_default_ctor |
4945 | (c, unshare_expr (ivar), x); | |
acf0174b | 4946 | if (nx && x) |
74bf76ed JJ |
4947 | gimplify_and_add (x, &llist[0]); |
4948 | if (y) | |
4949 | { | |
4950 | y = lang_hooks.decls.omp_clause_dtor (c, ivar); | |
4951 | if (y) | |
4952 | { | |
4953 | gimple_seq tseq = NULL; | |
4954 | ||
4955 | dtor = y; | |
4956 | gimplify_stmt (&dtor, &tseq); | |
4957 | gimple_seq_add_seq (&llist[1], tseq); | |
4958 | } | |
4959 | } | |
4960 | break; | |
4961 | } | |
4962 | } | |
acf0174b JJ |
4963 | if (nx) |
4964 | gimplify_and_add (nx, ilist); | |
953ff289 DN |
4965 | /* FALLTHRU */ |
4966 | ||
4967 | do_dtor: | |
4968 | x = lang_hooks.decls.omp_clause_dtor (c, new_var); | |
4969 | if (x) | |
4970 | { | |
726a989a RB |
4971 | gimple_seq tseq = NULL; |
4972 | ||
953ff289 | 4973 | dtor = x; |
726a989a | 4974 | gimplify_stmt (&dtor, &tseq); |
355a7673 | 4975 | gimple_seq_add_seq (dlist, tseq); |
953ff289 DN |
4976 | } |
4977 | break; | |
4978 | ||
74bf76ed JJ |
4979 | case OMP_CLAUSE_LINEAR: |
4980 | if (!OMP_CLAUSE_LINEAR_NO_COPYIN (c)) | |
4981 | goto do_firstprivate; | |
4982 | if (OMP_CLAUSE_LINEAR_NO_COPYOUT (c)) | |
4983 | x = NULL; | |
4984 | else | |
4985 | x = build_outer_var_ref (var, ctx); | |
4986 | goto do_private; | |
4987 | ||
953ff289 | 4988 | case OMP_CLAUSE_FIRSTPRIVATE: |
a68ab351 JJ |
4989 | if (is_task_ctx (ctx)) |
4990 | { | |
4991 | if (is_reference (var) || is_variable_sized (var)) | |
4992 | goto do_dtor; | |
4993 | else if (is_global_var (maybe_lookup_decl_in_outer_ctx (var, | |
4994 | ctx)) | |
4995 | || use_pointer_for_field (var, NULL)) | |
4996 | { | |
4997 | x = build_receiver_ref (var, false, ctx); | |
4998 | SET_DECL_VALUE_EXPR (new_var, x); | |
4999 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
5000 | goto do_dtor; | |
5001 | } | |
5002 | } | |
74bf76ed | 5003 | do_firstprivate: |
953ff289 | 5004 | x = build_outer_var_ref (var, ctx); |
74bf76ed JJ |
5005 | if (is_simd) |
5006 | { | |
acf0174b JJ |
5007 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR |
5008 | && gimple_omp_for_combined_into_p (ctx->stmt)) | |
5009 | { | |
da6f124d JJ |
5010 | tree t = OMP_CLAUSE_LINEAR_STEP (c); |
5011 | tree stept = TREE_TYPE (t); | |
5012 | tree ct = find_omp_clause (clauses, | |
5013 | OMP_CLAUSE__LOOPTEMP_); | |
5014 | gcc_assert (ct); | |
5015 | tree l = OMP_CLAUSE_DECL (ct); | |
56ad0e38 JJ |
5016 | tree n1 = fd->loop.n1; |
5017 | tree step = fd->loop.step; | |
5018 | tree itype = TREE_TYPE (l); | |
5019 | if (POINTER_TYPE_P (itype)) | |
5020 | itype = signed_type_for (itype); | |
5021 | l = fold_build2 (MINUS_EXPR, itype, l, n1); | |
5022 | if (TYPE_UNSIGNED (itype) | |
5023 | && fd->loop.cond_code == GT_EXPR) | |
5024 | l = fold_build2 (TRUNC_DIV_EXPR, itype, | |
5025 | fold_build1 (NEGATE_EXPR, itype, l), | |
5026 | fold_build1 (NEGATE_EXPR, | |
5027 | itype, step)); | |
5028 | else | |
5029 | l = fold_build2 (TRUNC_DIV_EXPR, itype, l, step); | |
acf0174b JJ |
5030 | t = fold_build2 (MULT_EXPR, stept, |
5031 | fold_convert (stept, l), t); | |
da6f124d JJ |
5032 | |
5033 | if (OMP_CLAUSE_LINEAR_ARRAY (c)) | |
5034 | { | |
5035 | x = lang_hooks.decls.omp_clause_linear_ctor | |
5036 | (c, new_var, x, t); | |
5037 | gimplify_and_add (x, ilist); | |
5038 | goto do_dtor; | |
5039 | } | |
5040 | ||
acf0174b JJ |
5041 | if (POINTER_TYPE_P (TREE_TYPE (x))) |
5042 | x = fold_build2 (POINTER_PLUS_EXPR, | |
5043 | TREE_TYPE (x), x, t); | |
5044 | else | |
5045 | x = fold_build2 (PLUS_EXPR, TREE_TYPE (x), x, t); | |
5046 | } | |
5047 | ||
74bf76ed JJ |
5048 | if ((OMP_CLAUSE_CODE (c) != OMP_CLAUSE_LINEAR |
5049 | || TREE_ADDRESSABLE (new_var)) | |
5050 | && lower_rec_simd_input_clauses (new_var, ctx, max_vf, | |
5051 | idx, lane, ivar, lvar)) | |
5052 | { | |
5053 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR) | |
5054 | { | |
b731b390 | 5055 | tree iv = create_tmp_var (TREE_TYPE (new_var)); |
74bf76ed JJ |
5056 | x = lang_hooks.decls.omp_clause_copy_ctor (c, iv, x); |
5057 | gimplify_and_add (x, ilist); | |
5058 | gimple_stmt_iterator gsi | |
5059 | = gsi_start_1 (gimple_omp_body_ptr (ctx->stmt)); | |
538dd0b7 | 5060 | gassign *g |
74bf76ed JJ |
5061 | = gimple_build_assign (unshare_expr (lvar), iv); |
5062 | gsi_insert_before_without_update (&gsi, g, | |
5063 | GSI_SAME_STMT); | |
da6f124d | 5064 | tree t = OMP_CLAUSE_LINEAR_STEP (c); |
74bf76ed JJ |
5065 | enum tree_code code = PLUS_EXPR; |
5066 | if (POINTER_TYPE_P (TREE_TYPE (new_var))) | |
5067 | code = POINTER_PLUS_EXPR; | |
0d0e4a03 | 5068 | g = gimple_build_assign (iv, code, iv, t); |
74bf76ed JJ |
5069 | gsi_insert_before_without_update (&gsi, g, |
5070 | GSI_SAME_STMT); | |
5071 | break; | |
5072 | } | |
5073 | x = lang_hooks.decls.omp_clause_copy_ctor | |
5074 | (c, unshare_expr (ivar), x); | |
5075 | gimplify_and_add (x, &llist[0]); | |
5076 | x = lang_hooks.decls.omp_clause_dtor (c, ivar); | |
5077 | if (x) | |
5078 | { | |
5079 | gimple_seq tseq = NULL; | |
5080 | ||
5081 | dtor = x; | |
5082 | gimplify_stmt (&dtor, &tseq); | |
5083 | gimple_seq_add_seq (&llist[1], tseq); | |
5084 | } | |
5085 | break; | |
5086 | } | |
5087 | } | |
d9a6bd32 JJ |
5088 | x = lang_hooks.decls.omp_clause_copy_ctor |
5089 | (c, unshare_expr (new_var), x); | |
953ff289 DN |
5090 | gimplify_and_add (x, ilist); |
5091 | goto do_dtor; | |
953ff289 | 5092 | |
acf0174b | 5093 | case OMP_CLAUSE__LOOPTEMP_: |
d9a6bd32 | 5094 | gcc_assert (is_taskreg_ctx (ctx)); |
acf0174b JJ |
5095 | x = build_outer_var_ref (var, ctx); |
5096 | x = build2 (MODIFY_EXPR, TREE_TYPE (new_var), new_var, x); | |
5097 | gimplify_and_add (x, ilist); | |
5098 | break; | |
5099 | ||
953ff289 | 5100 | case OMP_CLAUSE_COPYIN: |
7c8f7639 | 5101 | by_ref = use_pointer_for_field (var, NULL); |
953ff289 DN |
5102 | x = build_receiver_ref (var, by_ref, ctx); |
5103 | x = lang_hooks.decls.omp_clause_assign_op (c, new_var, x); | |
5104 | append_to_statement_list (x, ©in_seq); | |
5105 | copyin_by_ref |= by_ref; | |
5106 | break; | |
5107 | ||
5108 | case OMP_CLAUSE_REDUCTION: | |
e5014671 NS |
5109 | /* OpenACC reductions are initialized using the |
5110 | GOACC_REDUCTION internal function. */ | |
5111 | if (is_gimple_omp_oacc (ctx->stmt)) | |
5112 | break; | |
953ff289 DN |
5113 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) |
5114 | { | |
a68ab351 | 5115 | tree placeholder = OMP_CLAUSE_REDUCTION_PLACEHOLDER (c); |
355fe088 | 5116 | gimple *tseq; |
a68ab351 JJ |
5117 | x = build_outer_var_ref (var, ctx); |
5118 | ||
acf0174b JJ |
5119 | if (is_reference (var) |
5120 | && !useless_type_conversion_p (TREE_TYPE (placeholder), | |
5121 | TREE_TYPE (x))) | |
db3927fb | 5122 | x = build_fold_addr_expr_loc (clause_loc, x); |
a68ab351 JJ |
5123 | SET_DECL_VALUE_EXPR (placeholder, x); |
5124 | DECL_HAS_VALUE_EXPR_P (placeholder) = 1; | |
acf0174b JJ |
5125 | tree new_vard = new_var; |
5126 | if (is_reference (var)) | |
5127 | { | |
5128 | gcc_assert (TREE_CODE (new_var) == MEM_REF); | |
5129 | new_vard = TREE_OPERAND (new_var, 0); | |
5130 | gcc_assert (DECL_P (new_vard)); | |
5131 | } | |
74bf76ed JJ |
5132 | if (is_simd |
5133 | && lower_rec_simd_input_clauses (new_var, ctx, max_vf, | |
5134 | idx, lane, ivar, lvar)) | |
5135 | { | |
acf0174b JJ |
5136 | if (new_vard == new_var) |
5137 | { | |
5138 | gcc_assert (DECL_VALUE_EXPR (new_var) == lvar); | |
5139 | SET_DECL_VALUE_EXPR (new_var, ivar); | |
5140 | } | |
5141 | else | |
5142 | { | |
5143 | SET_DECL_VALUE_EXPR (new_vard, | |
5144 | build_fold_addr_expr (ivar)); | |
5145 | DECL_HAS_VALUE_EXPR_P (new_vard) = 1; | |
5146 | } | |
5147 | x = lang_hooks.decls.omp_clause_default_ctor | |
5148 | (c, unshare_expr (ivar), | |
5149 | build_outer_var_ref (var, ctx)); | |
5150 | if (x) | |
5151 | gimplify_and_add (x, &llist[0]); | |
5152 | if (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)) | |
5153 | { | |
5154 | tseq = OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c); | |
5155 | lower_omp (&tseq, ctx); | |
5156 | gimple_seq_add_seq (&llist[0], tseq); | |
5157 | } | |
5158 | OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = NULL; | |
5159 | tseq = OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c); | |
5160 | lower_omp (&tseq, ctx); | |
5161 | gimple_seq_add_seq (&llist[1], tseq); | |
5162 | OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = NULL; | |
5163 | DECL_HAS_VALUE_EXPR_P (placeholder) = 0; | |
5164 | if (new_vard == new_var) | |
5165 | SET_DECL_VALUE_EXPR (new_var, lvar); | |
5166 | else | |
5167 | SET_DECL_VALUE_EXPR (new_vard, | |
5168 | build_fold_addr_expr (lvar)); | |
5169 | x = lang_hooks.decls.omp_clause_dtor (c, ivar); | |
5170 | if (x) | |
5171 | { | |
5172 | tseq = NULL; | |
5173 | dtor = x; | |
5174 | gimplify_stmt (&dtor, &tseq); | |
5175 | gimple_seq_add_seq (&llist[1], tseq); | |
5176 | } | |
5177 | break; | |
5178 | } | |
4ceffa27 JJ |
5179 | /* If this is a reference to constant size reduction var |
5180 | with placeholder, we haven't emitted the initializer | |
5181 | for it because it is undesirable if SIMD arrays are used. | |
5182 | But if they aren't used, we need to emit the deferred | |
5183 | initialization now. */ | |
5184 | else if (is_reference (var) && is_simd) | |
decaaec8 | 5185 | handle_simd_reference (clause_loc, new_vard, ilist); |
acf0174b | 5186 | x = lang_hooks.decls.omp_clause_default_ctor |
92d28cbb JJ |
5187 | (c, unshare_expr (new_var), |
5188 | build_outer_var_ref (var, ctx)); | |
acf0174b JJ |
5189 | if (x) |
5190 | gimplify_and_add (x, ilist); | |
5191 | if (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)) | |
5192 | { | |
5193 | tseq = OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c); | |
5194 | lower_omp (&tseq, ctx); | |
5195 | gimple_seq_add_seq (ilist, tseq); | |
5196 | } | |
5197 | OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = NULL; | |
5198 | if (is_simd) | |
5199 | { | |
5200 | tseq = OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c); | |
5201 | lower_omp (&tseq, ctx); | |
5202 | gimple_seq_add_seq (dlist, tseq); | |
5203 | OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = NULL; | |
5204 | } | |
5205 | DECL_HAS_VALUE_EXPR_P (placeholder) = 0; | |
5206 | goto do_dtor; | |
5207 | } | |
5208 | else | |
5209 | { | |
5210 | x = omp_reduction_init (c, TREE_TYPE (new_var)); | |
5211 | gcc_assert (TREE_CODE (TREE_TYPE (new_var)) != ARRAY_TYPE); | |
e9792e1d JJ |
5212 | enum tree_code code = OMP_CLAUSE_REDUCTION_CODE (c); |
5213 | ||
5214 | /* reduction(-:var) sums up the partial results, so it | |
5215 | acts identically to reduction(+:var). */ | |
5216 | if (code == MINUS_EXPR) | |
5217 | code = PLUS_EXPR; | |
5218 | ||
decaaec8 JJ |
5219 | tree new_vard = new_var; |
5220 | if (is_simd && is_reference (var)) | |
5221 | { | |
5222 | gcc_assert (TREE_CODE (new_var) == MEM_REF); | |
5223 | new_vard = TREE_OPERAND (new_var, 0); | |
5224 | gcc_assert (DECL_P (new_vard)); | |
5225 | } | |
acf0174b JJ |
5226 | if (is_simd |
5227 | && lower_rec_simd_input_clauses (new_var, ctx, max_vf, | |
5228 | idx, lane, ivar, lvar)) | |
5229 | { | |
acf0174b JJ |
5230 | tree ref = build_outer_var_ref (var, ctx); |
5231 | ||
5232 | gimplify_assign (unshare_expr (ivar), x, &llist[0]); | |
5233 | ||
acf0174b | 5234 | x = build2 (code, TREE_TYPE (ref), ref, ivar); |
74bf76ed JJ |
5235 | ref = build_outer_var_ref (var, ctx); |
5236 | gimplify_assign (ref, x, &llist[1]); | |
decaaec8 JJ |
5237 | |
5238 | if (new_vard != new_var) | |
5239 | { | |
5240 | SET_DECL_VALUE_EXPR (new_vard, | |
5241 | build_fold_addr_expr (lvar)); | |
5242 | DECL_HAS_VALUE_EXPR_P (new_vard) = 1; | |
5243 | } | |
74bf76ed JJ |
5244 | } |
5245 | else | |
5246 | { | |
decaaec8 JJ |
5247 | if (is_reference (var) && is_simd) |
5248 | handle_simd_reference (clause_loc, new_vard, ilist); | |
74bf76ed JJ |
5249 | gimplify_assign (new_var, x, ilist); |
5250 | if (is_simd) | |
e9792e1d JJ |
5251 | { |
5252 | tree ref = build_outer_var_ref (var, ctx); | |
5253 | ||
5254 | x = build2 (code, TREE_TYPE (ref), ref, new_var); | |
5255 | ref = build_outer_var_ref (var, ctx); | |
5256 | gimplify_assign (ref, x, dlist); | |
5257 | } | |
74bf76ed | 5258 | } |
953ff289 DN |
5259 | } |
5260 | break; | |
5261 | ||
5262 | default: | |
5263 | gcc_unreachable (); | |
5264 | } | |
5265 | } | |
5266 | } | |
5267 | ||
74bf76ed JJ |
5268 | if (lane) |
5269 | { | |
5270 | tree uid = create_tmp_var (ptr_type_node, "simduid"); | |
8928eff3 JJ |
5271 | /* Don't want uninit warnings on simduid, it is always uninitialized, |
5272 | but we use it not for the value, but for the DECL_UID only. */ | |
5273 | TREE_NO_WARNING (uid) = 1; | |
355fe088 | 5274 | gimple *g |
74bf76ed JJ |
5275 | = gimple_build_call_internal (IFN_GOMP_SIMD_LANE, 1, uid); |
5276 | gimple_call_set_lhs (g, lane); | |
5277 | gimple_stmt_iterator gsi = gsi_start_1 (gimple_omp_body_ptr (ctx->stmt)); | |
5278 | gsi_insert_before_without_update (&gsi, g, GSI_SAME_STMT); | |
5279 | c = build_omp_clause (UNKNOWN_LOCATION, OMP_CLAUSE__SIMDUID_); | |
5280 | OMP_CLAUSE__SIMDUID__DECL (c) = uid; | |
5281 | OMP_CLAUSE_CHAIN (c) = gimple_omp_for_clauses (ctx->stmt); | |
5282 | gimple_omp_for_set_clauses (ctx->stmt, c); | |
0d0e4a03 JJ |
5283 | g = gimple_build_assign (lane, INTEGER_CST, |
5284 | build_int_cst (unsigned_type_node, 0)); | |
74bf76ed JJ |
5285 | gimple_seq_add_stmt (ilist, g); |
5286 | for (int i = 0; i < 2; i++) | |
5287 | if (llist[i]) | |
5288 | { | |
b731b390 | 5289 | tree vf = create_tmp_var (unsigned_type_node); |
74bf76ed JJ |
5290 | g = gimple_build_call_internal (IFN_GOMP_SIMD_VF, 1, uid); |
5291 | gimple_call_set_lhs (g, vf); | |
5292 | gimple_seq *seq = i == 0 ? ilist : dlist; | |
5293 | gimple_seq_add_stmt (seq, g); | |
5294 | tree t = build_int_cst (unsigned_type_node, 0); | |
0d0e4a03 | 5295 | g = gimple_build_assign (idx, INTEGER_CST, t); |
74bf76ed JJ |
5296 | gimple_seq_add_stmt (seq, g); |
5297 | tree body = create_artificial_label (UNKNOWN_LOCATION); | |
5298 | tree header = create_artificial_label (UNKNOWN_LOCATION); | |
5299 | tree end = create_artificial_label (UNKNOWN_LOCATION); | |
5300 | gimple_seq_add_stmt (seq, gimple_build_goto (header)); | |
5301 | gimple_seq_add_stmt (seq, gimple_build_label (body)); | |
5302 | gimple_seq_add_seq (seq, llist[i]); | |
5303 | t = build_int_cst (unsigned_type_node, 1); | |
0d0e4a03 | 5304 | g = gimple_build_assign (idx, PLUS_EXPR, idx, t); |
74bf76ed JJ |
5305 | gimple_seq_add_stmt (seq, g); |
5306 | gimple_seq_add_stmt (seq, gimple_build_label (header)); | |
5307 | g = gimple_build_cond (LT_EXPR, idx, vf, body, end); | |
5308 | gimple_seq_add_stmt (seq, g); | |
5309 | gimple_seq_add_stmt (seq, gimple_build_label (end)); | |
5310 | } | |
5311 | } | |
5312 | ||
953ff289 DN |
5313 | /* The copyin sequence is not to be executed by the main thread, since |
5314 | that would result in self-copies. Perhaps not visible to scalars, | |
5315 | but it certainly is to C++ operator=. */ | |
5316 | if (copyin_seq) | |
5317 | { | |
e79983f4 MM |
5318 | x = build_call_expr (builtin_decl_explicit (BUILT_IN_OMP_GET_THREAD_NUM), |
5319 | 0); | |
953ff289 DN |
5320 | x = build2 (NE_EXPR, boolean_type_node, x, |
5321 | build_int_cst (TREE_TYPE (x), 0)); | |
5322 | x = build3 (COND_EXPR, void_type_node, x, copyin_seq, NULL); | |
5323 | gimplify_and_add (x, ilist); | |
5324 | } | |
5325 | ||
5326 | /* If any copyin variable is passed by reference, we must ensure the | |
5327 | master thread doesn't modify it before it is copied over in all | |
8ca5b2a2 JJ |
5328 | threads. Similarly for variables in both firstprivate and |
5329 | lastprivate clauses we need to ensure the lastprivate copying | |
acf0174b JJ |
5330 | happens after firstprivate copying in all threads. And similarly |
5331 | for UDRs if initializer expression refers to omp_orig. */ | |
5332 | if (copyin_by_ref || lastprivate_firstprivate || reduction_omp_orig_ref) | |
74bf76ed JJ |
5333 | { |
5334 | /* Don't add any barrier for #pragma omp simd or | |
5335 | #pragma omp distribute. */ | |
5336 | if (gimple_code (ctx->stmt) != GIMPLE_OMP_FOR | |
e2110f8f | 5337 | || gimple_omp_for_kind (ctx->stmt) == GF_OMP_FOR_KIND_FOR) |
acf0174b | 5338 | gimple_seq_add_stmt (ilist, build_omp_barrier (NULL_TREE)); |
74bf76ed JJ |
5339 | } |
5340 | ||
5341 | /* If max_vf is non-zero, then we can use only a vectorization factor | |
5342 | up to the max_vf we chose. So stick it into the safelen clause. */ | |
5343 | if (max_vf) | |
5344 | { | |
5345 | tree c = find_omp_clause (gimple_omp_for_clauses (ctx->stmt), | |
5346 | OMP_CLAUSE_SAFELEN); | |
5347 | if (c == NULL_TREE | |
b46ebd6c JJ |
5348 | || (TREE_CODE (OMP_CLAUSE_SAFELEN_EXPR (c)) == INTEGER_CST |
5349 | && compare_tree_int (OMP_CLAUSE_SAFELEN_EXPR (c), | |
5350 | max_vf) == 1)) | |
74bf76ed JJ |
5351 | { |
5352 | c = build_omp_clause (UNKNOWN_LOCATION, OMP_CLAUSE_SAFELEN); | |
5353 | OMP_CLAUSE_SAFELEN_EXPR (c) = build_int_cst (integer_type_node, | |
5354 | max_vf); | |
5355 | OMP_CLAUSE_CHAIN (c) = gimple_omp_for_clauses (ctx->stmt); | |
5356 | gimple_omp_for_set_clauses (ctx->stmt, c); | |
5357 | } | |
5358 | } | |
953ff289 DN |
5359 | } |
5360 | ||
50674e96 | 5361 | |
953ff289 DN |
5362 | /* Generate code to implement the LASTPRIVATE clauses. This is used for |
5363 | both parallel and workshare constructs. PREDICATE may be NULL if it's | |
5364 | always true. */ | |
5365 | ||
5366 | static void | |
726a989a | 5367 | lower_lastprivate_clauses (tree clauses, tree predicate, gimple_seq *stmt_list, |
acf0174b | 5368 | omp_context *ctx) |
953ff289 | 5369 | { |
74bf76ed | 5370 | tree x, c, label = NULL, orig_clauses = clauses; |
a68ab351 | 5371 | bool par_clauses = false; |
74bf76ed | 5372 | tree simduid = NULL, lastlane = NULL; |
953ff289 | 5373 | |
74bf76ed JJ |
5374 | /* Early exit if there are no lastprivate or linear clauses. */ |
5375 | for (; clauses ; clauses = OMP_CLAUSE_CHAIN (clauses)) | |
5376 | if (OMP_CLAUSE_CODE (clauses) == OMP_CLAUSE_LASTPRIVATE | |
5377 | || (OMP_CLAUSE_CODE (clauses) == OMP_CLAUSE_LINEAR | |
5378 | && !OMP_CLAUSE_LINEAR_NO_COPYOUT (clauses))) | |
5379 | break; | |
953ff289 DN |
5380 | if (clauses == NULL) |
5381 | { | |
5382 | /* If this was a workshare clause, see if it had been combined | |
5383 | with its parallel. In that case, look for the clauses on the | |
5384 | parallel statement itself. */ | |
5385 | if (is_parallel_ctx (ctx)) | |
5386 | return; | |
5387 | ||
5388 | ctx = ctx->outer; | |
5389 | if (ctx == NULL || !is_parallel_ctx (ctx)) | |
5390 | return; | |
5391 | ||
726a989a | 5392 | clauses = find_omp_clause (gimple_omp_parallel_clauses (ctx->stmt), |
953ff289 DN |
5393 | OMP_CLAUSE_LASTPRIVATE); |
5394 | if (clauses == NULL) | |
5395 | return; | |
a68ab351 | 5396 | par_clauses = true; |
953ff289 DN |
5397 | } |
5398 | ||
726a989a RB |
5399 | if (predicate) |
5400 | { | |
538dd0b7 | 5401 | gcond *stmt; |
726a989a RB |
5402 | tree label_true, arm1, arm2; |
5403 | ||
c2255bc4 AH |
5404 | label = create_artificial_label (UNKNOWN_LOCATION); |
5405 | label_true = create_artificial_label (UNKNOWN_LOCATION); | |
726a989a RB |
5406 | arm1 = TREE_OPERAND (predicate, 0); |
5407 | arm2 = TREE_OPERAND (predicate, 1); | |
5408 | gimplify_expr (&arm1, stmt_list, NULL, is_gimple_val, fb_rvalue); | |
5409 | gimplify_expr (&arm2, stmt_list, NULL, is_gimple_val, fb_rvalue); | |
5410 | stmt = gimple_build_cond (TREE_CODE (predicate), arm1, arm2, | |
5411 | label_true, label); | |
5412 | gimple_seq_add_stmt (stmt_list, stmt); | |
5413 | gimple_seq_add_stmt (stmt_list, gimple_build_label (label_true)); | |
5414 | } | |
953ff289 | 5415 | |
74bf76ed | 5416 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_FOR |
0aadce73 | 5417 | && gimple_omp_for_kind (ctx->stmt) & GF_OMP_FOR_SIMD) |
74bf76ed JJ |
5418 | { |
5419 | simduid = find_omp_clause (orig_clauses, OMP_CLAUSE__SIMDUID_); | |
5420 | if (simduid) | |
5421 | simduid = OMP_CLAUSE__SIMDUID__DECL (simduid); | |
5422 | } | |
5423 | ||
a68ab351 | 5424 | for (c = clauses; c ;) |
953ff289 DN |
5425 | { |
5426 | tree var, new_var; | |
db3927fb | 5427 | location_t clause_loc = OMP_CLAUSE_LOCATION (c); |
953ff289 | 5428 | |
74bf76ed JJ |
5429 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE |
5430 | || (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR | |
5431 | && !OMP_CLAUSE_LINEAR_NO_COPYOUT (c))) | |
a68ab351 JJ |
5432 | { |
5433 | var = OMP_CLAUSE_DECL (c); | |
d9a6bd32 JJ |
5434 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE |
5435 | && OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c) | |
5436 | && is_taskloop_ctx (ctx)) | |
5437 | { | |
5438 | gcc_checking_assert (ctx->outer && is_task_ctx (ctx->outer)); | |
5439 | new_var = lookup_decl (var, ctx->outer); | |
5440 | } | |
5441 | else | |
5442 | new_var = lookup_decl (var, ctx); | |
953ff289 | 5443 | |
74bf76ed JJ |
5444 | if (simduid && DECL_HAS_VALUE_EXPR_P (new_var)) |
5445 | { | |
5446 | tree val = DECL_VALUE_EXPR (new_var); | |
5447 | if (TREE_CODE (val) == ARRAY_REF | |
5448 | && VAR_P (TREE_OPERAND (val, 0)) | |
5449 | && lookup_attribute ("omp simd array", | |
5450 | DECL_ATTRIBUTES (TREE_OPERAND (val, | |
5451 | 0)))) | |
5452 | { | |
5453 | if (lastlane == NULL) | |
5454 | { | |
b731b390 | 5455 | lastlane = create_tmp_var (unsigned_type_node); |
538dd0b7 | 5456 | gcall *g |
74bf76ed JJ |
5457 | = gimple_build_call_internal (IFN_GOMP_SIMD_LAST_LANE, |
5458 | 2, simduid, | |
5459 | TREE_OPERAND (val, 1)); | |
5460 | gimple_call_set_lhs (g, lastlane); | |
5461 | gimple_seq_add_stmt (stmt_list, g); | |
5462 | } | |
5463 | new_var = build4 (ARRAY_REF, TREE_TYPE (val), | |
5464 | TREE_OPERAND (val, 0), lastlane, | |
5465 | NULL_TREE, NULL_TREE); | |
5466 | } | |
5467 | } | |
5468 | ||
5469 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE | |
5470 | && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)) | |
726a989a | 5471 | { |
355a7673 | 5472 | lower_omp (&OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c), ctx); |
726a989a RB |
5473 | gimple_seq_add_seq (stmt_list, |
5474 | OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)); | |
74bf76ed | 5475 | OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) = NULL; |
726a989a | 5476 | } |
f7468577 JJ |
5477 | else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR |
5478 | && OMP_CLAUSE_LINEAR_GIMPLE_SEQ (c)) | |
5479 | { | |
5480 | lower_omp (&OMP_CLAUSE_LINEAR_GIMPLE_SEQ (c), ctx); | |
5481 | gimple_seq_add_seq (stmt_list, | |
5482 | OMP_CLAUSE_LINEAR_GIMPLE_SEQ (c)); | |
5483 | OMP_CLAUSE_LINEAR_GIMPLE_SEQ (c) = NULL; | |
5484 | } | |
953ff289 | 5485 | |
d9a6bd32 JJ |
5486 | x = NULL_TREE; |
5487 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE | |
5488 | && OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV (c)) | |
5489 | { | |
5490 | gcc_checking_assert (is_taskloop_ctx (ctx)); | |
5491 | tree ovar = maybe_lookup_decl_in_outer_ctx (var, | |
5492 | ctx->outer->outer); | |
5493 | if (is_global_var (ovar)) | |
5494 | x = ovar; | |
5495 | } | |
5496 | if (!x) | |
5497 | x = build_outer_var_ref (var, ctx, true); | |
a68ab351 | 5498 | if (is_reference (var)) |
70f34814 | 5499 | new_var = build_simple_mem_ref_loc (clause_loc, new_var); |
a68ab351 | 5500 | x = lang_hooks.decls.omp_clause_assign_op (c, x, new_var); |
726a989a | 5501 | gimplify_and_add (x, stmt_list); |
a68ab351 JJ |
5502 | } |
5503 | c = OMP_CLAUSE_CHAIN (c); | |
5504 | if (c == NULL && !par_clauses) | |
5505 | { | |
5506 | /* If this was a workshare clause, see if it had been combined | |
5507 | with its parallel. In that case, continue looking for the | |
5508 | clauses also on the parallel statement itself. */ | |
5509 | if (is_parallel_ctx (ctx)) | |
5510 | break; | |
5511 | ||
5512 | ctx = ctx->outer; | |
5513 | if (ctx == NULL || !is_parallel_ctx (ctx)) | |
5514 | break; | |
5515 | ||
726a989a | 5516 | c = find_omp_clause (gimple_omp_parallel_clauses (ctx->stmt), |
a68ab351 JJ |
5517 | OMP_CLAUSE_LASTPRIVATE); |
5518 | par_clauses = true; | |
5519 | } | |
953ff289 DN |
5520 | } |
5521 | ||
726a989a RB |
5522 | if (label) |
5523 | gimple_seq_add_stmt (stmt_list, gimple_build_label (label)); | |
953ff289 DN |
5524 | } |
5525 | ||
e5014671 NS |
5526 | /* Lower the OpenACC reductions of CLAUSES for compute axis LEVEL |
5527 | (which might be a placeholder). INNER is true if this is an inner | |
5528 | axis of a multi-axis loop. FORK and JOIN are (optional) fork and | |
5529 | join markers. Generate the before-loop forking sequence in | |
5530 | FORK_SEQ and the after-loop joining sequence to JOIN_SEQ. The | |
5531 | general form of these sequences is | |
5532 | ||
5533 | GOACC_REDUCTION_SETUP | |
5534 | GOACC_FORK | |
5535 | GOACC_REDUCTION_INIT | |
5536 | ... | |
5537 | GOACC_REDUCTION_FINI | |
5538 | GOACC_JOIN | |
5539 | GOACC_REDUCTION_TEARDOWN. */ | |
5540 | ||
41dbbb37 | 5541 | static void |
e5014671 NS |
5542 | lower_oacc_reductions (location_t loc, tree clauses, tree level, bool inner, |
5543 | gcall *fork, gcall *join, gimple_seq *fork_seq, | |
5544 | gimple_seq *join_seq, omp_context *ctx) | |
41dbbb37 | 5545 | { |
e5014671 NS |
5546 | gimple_seq before_fork = NULL; |
5547 | gimple_seq after_fork = NULL; | |
5548 | gimple_seq before_join = NULL; | |
5549 | gimple_seq after_join = NULL; | |
5550 | tree init_code = NULL_TREE, fini_code = NULL_TREE, | |
5551 | setup_code = NULL_TREE, teardown_code = NULL_TREE; | |
5552 | unsigned offset = 0; | |
5553 | ||
5554 | for (tree c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
5555 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION) | |
5556 | { | |
5557 | tree orig = OMP_CLAUSE_DECL (c); | |
5558 | tree var = maybe_lookup_decl (orig, ctx); | |
5559 | tree ref_to_res = NULL_TREE; | |
5560 | tree incoming, outgoing; | |
5561 | ||
5562 | enum tree_code rcode = OMP_CLAUSE_REDUCTION_CODE (c); | |
5563 | if (rcode == MINUS_EXPR) | |
5564 | rcode = PLUS_EXPR; | |
5565 | else if (rcode == TRUTH_ANDIF_EXPR) | |
5566 | rcode = BIT_AND_EXPR; | |
5567 | else if (rcode == TRUTH_ORIF_EXPR) | |
5568 | rcode = BIT_IOR_EXPR; | |
5569 | tree op = build_int_cst (unsigned_type_node, rcode); | |
5570 | ||
5571 | if (!var) | |
5572 | var = orig; | |
5573 | gcc_assert (!is_reference (var)); | |
5574 | ||
5575 | incoming = outgoing = var; | |
5576 | ||
5577 | if (!inner) | |
5578 | { | |
5579 | /* See if an outer construct also reduces this variable. */ | |
5580 | omp_context *outer = ctx; | |
41dbbb37 | 5581 | |
e5014671 NS |
5582 | while (omp_context *probe = outer->outer) |
5583 | { | |
5584 | enum gimple_code type = gimple_code (probe->stmt); | |
5585 | tree cls; | |
41dbbb37 | 5586 | |
e5014671 NS |
5587 | switch (type) |
5588 | { | |
5589 | case GIMPLE_OMP_FOR: | |
5590 | cls = gimple_omp_for_clauses (probe->stmt); | |
5591 | break; | |
41dbbb37 | 5592 | |
e5014671 NS |
5593 | case GIMPLE_OMP_TARGET: |
5594 | if (gimple_omp_target_kind (probe->stmt) | |
5595 | != GF_OMP_TARGET_KIND_OACC_PARALLEL) | |
5596 | goto do_lookup; | |
41dbbb37 | 5597 | |
e5014671 NS |
5598 | cls = gimple_omp_target_clauses (probe->stmt); |
5599 | break; | |
41dbbb37 | 5600 | |
e5014671 NS |
5601 | default: |
5602 | goto do_lookup; | |
5603 | } | |
5604 | ||
5605 | outer = probe; | |
5606 | for (; cls; cls = OMP_CLAUSE_CHAIN (cls)) | |
5607 | if (OMP_CLAUSE_CODE (cls) == OMP_CLAUSE_REDUCTION | |
5608 | && orig == OMP_CLAUSE_DECL (cls)) | |
5609 | goto has_outer_reduction; | |
5610 | } | |
41dbbb37 | 5611 | |
e5014671 NS |
5612 | do_lookup: |
5613 | /* This is the outermost construct with this reduction, | |
5614 | see if there's a mapping for it. */ | |
5615 | if (gimple_code (outer->stmt) == GIMPLE_OMP_TARGET | |
5616 | && maybe_lookup_field (orig, outer)) | |
5617 | { | |
5618 | ref_to_res = build_receiver_ref (orig, false, outer); | |
5619 | if (is_reference (orig)) | |
5620 | ref_to_res = build_simple_mem_ref (ref_to_res); | |
41dbbb37 | 5621 | |
e5014671 NS |
5622 | outgoing = var; |
5623 | incoming = omp_reduction_init_op (loc, rcode, TREE_TYPE (var)); | |
5624 | } | |
5625 | else | |
5626 | incoming = outgoing = orig; | |
5627 | ||
5628 | has_outer_reduction:; | |
5629 | } | |
41dbbb37 | 5630 | |
e5014671 NS |
5631 | if (!ref_to_res) |
5632 | ref_to_res = integer_zero_node; | |
41dbbb37 | 5633 | |
e5014671 NS |
5634 | /* Determine position in reduction buffer, which may be used |
5635 | by target. */ | |
5636 | enum machine_mode mode = TYPE_MODE (TREE_TYPE (var)); | |
5637 | unsigned align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT; | |
5638 | offset = (offset + align - 1) & ~(align - 1); | |
5639 | tree off = build_int_cst (sizetype, offset); | |
5640 | offset += GET_MODE_SIZE (mode); | |
41dbbb37 | 5641 | |
e5014671 NS |
5642 | if (!init_code) |
5643 | { | |
5644 | init_code = build_int_cst (integer_type_node, | |
5645 | IFN_GOACC_REDUCTION_INIT); | |
5646 | fini_code = build_int_cst (integer_type_node, | |
5647 | IFN_GOACC_REDUCTION_FINI); | |
5648 | setup_code = build_int_cst (integer_type_node, | |
5649 | IFN_GOACC_REDUCTION_SETUP); | |
5650 | teardown_code = build_int_cst (integer_type_node, | |
5651 | IFN_GOACC_REDUCTION_TEARDOWN); | |
5652 | } | |
5653 | ||
5654 | tree setup_call | |
5655 | = build_call_expr_internal_loc (loc, IFN_GOACC_REDUCTION, | |
5656 | TREE_TYPE (var), 6, setup_code, | |
5657 | unshare_expr (ref_to_res), | |
5658 | incoming, level, op, off); | |
5659 | tree init_call | |
5660 | = build_call_expr_internal_loc (loc, IFN_GOACC_REDUCTION, | |
5661 | TREE_TYPE (var), 6, init_code, | |
5662 | unshare_expr (ref_to_res), | |
5663 | var, level, op, off); | |
5664 | tree fini_call | |
5665 | = build_call_expr_internal_loc (loc, IFN_GOACC_REDUCTION, | |
5666 | TREE_TYPE (var), 6, fini_code, | |
5667 | unshare_expr (ref_to_res), | |
5668 | var, level, op, off); | |
5669 | tree teardown_call | |
5670 | = build_call_expr_internal_loc (loc, IFN_GOACC_REDUCTION, | |
5671 | TREE_TYPE (var), 6, teardown_code, | |
5672 | ref_to_res, var, level, op, off); | |
5673 | ||
5674 | gimplify_assign (var, setup_call, &before_fork); | |
5675 | gimplify_assign (var, init_call, &after_fork); | |
5676 | gimplify_assign (var, fini_call, &before_join); | |
5677 | gimplify_assign (outgoing, teardown_call, &after_join); | |
5678 | } | |
5679 | ||
5680 | /* Now stitch things together. */ | |
5681 | gimple_seq_add_seq (fork_seq, before_fork); | |
5682 | if (fork) | |
5683 | gimple_seq_add_stmt (fork_seq, fork); | |
5684 | gimple_seq_add_seq (fork_seq, after_fork); | |
5685 | ||
5686 | gimple_seq_add_seq (join_seq, before_join); | |
5687 | if (join) | |
5688 | gimple_seq_add_stmt (join_seq, join); | |
5689 | gimple_seq_add_seq (join_seq, after_join); | |
41dbbb37 | 5690 | } |
50674e96 | 5691 | |
953ff289 DN |
5692 | /* Generate code to implement the REDUCTION clauses. */ |
5693 | ||
5694 | static void | |
726a989a | 5695 | lower_reduction_clauses (tree clauses, gimple_seq *stmt_seqp, omp_context *ctx) |
953ff289 | 5696 | { |
726a989a | 5697 | gimple_seq sub_seq = NULL; |
355fe088 | 5698 | gimple *stmt; |
374d0225 | 5699 | tree x, c; |
953ff289 DN |
5700 | int count = 0; |
5701 | ||
e5014671 NS |
5702 | /* OpenACC loop reductions are handled elsewhere. */ |
5703 | if (is_gimple_omp_oacc (ctx->stmt)) | |
5704 | return; | |
5705 | ||
74bf76ed JJ |
5706 | /* SIMD reductions are handled in lower_rec_input_clauses. */ |
5707 | if (gimple_code (ctx->stmt) == GIMPLE_OMP_FOR | |
0aadce73 | 5708 | && gimple_omp_for_kind (ctx->stmt) & GF_OMP_FOR_SIMD) |
74bf76ed JJ |
5709 | return; |
5710 | ||
953ff289 DN |
5711 | /* First see if there is exactly one reduction clause. Use OMP_ATOMIC |
5712 | update in that case, otherwise use a lock. */ | |
5713 | for (c = clauses; c && count < 2; c = OMP_CLAUSE_CHAIN (c)) | |
aaf46ef9 | 5714 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION) |
953ff289 | 5715 | { |
d9a6bd32 JJ |
5716 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) |
5717 | || TREE_CODE (OMP_CLAUSE_DECL (c)) == MEM_REF) | |
953ff289 | 5718 | { |
acf0174b | 5719 | /* Never use OMP_ATOMIC for array reductions or UDRs. */ |
953ff289 DN |
5720 | count = -1; |
5721 | break; | |
5722 | } | |
5723 | count++; | |
5724 | } | |
5725 | ||
5726 | if (count == 0) | |
5727 | return; | |
5728 | ||
5729 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
5730 | { | |
d9a6bd32 | 5731 | tree var, ref, new_var, orig_var; |
953ff289 | 5732 | enum tree_code code; |
db3927fb | 5733 | location_t clause_loc = OMP_CLAUSE_LOCATION (c); |
953ff289 | 5734 | |
aaf46ef9 | 5735 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_REDUCTION) |
953ff289 DN |
5736 | continue; |
5737 | ||
d9a6bd32 JJ |
5738 | orig_var = var = OMP_CLAUSE_DECL (c); |
5739 | if (TREE_CODE (var) == MEM_REF) | |
5740 | { | |
5741 | var = TREE_OPERAND (var, 0); | |
e01d41e5 JJ |
5742 | if (TREE_CODE (var) == POINTER_PLUS_EXPR) |
5743 | var = TREE_OPERAND (var, 0); | |
d9a6bd32 JJ |
5744 | if (TREE_CODE (var) == INDIRECT_REF |
5745 | || TREE_CODE (var) == ADDR_EXPR) | |
5746 | var = TREE_OPERAND (var, 0); | |
5747 | orig_var = var; | |
5748 | if (is_variable_sized (var)) | |
5749 | { | |
5750 | gcc_assert (DECL_HAS_VALUE_EXPR_P (var)); | |
5751 | var = DECL_VALUE_EXPR (var); | |
5752 | gcc_assert (TREE_CODE (var) == INDIRECT_REF); | |
5753 | var = TREE_OPERAND (var, 0); | |
5754 | gcc_assert (DECL_P (var)); | |
5755 | } | |
5756 | } | |
953ff289 | 5757 | new_var = lookup_decl (var, ctx); |
d9a6bd32 | 5758 | if (var == OMP_CLAUSE_DECL (c) && is_reference (var)) |
70f34814 | 5759 | new_var = build_simple_mem_ref_loc (clause_loc, new_var); |
953ff289 DN |
5760 | ref = build_outer_var_ref (var, ctx); |
5761 | code = OMP_CLAUSE_REDUCTION_CODE (c); | |
50674e96 DN |
5762 | |
5763 | /* reduction(-:var) sums up the partial results, so it acts | |
5764 | identically to reduction(+:var). */ | |
953ff289 DN |
5765 | if (code == MINUS_EXPR) |
5766 | code = PLUS_EXPR; | |
5767 | ||
e5014671 | 5768 | if (count == 1) |
953ff289 | 5769 | { |
db3927fb | 5770 | tree addr = build_fold_addr_expr_loc (clause_loc, ref); |
953ff289 DN |
5771 | |
5772 | addr = save_expr (addr); | |
5773 | ref = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (addr)), addr); | |
db3927fb | 5774 | x = fold_build2_loc (clause_loc, code, TREE_TYPE (ref), ref, new_var); |
953ff289 | 5775 | x = build2 (OMP_ATOMIC, void_type_node, addr, x); |
726a989a | 5776 | gimplify_and_add (x, stmt_seqp); |
953ff289 DN |
5777 | return; |
5778 | } | |
d9a6bd32 JJ |
5779 | else if (TREE_CODE (OMP_CLAUSE_DECL (c)) == MEM_REF) |
5780 | { | |
5781 | tree d = OMP_CLAUSE_DECL (c); | |
5782 | tree type = TREE_TYPE (d); | |
5783 | tree v = TYPE_MAX_VALUE (TYPE_DOMAIN (type)); | |
5784 | tree i = create_tmp_var (TREE_TYPE (v), NULL); | |
5785 | tree ptype = build_pointer_type (TREE_TYPE (type)); | |
e01d41e5 JJ |
5786 | tree bias = TREE_OPERAND (d, 1); |
5787 | d = TREE_OPERAND (d, 0); | |
5788 | if (TREE_CODE (d) == POINTER_PLUS_EXPR) | |
5789 | { | |
5790 | tree b = TREE_OPERAND (d, 1); | |
5791 | b = maybe_lookup_decl (b, ctx); | |
5792 | if (b == NULL) | |
5793 | { | |
5794 | b = TREE_OPERAND (d, 1); | |
5795 | b = maybe_lookup_decl_in_outer_ctx (b, ctx); | |
5796 | } | |
5797 | if (integer_zerop (bias)) | |
5798 | bias = b; | |
5799 | else | |
5800 | { | |
5801 | bias = fold_convert_loc (clause_loc, TREE_TYPE (b), bias); | |
5802 | bias = fold_build2_loc (clause_loc, PLUS_EXPR, | |
5803 | TREE_TYPE (b), b, bias); | |
5804 | } | |
5805 | d = TREE_OPERAND (d, 0); | |
5806 | } | |
d9a6bd32 JJ |
5807 | /* For ref build_outer_var_ref already performs this, so |
5808 | only new_var needs a dereference. */ | |
e01d41e5 | 5809 | if (TREE_CODE (d) == INDIRECT_REF) |
d9a6bd32 JJ |
5810 | { |
5811 | new_var = build_simple_mem_ref_loc (clause_loc, new_var); | |
5812 | gcc_assert (is_reference (var) && var == orig_var); | |
5813 | } | |
e01d41e5 | 5814 | else if (TREE_CODE (d) == ADDR_EXPR) |
d9a6bd32 JJ |
5815 | { |
5816 | if (orig_var == var) | |
5817 | { | |
5818 | new_var = build_fold_addr_expr (new_var); | |
5819 | ref = build_fold_addr_expr (ref); | |
5820 | } | |
5821 | } | |
5822 | else | |
5823 | { | |
5824 | gcc_assert (orig_var == var); | |
5825 | if (is_reference (var)) | |
5826 | ref = build_fold_addr_expr (ref); | |
5827 | } | |
5828 | if (DECL_P (v)) | |
5829 | { | |
5830 | tree t = maybe_lookup_decl (v, ctx); | |
5831 | if (t) | |
5832 | v = t; | |
5833 | else | |
5834 | v = maybe_lookup_decl_in_outer_ctx (v, ctx); | |
5835 | gimplify_expr (&v, stmt_seqp, NULL, is_gimple_val, fb_rvalue); | |
5836 | } | |
e01d41e5 JJ |
5837 | if (!integer_zerop (bias)) |
5838 | { | |
5839 | bias = fold_convert_loc (clause_loc, sizetype, bias); | |
5840 | new_var = fold_build2_loc (clause_loc, POINTER_PLUS_EXPR, | |
5841 | TREE_TYPE (new_var), new_var, | |
5842 | unshare_expr (bias)); | |
5843 | ref = fold_build2_loc (clause_loc, POINTER_PLUS_EXPR, | |
5844 | TREE_TYPE (ref), ref, bias); | |
5845 | } | |
d9a6bd32 JJ |
5846 | new_var = fold_convert_loc (clause_loc, ptype, new_var); |
5847 | ref = fold_convert_loc (clause_loc, ptype, ref); | |
5848 | tree m = create_tmp_var (ptype, NULL); | |
5849 | gimplify_assign (m, new_var, stmt_seqp); | |
5850 | new_var = m; | |
5851 | m = create_tmp_var (ptype, NULL); | |
5852 | gimplify_assign (m, ref, stmt_seqp); | |
5853 | ref = m; | |
5854 | gimplify_assign (i, build_int_cst (TREE_TYPE (v), 0), stmt_seqp); | |
5855 | tree body = create_artificial_label (UNKNOWN_LOCATION); | |
5856 | tree end = create_artificial_label (UNKNOWN_LOCATION); | |
5857 | gimple_seq_add_stmt (&sub_seq, gimple_build_label (body)); | |
5858 | tree priv = build_simple_mem_ref_loc (clause_loc, new_var); | |
5859 | tree out = build_simple_mem_ref_loc (clause_loc, ref); | |
5860 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) | |
5861 | { | |
5862 | tree placeholder = OMP_CLAUSE_REDUCTION_PLACEHOLDER (c); | |
5863 | tree decl_placeholder | |
5864 | = OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c); | |
5865 | SET_DECL_VALUE_EXPR (placeholder, out); | |
5866 | DECL_HAS_VALUE_EXPR_P (placeholder) = 1; | |
5867 | SET_DECL_VALUE_EXPR (decl_placeholder, priv); | |
5868 | DECL_HAS_VALUE_EXPR_P (decl_placeholder) = 1; | |
5869 | lower_omp (&OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c), ctx); | |
5870 | gimple_seq_add_seq (&sub_seq, | |
5871 | OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)); | |
5872 | OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = NULL; | |
5873 | OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) = NULL; | |
5874 | OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c) = NULL; | |
5875 | } | |
5876 | else | |
5877 | { | |
5878 | x = build2 (code, TREE_TYPE (out), out, priv); | |
5879 | out = unshare_expr (out); | |
5880 | gimplify_assign (out, x, &sub_seq); | |
5881 | } | |
5882 | gimple *g = gimple_build_assign (new_var, POINTER_PLUS_EXPR, new_var, | |
5883 | TYPE_SIZE_UNIT (TREE_TYPE (type))); | |
5884 | gimple_seq_add_stmt (&sub_seq, g); | |
5885 | g = gimple_build_assign (ref, POINTER_PLUS_EXPR, ref, | |
5886 | TYPE_SIZE_UNIT (TREE_TYPE (type))); | |
5887 | gimple_seq_add_stmt (&sub_seq, g); | |
5888 | g = gimple_build_assign (i, PLUS_EXPR, i, | |
5889 | build_int_cst (TREE_TYPE (i), 1)); | |
5890 | gimple_seq_add_stmt (&sub_seq, g); | |
5891 | g = gimple_build_cond (LE_EXPR, i, v, body, end); | |
5892 | gimple_seq_add_stmt (&sub_seq, g); | |
5893 | gimple_seq_add_stmt (&sub_seq, gimple_build_label (end)); | |
5894 | } | |
41dbbb37 | 5895 | else if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) |
953ff289 DN |
5896 | { |
5897 | tree placeholder = OMP_CLAUSE_REDUCTION_PLACEHOLDER (c); | |
5898 | ||
acf0174b JJ |
5899 | if (is_reference (var) |
5900 | && !useless_type_conversion_p (TREE_TYPE (placeholder), | |
5901 | TREE_TYPE (ref))) | |
db3927fb | 5902 | ref = build_fold_addr_expr_loc (clause_loc, ref); |
953ff289 DN |
5903 | SET_DECL_VALUE_EXPR (placeholder, ref); |
5904 | DECL_HAS_VALUE_EXPR_P (placeholder) = 1; | |
355a7673 | 5905 | lower_omp (&OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c), ctx); |
726a989a RB |
5906 | gimple_seq_add_seq (&sub_seq, OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)); |
5907 | OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = NULL; | |
953ff289 DN |
5908 | OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) = NULL; |
5909 | } | |
5910 | else | |
5911 | { | |
5912 | x = build2 (code, TREE_TYPE (ref), ref, new_var); | |
5913 | ref = build_outer_var_ref (var, ctx); | |
726a989a | 5914 | gimplify_assign (ref, x, &sub_seq); |
953ff289 DN |
5915 | } |
5916 | } | |
5917 | ||
41dbbb37 TS |
5918 | if (is_gimple_omp_oacc (ctx->stmt)) |
5919 | return; | |
5920 | ||
e79983f4 MM |
5921 | stmt = gimple_build_call (builtin_decl_explicit (BUILT_IN_GOMP_ATOMIC_START), |
5922 | 0); | |
726a989a | 5923 | gimple_seq_add_stmt (stmt_seqp, stmt); |
953ff289 | 5924 | |
726a989a | 5925 | gimple_seq_add_seq (stmt_seqp, sub_seq); |
953ff289 | 5926 | |
e79983f4 MM |
5927 | stmt = gimple_build_call (builtin_decl_explicit (BUILT_IN_GOMP_ATOMIC_END), |
5928 | 0); | |
726a989a | 5929 | gimple_seq_add_stmt (stmt_seqp, stmt); |
953ff289 DN |
5930 | } |
5931 | ||
50674e96 | 5932 | |
953ff289 DN |
5933 | /* Generate code to implement the COPYPRIVATE clauses. */ |
5934 | ||
5935 | static void | |
726a989a | 5936 | lower_copyprivate_clauses (tree clauses, gimple_seq *slist, gimple_seq *rlist, |
953ff289 DN |
5937 | omp_context *ctx) |
5938 | { | |
5939 | tree c; | |
5940 | ||
5941 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
5942 | { | |
78db7d92 | 5943 | tree var, new_var, ref, x; |
953ff289 | 5944 | bool by_ref; |
db3927fb | 5945 | location_t clause_loc = OMP_CLAUSE_LOCATION (c); |
953ff289 | 5946 | |
aaf46ef9 | 5947 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_COPYPRIVATE) |
953ff289 DN |
5948 | continue; |
5949 | ||
5950 | var = OMP_CLAUSE_DECL (c); | |
7c8f7639 | 5951 | by_ref = use_pointer_for_field (var, NULL); |
953ff289 DN |
5952 | |
5953 | ref = build_sender_ref (var, ctx); | |
78db7d92 JJ |
5954 | x = new_var = lookup_decl_in_outer_ctx (var, ctx); |
5955 | if (by_ref) | |
5956 | { | |
5957 | x = build_fold_addr_expr_loc (clause_loc, new_var); | |
5958 | x = fold_convert_loc (clause_loc, TREE_TYPE (ref), x); | |
5959 | } | |
726a989a | 5960 | gimplify_assign (ref, x, slist); |
953ff289 | 5961 | |
78db7d92 JJ |
5962 | ref = build_receiver_ref (var, false, ctx); |
5963 | if (by_ref) | |
5964 | { | |
5965 | ref = fold_convert_loc (clause_loc, | |
5966 | build_pointer_type (TREE_TYPE (new_var)), | |
5967 | ref); | |
5968 | ref = build_fold_indirect_ref_loc (clause_loc, ref); | |
5969 | } | |
953ff289 DN |
5970 | if (is_reference (var)) |
5971 | { | |
78db7d92 | 5972 | ref = fold_convert_loc (clause_loc, TREE_TYPE (new_var), ref); |
70f34814 RG |
5973 | ref = build_simple_mem_ref_loc (clause_loc, ref); |
5974 | new_var = build_simple_mem_ref_loc (clause_loc, new_var); | |
953ff289 | 5975 | } |
78db7d92 | 5976 | x = lang_hooks.decls.omp_clause_assign_op (c, new_var, ref); |
953ff289 DN |
5977 | gimplify_and_add (x, rlist); |
5978 | } | |
5979 | } | |
5980 | ||
50674e96 | 5981 | |
953ff289 DN |
5982 | /* Generate code to implement the clauses, FIRSTPRIVATE, COPYIN, LASTPRIVATE, |
5983 | and REDUCTION from the sender (aka parent) side. */ | |
5984 | ||
5985 | static void | |
726a989a RB |
5986 | lower_send_clauses (tree clauses, gimple_seq *ilist, gimple_seq *olist, |
5987 | omp_context *ctx) | |
953ff289 | 5988 | { |
d9a6bd32 JJ |
5989 | tree c, t; |
5990 | int ignored_looptemp = 0; | |
5991 | bool is_taskloop = false; | |
5992 | ||
5993 | /* For taskloop, ignore first two _looptemp_ clauses, those are initialized | |
5994 | by GOMP_taskloop. */ | |
5995 | if (is_task_ctx (ctx) && gimple_omp_task_taskloop_p (ctx->stmt)) | |
5996 | { | |
5997 | ignored_looptemp = 2; | |
5998 | is_taskloop = true; | |
5999 | } | |
953ff289 DN |
6000 | |
6001 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
6002 | { | |
50674e96 | 6003 | tree val, ref, x, var; |
953ff289 | 6004 | bool by_ref, do_in = false, do_out = false; |
db3927fb | 6005 | location_t clause_loc = OMP_CLAUSE_LOCATION (c); |
953ff289 | 6006 | |
aaf46ef9 | 6007 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 | 6008 | { |
a68ab351 JJ |
6009 | case OMP_CLAUSE_PRIVATE: |
6010 | if (OMP_CLAUSE_PRIVATE_OUTER_REF (c)) | |
6011 | break; | |
6012 | continue; | |
953ff289 DN |
6013 | case OMP_CLAUSE_FIRSTPRIVATE: |
6014 | case OMP_CLAUSE_COPYIN: | |
6015 | case OMP_CLAUSE_LASTPRIVATE: | |
6016 | case OMP_CLAUSE_REDUCTION: | |
d9a6bd32 JJ |
6017 | break; |
6018 | case OMP_CLAUSE_SHARED: | |
6019 | if (OMP_CLAUSE_SHARED_FIRSTPRIVATE (c)) | |
6020 | break; | |
6021 | continue; | |
acf0174b | 6022 | case OMP_CLAUSE__LOOPTEMP_: |
d9a6bd32 JJ |
6023 | if (ignored_looptemp) |
6024 | { | |
6025 | ignored_looptemp--; | |
6026 | continue; | |
6027 | } | |
953ff289 DN |
6028 | break; |
6029 | default: | |
6030 | continue; | |
6031 | } | |
6032 | ||
d2dda7fe | 6033 | val = OMP_CLAUSE_DECL (c); |
d9a6bd32 JJ |
6034 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION |
6035 | && TREE_CODE (val) == MEM_REF) | |
6036 | { | |
6037 | val = TREE_OPERAND (val, 0); | |
e01d41e5 JJ |
6038 | if (TREE_CODE (val) == POINTER_PLUS_EXPR) |
6039 | val = TREE_OPERAND (val, 0); | |
d9a6bd32 JJ |
6040 | if (TREE_CODE (val) == INDIRECT_REF |
6041 | || TREE_CODE (val) == ADDR_EXPR) | |
6042 | val = TREE_OPERAND (val, 0); | |
6043 | if (is_variable_sized (val)) | |
6044 | continue; | |
6045 | } | |
6046 | ||
6047 | /* For OMP_CLAUSE_SHARED_FIRSTPRIVATE, look beyond the | |
6048 | outer taskloop region. */ | |
6049 | omp_context *ctx_for_o = ctx; | |
6050 | if (is_taskloop | |
6051 | && OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED | |
6052 | && OMP_CLAUSE_SHARED_FIRSTPRIVATE (c)) | |
6053 | ctx_for_o = ctx->outer; | |
6054 | ||
6055 | var = lookup_decl_in_outer_ctx (val, ctx_for_o); | |
50674e96 | 6056 | |
8ca5b2a2 JJ |
6057 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_COPYIN |
6058 | && is_global_var (var)) | |
6059 | continue; | |
d9a6bd32 JJ |
6060 | |
6061 | t = omp_member_access_dummy_var (var); | |
6062 | if (t) | |
6063 | { | |
6064 | var = DECL_VALUE_EXPR (var); | |
6065 | tree o = maybe_lookup_decl_in_outer_ctx (t, ctx_for_o); | |
6066 | if (o != t) | |
6067 | var = unshare_and_remap (var, t, o); | |
6068 | else | |
6069 | var = unshare_expr (var); | |
6070 | } | |
6071 | ||
6072 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED) | |
6073 | { | |
6074 | /* Handle taskloop firstprivate/lastprivate, where the | |
6075 | lastprivate on GIMPLE_OMP_TASK is represented as | |
6076 | OMP_CLAUSE_SHARED_FIRSTPRIVATE. */ | |
6077 | tree f = lookup_sfield ((splay_tree_key) &DECL_UID (val), ctx); | |
6078 | x = omp_build_component_ref (ctx->sender_decl, f); | |
6079 | if (use_pointer_for_field (val, ctx)) | |
6080 | var = build_fold_addr_expr (var); | |
6081 | gimplify_assign (x, var, ilist); | |
6082 | DECL_ABSTRACT_ORIGIN (f) = NULL; | |
6083 | continue; | |
6084 | } | |
6085 | ||
6086 | if ((OMP_CLAUSE_CODE (c) != OMP_CLAUSE_REDUCTION | |
6087 | || val == OMP_CLAUSE_DECL (c)) | |
6088 | && is_variable_sized (val)) | |
953ff289 | 6089 | continue; |
7c8f7639 | 6090 | by_ref = use_pointer_for_field (val, NULL); |
953ff289 | 6091 | |
aaf46ef9 | 6092 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 | 6093 | { |
a68ab351 | 6094 | case OMP_CLAUSE_PRIVATE: |
953ff289 DN |
6095 | case OMP_CLAUSE_FIRSTPRIVATE: |
6096 | case OMP_CLAUSE_COPYIN: | |
acf0174b | 6097 | case OMP_CLAUSE__LOOPTEMP_: |
953ff289 DN |
6098 | do_in = true; |
6099 | break; | |
6100 | ||
6101 | case OMP_CLAUSE_LASTPRIVATE: | |
6102 | if (by_ref || is_reference (val)) | |
6103 | { | |
6104 | if (OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)) | |
6105 | continue; | |
6106 | do_in = true; | |
6107 | } | |
6108 | else | |
a68ab351 JJ |
6109 | { |
6110 | do_out = true; | |
6111 | if (lang_hooks.decls.omp_private_outer_ref (val)) | |
6112 | do_in = true; | |
6113 | } | |
953ff289 DN |
6114 | break; |
6115 | ||
6116 | case OMP_CLAUSE_REDUCTION: | |
6117 | do_in = true; | |
d9a6bd32 JJ |
6118 | if (val == OMP_CLAUSE_DECL (c)) |
6119 | do_out = !(by_ref || is_reference (val)); | |
6120 | else | |
6121 | by_ref = TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE; | |
953ff289 DN |
6122 | break; |
6123 | ||
6124 | default: | |
6125 | gcc_unreachable (); | |
6126 | } | |
6127 | ||
6128 | if (do_in) | |
6129 | { | |
6130 | ref = build_sender_ref (val, ctx); | |
db3927fb | 6131 | x = by_ref ? build_fold_addr_expr_loc (clause_loc, var) : var; |
726a989a | 6132 | gimplify_assign (ref, x, ilist); |
a68ab351 JJ |
6133 | if (is_task_ctx (ctx)) |
6134 | DECL_ABSTRACT_ORIGIN (TREE_OPERAND (ref, 1)) = NULL; | |
953ff289 | 6135 | } |
50674e96 | 6136 | |
953ff289 DN |
6137 | if (do_out) |
6138 | { | |
6139 | ref = build_sender_ref (val, ctx); | |
726a989a | 6140 | gimplify_assign (var, ref, olist); |
953ff289 DN |
6141 | } |
6142 | } | |
6143 | } | |
6144 | ||
726a989a RB |
6145 | /* Generate code to implement SHARED from the sender (aka parent) |
6146 | side. This is trickier, since GIMPLE_OMP_PARALLEL_CLAUSES doesn't | |
6147 | list things that got automatically shared. */ | |
953ff289 DN |
6148 | |
6149 | static void | |
726a989a | 6150 | lower_send_shared_vars (gimple_seq *ilist, gimple_seq *olist, omp_context *ctx) |
953ff289 | 6151 | { |
d9a6bd32 | 6152 | tree var, ovar, nvar, t, f, x, record_type; |
953ff289 DN |
6153 | |
6154 | if (ctx->record_type == NULL) | |
6155 | return; | |
50674e96 | 6156 | |
a68ab351 | 6157 | record_type = ctx->srecord_type ? ctx->srecord_type : ctx->record_type; |
910ad8de | 6158 | for (f = TYPE_FIELDS (record_type); f ; f = DECL_CHAIN (f)) |
953ff289 DN |
6159 | { |
6160 | ovar = DECL_ABSTRACT_ORIGIN (f); | |
d9a6bd32 JJ |
6161 | if (!ovar || TREE_CODE (ovar) == FIELD_DECL) |
6162 | continue; | |
6163 | ||
953ff289 DN |
6164 | nvar = maybe_lookup_decl (ovar, ctx); |
6165 | if (!nvar || !DECL_HAS_VALUE_EXPR_P (nvar)) | |
6166 | continue; | |
6167 | ||
50674e96 DN |
6168 | /* If CTX is a nested parallel directive. Find the immediately |
6169 | enclosing parallel or workshare construct that contains a | |
6170 | mapping for OVAR. */ | |
d2dda7fe | 6171 | var = lookup_decl_in_outer_ctx (ovar, ctx); |
50674e96 | 6172 | |
d9a6bd32 JJ |
6173 | t = omp_member_access_dummy_var (var); |
6174 | if (t) | |
6175 | { | |
6176 | var = DECL_VALUE_EXPR (var); | |
6177 | tree o = maybe_lookup_decl_in_outer_ctx (t, ctx); | |
6178 | if (o != t) | |
6179 | var = unshare_and_remap (var, t, o); | |
6180 | else | |
6181 | var = unshare_expr (var); | |
6182 | } | |
6183 | ||
7c8f7639 | 6184 | if (use_pointer_for_field (ovar, ctx)) |
953ff289 DN |
6185 | { |
6186 | x = build_sender_ref (ovar, ctx); | |
50674e96 | 6187 | var = build_fold_addr_expr (var); |
726a989a | 6188 | gimplify_assign (x, var, ilist); |
953ff289 DN |
6189 | } |
6190 | else | |
6191 | { | |
6192 | x = build_sender_ref (ovar, ctx); | |
726a989a | 6193 | gimplify_assign (x, var, ilist); |
953ff289 | 6194 | |
14e5b285 RG |
6195 | if (!TREE_READONLY (var) |
6196 | /* We don't need to receive a new reference to a result | |
6197 | or parm decl. In fact we may not store to it as we will | |
6198 | invalidate any pending RSO and generate wrong gimple | |
6199 | during inlining. */ | |
6200 | && !((TREE_CODE (var) == RESULT_DECL | |
6201 | || TREE_CODE (var) == PARM_DECL) | |
6202 | && DECL_BY_REFERENCE (var))) | |
a68ab351 JJ |
6203 | { |
6204 | x = build_sender_ref (ovar, ctx); | |
726a989a | 6205 | gimplify_assign (var, x, olist); |
a68ab351 | 6206 | } |
953ff289 DN |
6207 | } |
6208 | } | |
6209 | } | |
6210 | ||
e4834818 NS |
6211 | /* Emit an OpenACC head marker call, encapulating the partitioning and |
6212 | other information that must be processed by the target compiler. | |
6213 | Return the maximum number of dimensions the associated loop might | |
6214 | be partitioned over. */ | |
6215 | ||
6216 | static unsigned | |
6217 | lower_oacc_head_mark (location_t loc, tree ddvar, tree clauses, | |
6218 | gimple_seq *seq, omp_context *ctx) | |
6219 | { | |
6220 | unsigned levels = 0; | |
6221 | unsigned tag = 0; | |
6222 | tree gang_static = NULL_TREE; | |
6223 | auto_vec<tree, 5> args; | |
6224 | ||
6225 | args.quick_push (build_int_cst | |
6226 | (integer_type_node, IFN_UNIQUE_OACC_HEAD_MARK)); | |
6227 | args.quick_push (ddvar); | |
6228 | for (tree c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
6229 | { | |
6230 | switch (OMP_CLAUSE_CODE (c)) | |
6231 | { | |
6232 | case OMP_CLAUSE_GANG: | |
6233 | tag |= OLF_DIM_GANG; | |
6234 | gang_static = OMP_CLAUSE_GANG_STATIC_EXPR (c); | |
6235 | /* static:* is represented by -1, and we can ignore it, as | |
6236 | scheduling is always static. */ | |
6237 | if (gang_static && integer_minus_onep (gang_static)) | |
6238 | gang_static = NULL_TREE; | |
6239 | levels++; | |
6240 | break; | |
6241 | ||
6242 | case OMP_CLAUSE_WORKER: | |
6243 | tag |= OLF_DIM_WORKER; | |
6244 | levels++; | |
6245 | break; | |
6246 | ||
6247 | case OMP_CLAUSE_VECTOR: | |
6248 | tag |= OLF_DIM_VECTOR; | |
6249 | levels++; | |
6250 | break; | |
6251 | ||
6252 | case OMP_CLAUSE_SEQ: | |
6253 | tag |= OLF_SEQ; | |
6254 | break; | |
6255 | ||
6256 | case OMP_CLAUSE_AUTO: | |
6257 | tag |= OLF_AUTO; | |
6258 | break; | |
6259 | ||
6260 | case OMP_CLAUSE_INDEPENDENT: | |
6261 | tag |= OLF_INDEPENDENT; | |
6262 | break; | |
6263 | ||
6264 | default: | |
6265 | continue; | |
6266 | } | |
6267 | } | |
6268 | ||
6269 | if (gang_static) | |
6270 | { | |
6271 | if (DECL_P (gang_static)) | |
6272 | gang_static = build_outer_var_ref (gang_static, ctx); | |
6273 | tag |= OLF_GANG_STATIC; | |
6274 | } | |
6275 | ||
6276 | /* In a parallel region, loops are implicitly INDEPENDENT. */ | |
6277 | omp_context *tgt = enclosing_target_ctx (ctx); | |
6278 | if (!tgt || is_oacc_parallel (tgt)) | |
6279 | tag |= OLF_INDEPENDENT; | |
6280 | ||
6281 | /* A loop lacking SEQ, GANG, WORKER and/or VECTOR is implicitly AUTO. */ | |
6282 | if (!(tag & (((GOMP_DIM_MASK (GOMP_DIM_MAX) - 1) << OLF_DIM_BASE) | |
6283 | | OLF_SEQ))) | |
6284 | tag |= OLF_AUTO; | |
6285 | ||
6286 | /* Ensure at least one level. */ | |
6287 | if (!levels) | |
6288 | levels++; | |
6289 | ||
6290 | args.quick_push (build_int_cst (integer_type_node, levels)); | |
6291 | args.quick_push (build_int_cst (integer_type_node, tag)); | |
6292 | if (gang_static) | |
6293 | args.quick_push (gang_static); | |
6294 | ||
6295 | gcall *call = gimple_build_call_internal_vec (IFN_UNIQUE, args); | |
6296 | gimple_set_location (call, loc); | |
6297 | gimple_set_lhs (call, ddvar); | |
6298 | gimple_seq_add_stmt (seq, call); | |
6299 | ||
6300 | return levels; | |
6301 | } | |
6302 | ||
6303 | /* Emit an OpenACC lopp head or tail marker to SEQ. LEVEL is the | |
6304 | partitioning level of the enclosed region. */ | |
6305 | ||
6306 | static void | |
6307 | lower_oacc_loop_marker (location_t loc, tree ddvar, bool head, | |
6308 | tree tofollow, gimple_seq *seq) | |
6309 | { | |
6310 | int marker_kind = (head ? IFN_UNIQUE_OACC_HEAD_MARK | |
6311 | : IFN_UNIQUE_OACC_TAIL_MARK); | |
6312 | tree marker = build_int_cst (integer_type_node, marker_kind); | |
6313 | int nargs = 2 + (tofollow != NULL_TREE); | |
6314 | gcall *call = gimple_build_call_internal (IFN_UNIQUE, nargs, | |
6315 | marker, ddvar, tofollow); | |
6316 | gimple_set_location (call, loc); | |
6317 | gimple_set_lhs (call, ddvar); | |
6318 | gimple_seq_add_stmt (seq, call); | |
6319 | } | |
6320 | ||
6321 | /* Generate the before and after OpenACC loop sequences. CLAUSES are | |
6322 | the loop clauses, from which we extract reductions. Initialize | |
6323 | HEAD and TAIL. */ | |
6324 | ||
6325 | static void | |
6326 | lower_oacc_head_tail (location_t loc, tree clauses, | |
6327 | gimple_seq *head, gimple_seq *tail, omp_context *ctx) | |
6328 | { | |
6329 | bool inner = false; | |
6330 | tree ddvar = create_tmp_var (integer_type_node, ".data_dep"); | |
6331 | gimple_seq_add_stmt (head, gimple_build_assign (ddvar, integer_zero_node)); | |
6332 | ||
6333 | unsigned count = lower_oacc_head_mark (loc, ddvar, clauses, head, ctx); | |
6334 | if (!count) | |
6335 | lower_oacc_loop_marker (loc, ddvar, false, integer_zero_node, tail); | |
6336 | ||
6337 | tree fork_kind = build_int_cst (unsigned_type_node, IFN_UNIQUE_OACC_FORK); | |
6338 | tree join_kind = build_int_cst (unsigned_type_node, IFN_UNIQUE_OACC_JOIN); | |
6339 | ||
6340 | for (unsigned done = 1; count; count--, done++) | |
6341 | { | |
6342 | gimple_seq fork_seq = NULL; | |
6343 | gimple_seq join_seq = NULL; | |
6344 | ||
6345 | tree place = build_int_cst (integer_type_node, -1); | |
6346 | gcall *fork = gimple_build_call_internal (IFN_UNIQUE, 3, | |
6347 | fork_kind, ddvar, place); | |
6348 | gimple_set_location (fork, loc); | |
6349 | gimple_set_lhs (fork, ddvar); | |
6350 | ||
6351 | gcall *join = gimple_build_call_internal (IFN_UNIQUE, 3, | |
6352 | join_kind, ddvar, place); | |
6353 | gimple_set_location (join, loc); | |
6354 | gimple_set_lhs (join, ddvar); | |
6355 | ||
6356 | /* Mark the beginning of this level sequence. */ | |
6357 | if (inner) | |
6358 | lower_oacc_loop_marker (loc, ddvar, true, | |
6359 | build_int_cst (integer_type_node, count), | |
6360 | &fork_seq); | |
6361 | lower_oacc_loop_marker (loc, ddvar, false, | |
6362 | build_int_cst (integer_type_node, done), | |
6363 | &join_seq); | |
6364 | ||
e5014671 NS |
6365 | lower_oacc_reductions (loc, clauses, place, inner, |
6366 | fork, join, &fork_seq, &join_seq, ctx); | |
e4834818 NS |
6367 | |
6368 | /* Append this level to head. */ | |
6369 | gimple_seq_add_seq (head, fork_seq); | |
6370 | /* Prepend it to tail. */ | |
6371 | gimple_seq_add_seq (&join_seq, *tail); | |
6372 | *tail = join_seq; | |
6373 | ||
6374 | inner = true; | |
6375 | } | |
6376 | ||
6377 | /* Mark the end of the sequence. */ | |
6378 | lower_oacc_loop_marker (loc, ddvar, true, NULL_TREE, head); | |
6379 | lower_oacc_loop_marker (loc, ddvar, false, NULL_TREE, tail); | |
6380 | } | |
726a989a RB |
6381 | |
6382 | /* A convenience function to build an empty GIMPLE_COND with just the | |
6383 | condition. */ | |
6384 | ||
538dd0b7 | 6385 | static gcond * |
726a989a RB |
6386 | gimple_build_cond_empty (tree cond) |
6387 | { | |
6388 | enum tree_code pred_code; | |
6389 | tree lhs, rhs; | |
6390 | ||
6391 | gimple_cond_get_ops_from_tree (cond, &pred_code, &lhs, &rhs); | |
6392 | return gimple_build_cond (pred_code, lhs, rhs, NULL_TREE, NULL_TREE); | |
6393 | } | |
6394 | ||
b2b40051 MJ |
6395 | /* Return true if a parallel REGION is within a declare target function or |
6396 | within a target region and is not a part of a gridified target. */ | |
6397 | ||
6398 | static bool | |
6399 | parallel_needs_hsa_kernel_p (struct omp_region *region) | |
6400 | { | |
6401 | bool indirect = false; | |
6402 | for (region = region->outer; region; region = region->outer) | |
6403 | { | |
6404 | if (region->type == GIMPLE_OMP_PARALLEL) | |
6405 | indirect = true; | |
6406 | else if (region->type == GIMPLE_OMP_TARGET) | |
6407 | { | |
6408 | gomp_target *tgt_stmt | |
6409 | = as_a <gomp_target *> (last_stmt (region->entry)); | |
6410 | ||
6411 | if (find_omp_clause (gimple_omp_target_clauses (tgt_stmt), | |
6412 | OMP_CLAUSE__GRIDDIM_)) | |
6413 | return indirect; | |
6414 | else | |
6415 | return true; | |
6416 | } | |
6417 | } | |
6418 | ||
6419 | if (lookup_attribute ("omp declare target", | |
6420 | DECL_ATTRIBUTES (current_function_decl))) | |
6421 | return true; | |
6422 | ||
6423 | return false; | |
6424 | } | |
6425 | ||
d9a6bd32 JJ |
6426 | static void expand_omp_build_assign (gimple_stmt_iterator *, tree, tree, |
6427 | bool = false); | |
726a989a | 6428 | |
b8698a0f | 6429 | /* Build the function calls to GOMP_parallel_start etc to actually |
50674e96 DN |
6430 | generate the parallel operation. REGION is the parallel region |
6431 | being expanded. BB is the block where to insert the code. WS_ARGS | |
6432 | will be set if this is a call to a combined parallel+workshare | |
6433 | construct, it contains the list of additional arguments needed by | |
6434 | the workshare construct. */ | |
953ff289 DN |
6435 | |
6436 | static void | |
777f7f9a | 6437 | expand_parallel_call (struct omp_region *region, basic_block bb, |
538dd0b7 DM |
6438 | gomp_parallel *entry_stmt, |
6439 | vec<tree, va_gc> *ws_args) | |
953ff289 | 6440 | { |
acf0174b | 6441 | tree t, t1, t2, val, cond, c, clauses, flags; |
726a989a | 6442 | gimple_stmt_iterator gsi; |
355fe088 | 6443 | gimple *stmt; |
e79983f4 MM |
6444 | enum built_in_function start_ix; |
6445 | int start_ix2; | |
db3927fb | 6446 | location_t clause_loc; |
9771b263 | 6447 | vec<tree, va_gc> *args; |
50674e96 | 6448 | |
726a989a | 6449 | clauses = gimple_omp_parallel_clauses (entry_stmt); |
50674e96 | 6450 | |
acf0174b | 6451 | /* Determine what flavor of GOMP_parallel we will be |
50674e96 | 6452 | emitting. */ |
acf0174b | 6453 | start_ix = BUILT_IN_GOMP_PARALLEL; |
50674e96 DN |
6454 | if (is_combined_parallel (region)) |
6455 | { | |
777f7f9a | 6456 | switch (region->inner->type) |
50674e96 | 6457 | { |
726a989a | 6458 | case GIMPLE_OMP_FOR: |
a68ab351 | 6459 | gcc_assert (region->inner->sched_kind != OMP_CLAUSE_SCHEDULE_AUTO); |
e01d41e5 JJ |
6460 | switch (region->inner->sched_kind) |
6461 | { | |
6462 | case OMP_CLAUSE_SCHEDULE_RUNTIME: | |
6463 | start_ix2 = 3; | |
6464 | break; | |
6465 | case OMP_CLAUSE_SCHEDULE_DYNAMIC: | |
6466 | case OMP_CLAUSE_SCHEDULE_GUIDED: | |
6467 | if (region->inner->sched_modifiers | |
6468 | & OMP_CLAUSE_SCHEDULE_NONMONOTONIC) | |
6469 | { | |
6470 | start_ix2 = 3 + region->inner->sched_kind; | |
6471 | break; | |
6472 | } | |
6473 | /* FALLTHRU */ | |
6474 | default: | |
6475 | start_ix2 = region->inner->sched_kind; | |
6476 | break; | |
6477 | } | |
6478 | start_ix2 += (int) BUILT_IN_GOMP_PARALLEL_LOOP_STATIC; | |
6479 | start_ix = (enum built_in_function) start_ix2; | |
777f7f9a | 6480 | break; |
726a989a | 6481 | case GIMPLE_OMP_SECTIONS: |
acf0174b | 6482 | start_ix = BUILT_IN_GOMP_PARALLEL_SECTIONS; |
777f7f9a RH |
6483 | break; |
6484 | default: | |
6485 | gcc_unreachable (); | |
50674e96 | 6486 | } |
50674e96 | 6487 | } |
953ff289 DN |
6488 | |
6489 | /* By default, the value of NUM_THREADS is zero (selected at run time) | |
6490 | and there is no conditional. */ | |
6491 | cond = NULL_TREE; | |
6492 | val = build_int_cst (unsigned_type_node, 0); | |
acf0174b | 6493 | flags = build_int_cst (unsigned_type_node, 0); |
953ff289 DN |
6494 | |
6495 | c = find_omp_clause (clauses, OMP_CLAUSE_IF); | |
6496 | if (c) | |
6497 | cond = OMP_CLAUSE_IF_EXPR (c); | |
6498 | ||
6499 | c = find_omp_clause (clauses, OMP_CLAUSE_NUM_THREADS); | |
6500 | if (c) | |
db3927fb AH |
6501 | { |
6502 | val = OMP_CLAUSE_NUM_THREADS_EXPR (c); | |
6503 | clause_loc = OMP_CLAUSE_LOCATION (c); | |
6504 | } | |
6505 | else | |
6506 | clause_loc = gimple_location (entry_stmt); | |
953ff289 | 6507 | |
acf0174b JJ |
6508 | c = find_omp_clause (clauses, OMP_CLAUSE_PROC_BIND); |
6509 | if (c) | |
6510 | flags = build_int_cst (unsigned_type_node, OMP_CLAUSE_PROC_BIND_KIND (c)); | |
6511 | ||
953ff289 | 6512 | /* Ensure 'val' is of the correct type. */ |
db3927fb | 6513 | val = fold_convert_loc (clause_loc, unsigned_type_node, val); |
953ff289 DN |
6514 | |
6515 | /* If we found the clause 'if (cond)', build either | |
6516 | (cond != 0) or (cond ? val : 1u). */ | |
6517 | if (cond) | |
6518 | { | |
50674e96 DN |
6519 | cond = gimple_boolify (cond); |
6520 | ||
953ff289 | 6521 | if (integer_zerop (val)) |
db3927fb AH |
6522 | val = fold_build2_loc (clause_loc, |
6523 | EQ_EXPR, unsigned_type_node, cond, | |
917948d3 | 6524 | build_int_cst (TREE_TYPE (cond), 0)); |
953ff289 | 6525 | else |
50674e96 DN |
6526 | { |
6527 | basic_block cond_bb, then_bb, else_bb; | |
917948d3 | 6528 | edge e, e_then, e_else; |
726a989a | 6529 | tree tmp_then, tmp_else, tmp_join, tmp_var; |
917948d3 | 6530 | |
b731b390 | 6531 | tmp_var = create_tmp_var (TREE_TYPE (val)); |
917948d3 ZD |
6532 | if (gimple_in_ssa_p (cfun)) |
6533 | { | |
b731b390 JJ |
6534 | tmp_then = make_ssa_name (tmp_var); |
6535 | tmp_else = make_ssa_name (tmp_var); | |
6536 | tmp_join = make_ssa_name (tmp_var); | |
917948d3 ZD |
6537 | } |
6538 | else | |
6539 | { | |
6540 | tmp_then = tmp_var; | |
6541 | tmp_else = tmp_var; | |
6542 | tmp_join = tmp_var; | |
6543 | } | |
50674e96 | 6544 | |
c4d281b2 | 6545 | e = split_block_after_labels (bb); |
50674e96 DN |
6546 | cond_bb = e->src; |
6547 | bb = e->dest; | |
6548 | remove_edge (e); | |
6549 | ||
6550 | then_bb = create_empty_bb (cond_bb); | |
6551 | else_bb = create_empty_bb (then_bb); | |
917948d3 ZD |
6552 | set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb); |
6553 | set_immediate_dominator (CDI_DOMINATORS, else_bb, cond_bb); | |
50674e96 | 6554 | |
726a989a RB |
6555 | stmt = gimple_build_cond_empty (cond); |
6556 | gsi = gsi_start_bb (cond_bb); | |
6557 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
50674e96 | 6558 | |
726a989a | 6559 | gsi = gsi_start_bb (then_bb); |
d9a6bd32 | 6560 | expand_omp_build_assign (&gsi, tmp_then, val, true); |
50674e96 | 6561 | |
726a989a | 6562 | gsi = gsi_start_bb (else_bb); |
d9a6bd32 JJ |
6563 | expand_omp_build_assign (&gsi, tmp_else, |
6564 | build_int_cst (unsigned_type_node, 1), | |
6565 | true); | |
50674e96 DN |
6566 | |
6567 | make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE); | |
6568 | make_edge (cond_bb, else_bb, EDGE_FALSE_VALUE); | |
726338f4 RB |
6569 | add_bb_to_loop (then_bb, cond_bb->loop_father); |
6570 | add_bb_to_loop (else_bb, cond_bb->loop_father); | |
917948d3 ZD |
6571 | e_then = make_edge (then_bb, bb, EDGE_FALLTHRU); |
6572 | e_else = make_edge (else_bb, bb, EDGE_FALLTHRU); | |
50674e96 | 6573 | |
917948d3 ZD |
6574 | if (gimple_in_ssa_p (cfun)) |
6575 | { | |
538dd0b7 | 6576 | gphi *phi = create_phi_node (tmp_join, bb); |
9e227d60 DC |
6577 | add_phi_arg (phi, tmp_then, e_then, UNKNOWN_LOCATION); |
6578 | add_phi_arg (phi, tmp_else, e_else, UNKNOWN_LOCATION); | |
917948d3 ZD |
6579 | } |
6580 | ||
6581 | val = tmp_join; | |
50674e96 DN |
6582 | } |
6583 | ||
726a989a RB |
6584 | gsi = gsi_start_bb (bb); |
6585 | val = force_gimple_operand_gsi (&gsi, val, true, NULL_TREE, | |
6586 | false, GSI_CONTINUE_LINKING); | |
953ff289 DN |
6587 | } |
6588 | ||
726a989a RB |
6589 | gsi = gsi_last_bb (bb); |
6590 | t = gimple_omp_parallel_data_arg (entry_stmt); | |
953ff289 | 6591 | if (t == NULL) |
5039610b | 6592 | t1 = null_pointer_node; |
953ff289 | 6593 | else |
5039610b | 6594 | t1 = build_fold_addr_expr (t); |
b2b40051 MJ |
6595 | tree child_fndecl = gimple_omp_parallel_child_fn (entry_stmt); |
6596 | t2 = build_fold_addr_expr (child_fndecl); | |
50674e96 | 6597 | |
acf0174b | 6598 | vec_alloc (args, 4 + vec_safe_length (ws_args)); |
9771b263 DN |
6599 | args->quick_push (t2); |
6600 | args->quick_push (t1); | |
6601 | args->quick_push (val); | |
6602 | if (ws_args) | |
6603 | args->splice (*ws_args); | |
acf0174b | 6604 | args->quick_push (flags); |
3bb06db4 NF |
6605 | |
6606 | t = build_call_expr_loc_vec (UNKNOWN_LOCATION, | |
e79983f4 | 6607 | builtin_decl_explicit (start_ix), args); |
50674e96 | 6608 | |
726a989a RB |
6609 | force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
6610 | false, GSI_CONTINUE_LINKING); | |
b2b40051 MJ |
6611 | |
6612 | if (hsa_gen_requested_p () | |
6613 | && parallel_needs_hsa_kernel_p (region)) | |
6614 | { | |
6615 | cgraph_node *child_cnode = cgraph_node::get (child_fndecl); | |
6616 | hsa_register_kernel (child_cnode); | |
6617 | } | |
953ff289 DN |
6618 | } |
6619 | ||
9a771876 JJ |
6620 | /* Insert a function call whose name is FUNC_NAME with the information from |
6621 | ENTRY_STMT into the basic_block BB. */ | |
6622 | ||
6623 | static void | |
538dd0b7 | 6624 | expand_cilk_for_call (basic_block bb, gomp_parallel *entry_stmt, |
9a771876 JJ |
6625 | vec <tree, va_gc> *ws_args) |
6626 | { | |
6627 | tree t, t1, t2; | |
6628 | gimple_stmt_iterator gsi; | |
6629 | vec <tree, va_gc> *args; | |
6630 | ||
6631 | gcc_assert (vec_safe_length (ws_args) == 2); | |
6632 | tree func_name = (*ws_args)[0]; | |
6633 | tree grain = (*ws_args)[1]; | |
6634 | ||
6635 | tree clauses = gimple_omp_parallel_clauses (entry_stmt); | |
6636 | tree count = find_omp_clause (clauses, OMP_CLAUSE__CILK_FOR_COUNT_); | |
6637 | gcc_assert (count != NULL_TREE); | |
6638 | count = OMP_CLAUSE_OPERAND (count, 0); | |
6639 | ||
6640 | gsi = gsi_last_bb (bb); | |
6641 | t = gimple_omp_parallel_data_arg (entry_stmt); | |
6642 | if (t == NULL) | |
6643 | t1 = null_pointer_node; | |
6644 | else | |
6645 | t1 = build_fold_addr_expr (t); | |
6646 | t2 = build_fold_addr_expr (gimple_omp_parallel_child_fn (entry_stmt)); | |
6647 | ||
6648 | vec_alloc (args, 4); | |
6649 | args->quick_push (t2); | |
6650 | args->quick_push (t1); | |
6651 | args->quick_push (count); | |
6652 | args->quick_push (grain); | |
6653 | t = build_call_expr_loc_vec (UNKNOWN_LOCATION, func_name, args); | |
6654 | ||
6655 | force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, false, | |
6656 | GSI_CONTINUE_LINKING); | |
6657 | } | |
50674e96 | 6658 | |
a68ab351 JJ |
6659 | /* Build the function call to GOMP_task to actually |
6660 | generate the task operation. BB is the block where to insert the code. */ | |
6661 | ||
6662 | static void | |
d9a6bd32 JJ |
6663 | expand_task_call (struct omp_region *region, basic_block bb, |
6664 | gomp_task *entry_stmt) | |
a68ab351 | 6665 | { |
d9a6bd32 | 6666 | tree t1, t2, t3; |
726a989a | 6667 | gimple_stmt_iterator gsi; |
db3927fb | 6668 | location_t loc = gimple_location (entry_stmt); |
a68ab351 | 6669 | |
d9a6bd32 JJ |
6670 | tree clauses = gimple_omp_task_clauses (entry_stmt); |
6671 | ||
6672 | tree ifc = find_omp_clause (clauses, OMP_CLAUSE_IF); | |
6673 | tree untied = find_omp_clause (clauses, OMP_CLAUSE_UNTIED); | |
6674 | tree mergeable = find_omp_clause (clauses, OMP_CLAUSE_MERGEABLE); | |
6675 | tree depend = find_omp_clause (clauses, OMP_CLAUSE_DEPEND); | |
6676 | tree finalc = find_omp_clause (clauses, OMP_CLAUSE_FINAL); | |
6677 | tree priority = find_omp_clause (clauses, OMP_CLAUSE_PRIORITY); | |
6678 | ||
6679 | unsigned int iflags | |
6680 | = (untied ? GOMP_TASK_FLAG_UNTIED : 0) | |
6681 | | (mergeable ? GOMP_TASK_FLAG_MERGEABLE : 0) | |
6682 | | (depend ? GOMP_TASK_FLAG_DEPEND : 0); | |
6683 | ||
6684 | bool taskloop_p = gimple_omp_task_taskloop_p (entry_stmt); | |
6685 | tree startvar = NULL_TREE, endvar = NULL_TREE, step = NULL_TREE; | |
6686 | tree num_tasks = NULL_TREE; | |
6687 | bool ull = false; | |
6688 | if (taskloop_p) | |
6689 | { | |
6690 | gimple *g = last_stmt (region->outer->entry); | |
6691 | gcc_assert (gimple_code (g) == GIMPLE_OMP_FOR | |
6692 | && gimple_omp_for_kind (g) == GF_OMP_FOR_KIND_TASKLOOP); | |
6693 | struct omp_for_data fd; | |
6694 | extract_omp_for_data (as_a <gomp_for *> (g), &fd, NULL); | |
6695 | startvar = find_omp_clause (clauses, OMP_CLAUSE__LOOPTEMP_); | |
6696 | endvar = find_omp_clause (OMP_CLAUSE_CHAIN (startvar), | |
6697 | OMP_CLAUSE__LOOPTEMP_); | |
6698 | startvar = OMP_CLAUSE_DECL (startvar); | |
6699 | endvar = OMP_CLAUSE_DECL (endvar); | |
6700 | step = fold_convert_loc (loc, fd.iter_type, fd.loop.step); | |
6701 | if (fd.loop.cond_code == LT_EXPR) | |
6702 | iflags |= GOMP_TASK_FLAG_UP; | |
6703 | tree tclauses = gimple_omp_for_clauses (g); | |
6704 | num_tasks = find_omp_clause (tclauses, OMP_CLAUSE_NUM_TASKS); | |
6705 | if (num_tasks) | |
6706 | num_tasks = OMP_CLAUSE_NUM_TASKS_EXPR (num_tasks); | |
6707 | else | |
6708 | { | |
6709 | num_tasks = find_omp_clause (tclauses, OMP_CLAUSE_GRAINSIZE); | |
6710 | if (num_tasks) | |
6711 | { | |
6712 | iflags |= GOMP_TASK_FLAG_GRAINSIZE; | |
6713 | num_tasks = OMP_CLAUSE_GRAINSIZE_EXPR (num_tasks); | |
6714 | } | |
6715 | else | |
6716 | num_tasks = integer_zero_node; | |
6717 | } | |
6718 | num_tasks = fold_convert_loc (loc, long_integer_type_node, num_tasks); | |
6719 | if (ifc == NULL_TREE) | |
6720 | iflags |= GOMP_TASK_FLAG_IF; | |
6721 | if (find_omp_clause (tclauses, OMP_CLAUSE_NOGROUP)) | |
6722 | iflags |= GOMP_TASK_FLAG_NOGROUP; | |
6723 | ull = fd.iter_type == long_long_unsigned_type_node; | |
6724 | } | |
6725 | else if (priority) | |
6726 | iflags |= GOMP_TASK_FLAG_PRIORITY; | |
a68ab351 | 6727 | |
d9a6bd32 | 6728 | tree flags = build_int_cst (unsigned_type_node, iflags); |
a68ab351 | 6729 | |
d9a6bd32 JJ |
6730 | tree cond = boolean_true_node; |
6731 | if (ifc) | |
6732 | { | |
6733 | if (taskloop_p) | |
6734 | { | |
6735 | tree t = gimple_boolify (OMP_CLAUSE_IF_EXPR (ifc)); | |
6736 | t = fold_build3_loc (loc, COND_EXPR, unsigned_type_node, t, | |
6737 | build_int_cst (unsigned_type_node, | |
6738 | GOMP_TASK_FLAG_IF), | |
6739 | build_int_cst (unsigned_type_node, 0)); | |
6740 | flags = fold_build2_loc (loc, PLUS_EXPR, unsigned_type_node, | |
6741 | flags, t); | |
6742 | } | |
6743 | else | |
6744 | cond = gimple_boolify (OMP_CLAUSE_IF_EXPR (ifc)); | |
6745 | } | |
20906c66 | 6746 | |
d9a6bd32 | 6747 | if (finalc) |
20906c66 | 6748 | { |
d9a6bd32 JJ |
6749 | tree t = gimple_boolify (OMP_CLAUSE_FINAL_EXPR (finalc)); |
6750 | t = fold_build3_loc (loc, COND_EXPR, unsigned_type_node, t, | |
6751 | build_int_cst (unsigned_type_node, | |
6752 | GOMP_TASK_FLAG_FINAL), | |
20906c66 | 6753 | build_int_cst (unsigned_type_node, 0)); |
d9a6bd32 | 6754 | flags = fold_build2_loc (loc, PLUS_EXPR, unsigned_type_node, flags, t); |
20906c66 | 6755 | } |
acf0174b JJ |
6756 | if (depend) |
6757 | depend = OMP_CLAUSE_DECL (depend); | |
6758 | else | |
6759 | depend = build_int_cst (ptr_type_node, 0); | |
d9a6bd32 JJ |
6760 | if (priority) |
6761 | priority = fold_convert (integer_type_node, | |
6762 | OMP_CLAUSE_PRIORITY_EXPR (priority)); | |
6763 | else | |
6764 | priority = integer_zero_node; | |
a68ab351 | 6765 | |
726a989a | 6766 | gsi = gsi_last_bb (bb); |
d9a6bd32 | 6767 | tree t = gimple_omp_task_data_arg (entry_stmt); |
a68ab351 JJ |
6768 | if (t == NULL) |
6769 | t2 = null_pointer_node; | |
6770 | else | |
db3927fb AH |
6771 | t2 = build_fold_addr_expr_loc (loc, t); |
6772 | t1 = build_fold_addr_expr_loc (loc, gimple_omp_task_child_fn (entry_stmt)); | |
726a989a | 6773 | t = gimple_omp_task_copy_fn (entry_stmt); |
a68ab351 JJ |
6774 | if (t == NULL) |
6775 | t3 = null_pointer_node; | |
6776 | else | |
db3927fb | 6777 | t3 = build_fold_addr_expr_loc (loc, t); |
a68ab351 | 6778 | |
d9a6bd32 JJ |
6779 | if (taskloop_p) |
6780 | t = build_call_expr (ull | |
6781 | ? builtin_decl_explicit (BUILT_IN_GOMP_TASKLOOP_ULL) | |
6782 | : builtin_decl_explicit (BUILT_IN_GOMP_TASKLOOP), | |
6783 | 11, t1, t2, t3, | |
6784 | gimple_omp_task_arg_size (entry_stmt), | |
6785 | gimple_omp_task_arg_align (entry_stmt), flags, | |
6786 | num_tasks, priority, startvar, endvar, step); | |
6787 | else | |
6788 | t = build_call_expr (builtin_decl_explicit (BUILT_IN_GOMP_TASK), | |
6789 | 9, t1, t2, t3, | |
6790 | gimple_omp_task_arg_size (entry_stmt), | |
6791 | gimple_omp_task_arg_align (entry_stmt), cond, flags, | |
6792 | depend, priority); | |
a68ab351 | 6793 | |
726a989a RB |
6794 | force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
6795 | false, GSI_CONTINUE_LINKING); | |
a68ab351 JJ |
6796 | } |
6797 | ||
6798 | ||
726a989a RB |
6799 | /* If exceptions are enabled, wrap the statements in BODY in a MUST_NOT_THROW |
6800 | catch handler and return it. This prevents programs from violating the | |
6801 | structured block semantics with throws. */ | |
953ff289 | 6802 | |
726a989a RB |
6803 | static gimple_seq |
6804 | maybe_catch_exception (gimple_seq body) | |
953ff289 | 6805 | { |
355fe088 | 6806 | gimple *g; |
1d65f45c | 6807 | tree decl; |
953ff289 DN |
6808 | |
6809 | if (!flag_exceptions) | |
726a989a | 6810 | return body; |
953ff289 | 6811 | |
3b06d379 SB |
6812 | if (lang_hooks.eh_protect_cleanup_actions != NULL) |
6813 | decl = lang_hooks.eh_protect_cleanup_actions (); | |
953ff289 | 6814 | else |
e79983f4 | 6815 | decl = builtin_decl_explicit (BUILT_IN_TRAP); |
726a989a | 6816 | |
1d65f45c RH |
6817 | g = gimple_build_eh_must_not_throw (decl); |
6818 | g = gimple_build_try (body, gimple_seq_alloc_with_stmt (g), | |
726a989a | 6819 | GIMPLE_TRY_CATCH); |
953ff289 | 6820 | |
1d65f45c | 6821 | return gimple_seq_alloc_with_stmt (g); |
953ff289 DN |
6822 | } |
6823 | ||
50674e96 | 6824 | /* Chain all the DECLs in LIST by their TREE_CHAIN fields. */ |
953ff289 | 6825 | |
50674e96 | 6826 | static tree |
9771b263 | 6827 | vec2chain (vec<tree, va_gc> *v) |
953ff289 | 6828 | { |
c021f10b NF |
6829 | tree chain = NULL_TREE, t; |
6830 | unsigned ix; | |
953ff289 | 6831 | |
9771b263 | 6832 | FOR_EACH_VEC_SAFE_ELT_REVERSE (v, ix, t) |
50674e96 | 6833 | { |
910ad8de | 6834 | DECL_CHAIN (t) = chain; |
c021f10b | 6835 | chain = t; |
50674e96 | 6836 | } |
953ff289 | 6837 | |
c021f10b | 6838 | return chain; |
50674e96 | 6839 | } |
953ff289 | 6840 | |
953ff289 | 6841 | |
50674e96 | 6842 | /* Remove barriers in REGION->EXIT's block. Note that this is only |
726a989a RB |
6843 | valid for GIMPLE_OMP_PARALLEL regions. Since the end of a parallel region |
6844 | is an implicit barrier, any workshare inside the GIMPLE_OMP_PARALLEL that | |
6845 | left a barrier at the end of the GIMPLE_OMP_PARALLEL region can now be | |
50674e96 | 6846 | removed. */ |
953ff289 | 6847 | |
50674e96 DN |
6848 | static void |
6849 | remove_exit_barrier (struct omp_region *region) | |
6850 | { | |
726a989a | 6851 | gimple_stmt_iterator gsi; |
50674e96 | 6852 | basic_block exit_bb; |
777f7f9a RH |
6853 | edge_iterator ei; |
6854 | edge e; | |
355fe088 | 6855 | gimple *stmt; |
03742a9b | 6856 | int any_addressable_vars = -1; |
953ff289 | 6857 | |
777f7f9a | 6858 | exit_bb = region->exit; |
953ff289 | 6859 | |
2aee3e57 JJ |
6860 | /* If the parallel region doesn't return, we don't have REGION->EXIT |
6861 | block at all. */ | |
6862 | if (! exit_bb) | |
6863 | return; | |
6864 | ||
726a989a RB |
6865 | /* The last insn in the block will be the parallel's GIMPLE_OMP_RETURN. The |
6866 | workshare's GIMPLE_OMP_RETURN will be in a preceding block. The kinds of | |
777f7f9a RH |
6867 | statements that can appear in between are extremely limited -- no |
6868 | memory operations at all. Here, we allow nothing at all, so the | |
726a989a RB |
6869 | only thing we allow to precede this GIMPLE_OMP_RETURN is a label. */ |
6870 | gsi = gsi_last_bb (exit_bb); | |
6871 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_RETURN); | |
6872 | gsi_prev (&gsi); | |
6873 | if (!gsi_end_p (gsi) && gimple_code (gsi_stmt (gsi)) != GIMPLE_LABEL) | |
50674e96 | 6874 | return; |
953ff289 | 6875 | |
777f7f9a RH |
6876 | FOR_EACH_EDGE (e, ei, exit_bb->preds) |
6877 | { | |
726a989a RB |
6878 | gsi = gsi_last_bb (e->src); |
6879 | if (gsi_end_p (gsi)) | |
777f7f9a | 6880 | continue; |
726a989a | 6881 | stmt = gsi_stmt (gsi); |
03742a9b JJ |
6882 | if (gimple_code (stmt) == GIMPLE_OMP_RETURN |
6883 | && !gimple_omp_return_nowait_p (stmt)) | |
6884 | { | |
6885 | /* OpenMP 3.0 tasks unfortunately prevent this optimization | |
6886 | in many cases. If there could be tasks queued, the barrier | |
6887 | might be needed to let the tasks run before some local | |
6888 | variable of the parallel that the task uses as shared | |
6889 | runs out of scope. The task can be spawned either | |
6890 | from within current function (this would be easy to check) | |
6891 | or from some function it calls and gets passed an address | |
6892 | of such a variable. */ | |
6893 | if (any_addressable_vars < 0) | |
6894 | { | |
538dd0b7 DM |
6895 | gomp_parallel *parallel_stmt |
6896 | = as_a <gomp_parallel *> (last_stmt (region->entry)); | |
03742a9b | 6897 | tree child_fun = gimple_omp_parallel_child_fn (parallel_stmt); |
c021f10b NF |
6898 | tree local_decls, block, decl; |
6899 | unsigned ix; | |
03742a9b JJ |
6900 | |
6901 | any_addressable_vars = 0; | |
c021f10b NF |
6902 | FOR_EACH_LOCAL_DECL (DECL_STRUCT_FUNCTION (child_fun), ix, decl) |
6903 | if (TREE_ADDRESSABLE (decl)) | |
03742a9b JJ |
6904 | { |
6905 | any_addressable_vars = 1; | |
6906 | break; | |
6907 | } | |
6908 | for (block = gimple_block (stmt); | |
6909 | !any_addressable_vars | |
6910 | && block | |
6911 | && TREE_CODE (block) == BLOCK; | |
6912 | block = BLOCK_SUPERCONTEXT (block)) | |
6913 | { | |
6914 | for (local_decls = BLOCK_VARS (block); | |
6915 | local_decls; | |
910ad8de | 6916 | local_decls = DECL_CHAIN (local_decls)) |
03742a9b JJ |
6917 | if (TREE_ADDRESSABLE (local_decls)) |
6918 | { | |
6919 | any_addressable_vars = 1; | |
6920 | break; | |
6921 | } | |
6922 | if (block == gimple_block (parallel_stmt)) | |
6923 | break; | |
6924 | } | |
6925 | } | |
6926 | if (!any_addressable_vars) | |
6927 | gimple_omp_return_set_nowait (stmt); | |
6928 | } | |
777f7f9a | 6929 | } |
953ff289 DN |
6930 | } |
6931 | ||
777f7f9a RH |
6932 | static void |
6933 | remove_exit_barriers (struct omp_region *region) | |
6934 | { | |
726a989a | 6935 | if (region->type == GIMPLE_OMP_PARALLEL) |
777f7f9a RH |
6936 | remove_exit_barrier (region); |
6937 | ||
6938 | if (region->inner) | |
6939 | { | |
6940 | region = region->inner; | |
6941 | remove_exit_barriers (region); | |
6942 | while (region->next) | |
6943 | { | |
6944 | region = region->next; | |
6945 | remove_exit_barriers (region); | |
6946 | } | |
6947 | } | |
6948 | } | |
50674e96 | 6949 | |
2b4cf991 JJ |
6950 | /* Optimize omp_get_thread_num () and omp_get_num_threads () |
6951 | calls. These can't be declared as const functions, but | |
6952 | within one parallel body they are constant, so they can be | |
6953 | transformed there into __builtin_omp_get_{thread_num,num_threads} () | |
a68ab351 JJ |
6954 | which are declared const. Similarly for task body, except |
6955 | that in untied task omp_get_thread_num () can change at any task | |
6956 | scheduling point. */ | |
2b4cf991 JJ |
6957 | |
6958 | static void | |
355fe088 | 6959 | optimize_omp_library_calls (gimple *entry_stmt) |
2b4cf991 JJ |
6960 | { |
6961 | basic_block bb; | |
726a989a | 6962 | gimple_stmt_iterator gsi; |
e79983f4 MM |
6963 | tree thr_num_tree = builtin_decl_explicit (BUILT_IN_OMP_GET_THREAD_NUM); |
6964 | tree thr_num_id = DECL_ASSEMBLER_NAME (thr_num_tree); | |
6965 | tree num_thr_tree = builtin_decl_explicit (BUILT_IN_OMP_GET_NUM_THREADS); | |
6966 | tree num_thr_id = DECL_ASSEMBLER_NAME (num_thr_tree); | |
726a989a RB |
6967 | bool untied_task = (gimple_code (entry_stmt) == GIMPLE_OMP_TASK |
6968 | && find_omp_clause (gimple_omp_task_clauses (entry_stmt), | |
a68ab351 | 6969 | OMP_CLAUSE_UNTIED) != NULL); |
2b4cf991 | 6970 | |
11cd3bed | 6971 | FOR_EACH_BB_FN (bb, cfun) |
726a989a | 6972 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
2b4cf991 | 6973 | { |
355fe088 | 6974 | gimple *call = gsi_stmt (gsi); |
2b4cf991 JJ |
6975 | tree decl; |
6976 | ||
726a989a RB |
6977 | if (is_gimple_call (call) |
6978 | && (decl = gimple_call_fndecl (call)) | |
2b4cf991 JJ |
6979 | && DECL_EXTERNAL (decl) |
6980 | && TREE_PUBLIC (decl) | |
6981 | && DECL_INITIAL (decl) == NULL) | |
6982 | { | |
6983 | tree built_in; | |
6984 | ||
6985 | if (DECL_NAME (decl) == thr_num_id) | |
a68ab351 JJ |
6986 | { |
6987 | /* In #pragma omp task untied omp_get_thread_num () can change | |
6988 | during the execution of the task region. */ | |
6989 | if (untied_task) | |
6990 | continue; | |
e79983f4 | 6991 | built_in = builtin_decl_explicit (BUILT_IN_OMP_GET_THREAD_NUM); |
a68ab351 | 6992 | } |
2b4cf991 | 6993 | else if (DECL_NAME (decl) == num_thr_id) |
e79983f4 | 6994 | built_in = builtin_decl_explicit (BUILT_IN_OMP_GET_NUM_THREADS); |
2b4cf991 JJ |
6995 | else |
6996 | continue; | |
6997 | ||
6998 | if (DECL_ASSEMBLER_NAME (decl) != DECL_ASSEMBLER_NAME (built_in) | |
726a989a | 6999 | || gimple_call_num_args (call) != 0) |
2b4cf991 JJ |
7000 | continue; |
7001 | ||
7002 | if (flag_exceptions && !TREE_NOTHROW (decl)) | |
7003 | continue; | |
7004 | ||
7005 | if (TREE_CODE (TREE_TYPE (decl)) != FUNCTION_TYPE | |
9600efe1 MM |
7006 | || !types_compatible_p (TREE_TYPE (TREE_TYPE (decl)), |
7007 | TREE_TYPE (TREE_TYPE (built_in)))) | |
2b4cf991 JJ |
7008 | continue; |
7009 | ||
7c9577be | 7010 | gimple_call_set_fndecl (call, built_in); |
2b4cf991 JJ |
7011 | } |
7012 | } | |
7013 | } | |
7014 | ||
5a0f4dd3 JJ |
7015 | /* Callback for expand_omp_build_assign. Return non-NULL if *tp needs to be |
7016 | regimplified. */ | |
7017 | ||
7018 | static tree | |
7019 | expand_omp_regimplify_p (tree *tp, int *walk_subtrees, void *) | |
7020 | { | |
7021 | tree t = *tp; | |
7022 | ||
7023 | /* Any variable with DECL_VALUE_EXPR needs to be regimplified. */ | |
7024 | if (TREE_CODE (t) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (t)) | |
7025 | return t; | |
7026 | ||
7027 | if (TREE_CODE (t) == ADDR_EXPR) | |
7028 | recompute_tree_invariant_for_addr_expr (t); | |
7029 | ||
7030 | *walk_subtrees = !TYPE_P (t) && !DECL_P (t); | |
7031 | return NULL_TREE; | |
7032 | } | |
7033 | ||
d9a6bd32 | 7034 | /* Prepend or append TO = FROM assignment before or after *GSI_P. */ |
74bf76ed JJ |
7035 | |
7036 | static void | |
d9a6bd32 JJ |
7037 | expand_omp_build_assign (gimple_stmt_iterator *gsi_p, tree to, tree from, |
7038 | bool after) | |
74bf76ed JJ |
7039 | { |
7040 | bool simple_p = DECL_P (to) && TREE_ADDRESSABLE (to); | |
7041 | from = force_gimple_operand_gsi (gsi_p, from, simple_p, NULL_TREE, | |
d9a6bd32 JJ |
7042 | !after, after ? GSI_CONTINUE_LINKING |
7043 | : GSI_SAME_STMT); | |
355fe088 | 7044 | gimple *stmt = gimple_build_assign (to, from); |
d9a6bd32 JJ |
7045 | if (after) |
7046 | gsi_insert_after (gsi_p, stmt, GSI_CONTINUE_LINKING); | |
7047 | else | |
7048 | gsi_insert_before (gsi_p, stmt, GSI_SAME_STMT); | |
74bf76ed JJ |
7049 | if (walk_tree (&from, expand_omp_regimplify_p, NULL, NULL) |
7050 | || walk_tree (&to, expand_omp_regimplify_p, NULL, NULL)) | |
7051 | { | |
7052 | gimple_stmt_iterator gsi = gsi_for_stmt (stmt); | |
7053 | gimple_regimplify_operands (stmt, &gsi); | |
7054 | } | |
7055 | } | |
7056 | ||
a68ab351 | 7057 | /* Expand the OpenMP parallel or task directive starting at REGION. */ |
953ff289 DN |
7058 | |
7059 | static void | |
a68ab351 | 7060 | expand_omp_taskreg (struct omp_region *region) |
953ff289 | 7061 | { |
50674e96 | 7062 | basic_block entry_bb, exit_bb, new_bb; |
db2960f4 | 7063 | struct function *child_cfun; |
3bb06db4 | 7064 | tree child_fn, block, t; |
726a989a | 7065 | gimple_stmt_iterator gsi; |
355fe088 | 7066 | gimple *entry_stmt, *stmt; |
50674e96 | 7067 | edge e; |
9771b263 | 7068 | vec<tree, va_gc> *ws_args; |
50674e96 | 7069 | |
777f7f9a | 7070 | entry_stmt = last_stmt (region->entry); |
726a989a | 7071 | child_fn = gimple_omp_taskreg_child_fn (entry_stmt); |
50674e96 | 7072 | child_cfun = DECL_STRUCT_FUNCTION (child_fn); |
50674e96 | 7073 | |
777f7f9a | 7074 | entry_bb = region->entry; |
b37dddbc JJ |
7075 | if (gimple_code (entry_stmt) == GIMPLE_OMP_TASK) |
7076 | exit_bb = region->cont; | |
7077 | else | |
7078 | exit_bb = region->exit; | |
50674e96 | 7079 | |
9a771876 JJ |
7080 | bool is_cilk_for |
7081 | = (flag_cilkplus | |
7082 | && gimple_code (entry_stmt) == GIMPLE_OMP_PARALLEL | |
7083 | && find_omp_clause (gimple_omp_parallel_clauses (entry_stmt), | |
7084 | OMP_CLAUSE__CILK_FOR_COUNT_) != NULL_TREE); | |
7085 | ||
7086 | if (is_cilk_for) | |
7087 | /* If it is a _Cilk_for statement, it is modelled *like* a parallel for, | |
7088 | and the inner statement contains the name of the built-in function | |
7089 | and grain. */ | |
7090 | ws_args = region->inner->ws_args; | |
7091 | else if (is_combined_parallel (region)) | |
777f7f9a | 7092 | ws_args = region->ws_args; |
50674e96 | 7093 | else |
3bb06db4 | 7094 | ws_args = NULL; |
953ff289 | 7095 | |
777f7f9a | 7096 | if (child_cfun->cfg) |
953ff289 | 7097 | { |
50674e96 DN |
7098 | /* Due to inlining, it may happen that we have already outlined |
7099 | the region, in which case all we need to do is make the | |
7100 | sub-graph unreachable and emit the parallel call. */ | |
7101 | edge entry_succ_e, exit_succ_e; | |
50674e96 DN |
7102 | |
7103 | entry_succ_e = single_succ_edge (entry_bb); | |
50674e96 | 7104 | |
726a989a RB |
7105 | gsi = gsi_last_bb (entry_bb); |
7106 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_PARALLEL | |
7107 | || gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_TASK); | |
7108 | gsi_remove (&gsi, true); | |
50674e96 DN |
7109 | |
7110 | new_bb = entry_bb; | |
d3c673c7 JJ |
7111 | if (exit_bb) |
7112 | { | |
7113 | exit_succ_e = single_succ_edge (exit_bb); | |
7114 | make_edge (new_bb, exit_succ_e->dest, EDGE_FALLTHRU); | |
7115 | } | |
917948d3 | 7116 | remove_edge_and_dominated_blocks (entry_succ_e); |
953ff289 | 7117 | } |
50674e96 DN |
7118 | else |
7119 | { | |
2fed2012 | 7120 | unsigned srcidx, dstidx, num; |
c021f10b | 7121 | |
50674e96 | 7122 | /* If the parallel region needs data sent from the parent |
b570947c JJ |
7123 | function, then the very first statement (except possible |
7124 | tree profile counter updates) of the parallel body | |
50674e96 DN |
7125 | is a copy assignment .OMP_DATA_I = &.OMP_DATA_O. Since |
7126 | &.OMP_DATA_O is passed as an argument to the child function, | |
7127 | we need to replace it with the argument as seen by the child | |
7128 | function. | |
7129 | ||
7130 | In most cases, this will end up being the identity assignment | |
7131 | .OMP_DATA_I = .OMP_DATA_I. However, if the parallel body had | |
7132 | a function call that has been inlined, the original PARM_DECL | |
7133 | .OMP_DATA_I may have been converted into a different local | |
7134 | variable. In which case, we need to keep the assignment. */ | |
726a989a | 7135 | if (gimple_omp_taskreg_data_arg (entry_stmt)) |
50674e96 | 7136 | { |
b37dddbc JJ |
7137 | basic_block entry_succ_bb |
7138 | = single_succ_p (entry_bb) ? single_succ (entry_bb) | |
7139 | : FALLTHRU_EDGE (entry_bb)->dest; | |
2eddac76 | 7140 | tree arg; |
355fe088 | 7141 | gimple *parcopy_stmt = NULL; |
953ff289 | 7142 | |
726a989a | 7143 | for (gsi = gsi_start_bb (entry_succ_bb); ; gsi_next (&gsi)) |
b570947c | 7144 | { |
355fe088 | 7145 | gimple *stmt; |
b570947c | 7146 | |
726a989a RB |
7147 | gcc_assert (!gsi_end_p (gsi)); |
7148 | stmt = gsi_stmt (gsi); | |
7149 | if (gimple_code (stmt) != GIMPLE_ASSIGN) | |
018b899b JJ |
7150 | continue; |
7151 | ||
726a989a | 7152 | if (gimple_num_ops (stmt) == 2) |
b570947c | 7153 | { |
726a989a RB |
7154 | tree arg = gimple_assign_rhs1 (stmt); |
7155 | ||
7156 | /* We're ignore the subcode because we're | |
7157 | effectively doing a STRIP_NOPS. */ | |
7158 | ||
7159 | if (TREE_CODE (arg) == ADDR_EXPR | |
7160 | && TREE_OPERAND (arg, 0) | |
7161 | == gimple_omp_taskreg_data_arg (entry_stmt)) | |
7162 | { | |
7163 | parcopy_stmt = stmt; | |
7164 | break; | |
7165 | } | |
b570947c JJ |
7166 | } |
7167 | } | |
917948d3 | 7168 | |
726a989a | 7169 | gcc_assert (parcopy_stmt != NULL); |
917948d3 ZD |
7170 | arg = DECL_ARGUMENTS (child_fn); |
7171 | ||
7172 | if (!gimple_in_ssa_p (cfun)) | |
7173 | { | |
726a989a RB |
7174 | if (gimple_assign_lhs (parcopy_stmt) == arg) |
7175 | gsi_remove (&gsi, true); | |
917948d3 | 7176 | else |
726a989a RB |
7177 | { |
7178 | /* ?? Is setting the subcode really necessary ?? */ | |
7179 | gimple_omp_set_subcode (parcopy_stmt, TREE_CODE (arg)); | |
7180 | gimple_assign_set_rhs1 (parcopy_stmt, arg); | |
7181 | } | |
917948d3 ZD |
7182 | } |
7183 | else | |
7184 | { | |
2eddac76 TV |
7185 | tree lhs = gimple_assign_lhs (parcopy_stmt); |
7186 | gcc_assert (SSA_NAME_VAR (lhs) == arg); | |
7187 | /* We'd like to set the rhs to the default def in the child_fn, | |
7188 | but it's too early to create ssa names in the child_fn. | |
7189 | Instead, we set the rhs to the parm. In | |
7190 | move_sese_region_to_fn, we introduce a default def for the | |
7191 | parm, map the parm to it's default def, and once we encounter | |
7192 | this stmt, replace the parm with the default def. */ | |
7193 | gimple_assign_set_rhs1 (parcopy_stmt, arg); | |
917948d3 ZD |
7194 | update_stmt (parcopy_stmt); |
7195 | } | |
50674e96 DN |
7196 | } |
7197 | ||
7198 | /* Declare local variables needed in CHILD_CFUN. */ | |
7199 | block = DECL_INITIAL (child_fn); | |
c021f10b | 7200 | BLOCK_VARS (block) = vec2chain (child_cfun->local_decls); |
4f0ae266 JJ |
7201 | /* The gimplifier could record temporaries in parallel/task block |
7202 | rather than in containing function's local_decls chain, | |
7203 | which would mean cgraph missed finalizing them. Do it now. */ | |
910ad8de | 7204 | for (t = BLOCK_VARS (block); t; t = DECL_CHAIN (t)) |
4f0ae266 JJ |
7205 | if (TREE_CODE (t) == VAR_DECL |
7206 | && TREE_STATIC (t) | |
7207 | && !DECL_EXTERNAL (t)) | |
9041d2e6 | 7208 | varpool_node::finalize_decl (t); |
726a989a | 7209 | DECL_SAVED_TREE (child_fn) = NULL; |
355a7673 MM |
7210 | /* We'll create a CFG for child_fn, so no gimple body is needed. */ |
7211 | gimple_set_body (child_fn, NULL); | |
b357f682 | 7212 | TREE_USED (block) = 1; |
50674e96 | 7213 | |
917948d3 | 7214 | /* Reset DECL_CONTEXT on function arguments. */ |
910ad8de | 7215 | for (t = DECL_ARGUMENTS (child_fn); t; t = DECL_CHAIN (t)) |
50674e96 DN |
7216 | DECL_CONTEXT (t) = child_fn; |
7217 | ||
726a989a RB |
7218 | /* Split ENTRY_BB at GIMPLE_OMP_PARALLEL or GIMPLE_OMP_TASK, |
7219 | so that it can be moved to the child function. */ | |
7220 | gsi = gsi_last_bb (entry_bb); | |
7221 | stmt = gsi_stmt (gsi); | |
7222 | gcc_assert (stmt && (gimple_code (stmt) == GIMPLE_OMP_PARALLEL | |
7223 | || gimple_code (stmt) == GIMPLE_OMP_TASK)); | |
726a989a | 7224 | e = split_block (entry_bb, stmt); |
b13c907a | 7225 | gsi_remove (&gsi, true); |
50674e96 | 7226 | entry_bb = e->dest; |
b37dddbc JJ |
7227 | edge e2 = NULL; |
7228 | if (gimple_code (entry_stmt) == GIMPLE_OMP_PARALLEL) | |
7229 | single_succ_edge (entry_bb)->flags = EDGE_FALLTHRU; | |
7230 | else | |
7231 | { | |
7232 | e2 = make_edge (e->src, BRANCH_EDGE (entry_bb)->dest, EDGE_ABNORMAL); | |
7233 | gcc_assert (e2->dest == region->exit); | |
7234 | remove_edge (BRANCH_EDGE (entry_bb)); | |
7235 | set_immediate_dominator (CDI_DOMINATORS, e2->dest, e->src); | |
7236 | gsi = gsi_last_bb (region->exit); | |
7237 | gcc_assert (!gsi_end_p (gsi) | |
7238 | && gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_RETURN); | |
7239 | gsi_remove (&gsi, true); | |
7240 | } | |
50674e96 | 7241 | |
b37dddbc | 7242 | /* Convert GIMPLE_OMP_{RETURN,CONTINUE} into a RETURN_EXPR. */ |
2aee3e57 JJ |
7243 | if (exit_bb) |
7244 | { | |
726a989a RB |
7245 | gsi = gsi_last_bb (exit_bb); |
7246 | gcc_assert (!gsi_end_p (gsi) | |
b37dddbc JJ |
7247 | && (gimple_code (gsi_stmt (gsi)) |
7248 | == (e2 ? GIMPLE_OMP_CONTINUE : GIMPLE_OMP_RETURN))); | |
726a989a RB |
7249 | stmt = gimple_build_return (NULL); |
7250 | gsi_insert_after (&gsi, stmt, GSI_SAME_STMT); | |
7251 | gsi_remove (&gsi, true); | |
2aee3e57 | 7252 | } |
917948d3 ZD |
7253 | |
7254 | /* Move the parallel region into CHILD_CFUN. */ | |
b8698a0f | 7255 | |
917948d3 ZD |
7256 | if (gimple_in_ssa_p (cfun)) |
7257 | { | |
5db9ba0c | 7258 | init_tree_ssa (child_cfun); |
3828719a RG |
7259 | init_ssa_operands (child_cfun); |
7260 | child_cfun->gimple_df->in_ssa_p = true; | |
b357f682 | 7261 | block = NULL_TREE; |
917948d3 | 7262 | } |
b357f682 | 7263 | else |
726a989a | 7264 | block = gimple_block (entry_stmt); |
b357f682 JJ |
7265 | |
7266 | new_bb = move_sese_region_to_fn (child_cfun, entry_bb, exit_bb, block); | |
917948d3 ZD |
7267 | if (exit_bb) |
7268 | single_succ_edge (new_bb)->flags = EDGE_FALLTHRU; | |
b37dddbc JJ |
7269 | if (e2) |
7270 | { | |
7271 | basic_block dest_bb = e2->dest; | |
7272 | if (!exit_bb) | |
7273 | make_edge (new_bb, dest_bb, EDGE_FALLTHRU); | |
7274 | remove_edge (e2); | |
7275 | set_immediate_dominator (CDI_DOMINATORS, dest_bb, new_bb); | |
7276 | } | |
6093bc06 RB |
7277 | /* When the OMP expansion process cannot guarantee an up-to-date |
7278 | loop tree arrange for the child function to fixup loops. */ | |
7279 | if (loops_state_satisfies_p (LOOPS_NEED_FIXUP)) | |
7280 | child_cfun->x_current_loops->state |= LOOPS_NEED_FIXUP; | |
917948d3 | 7281 | |
b357f682 | 7282 | /* Remove non-local VAR_DECLs from child_cfun->local_decls list. */ |
9771b263 | 7283 | num = vec_safe_length (child_cfun->local_decls); |
2fed2012 JJ |
7284 | for (srcidx = 0, dstidx = 0; srcidx < num; srcidx++) |
7285 | { | |
9771b263 | 7286 | t = (*child_cfun->local_decls)[srcidx]; |
2fed2012 JJ |
7287 | if (DECL_CONTEXT (t) == cfun->decl) |
7288 | continue; | |
7289 | if (srcidx != dstidx) | |
9771b263 | 7290 | (*child_cfun->local_decls)[dstidx] = t; |
2fed2012 JJ |
7291 | dstidx++; |
7292 | } | |
7293 | if (dstidx != num) | |
9771b263 | 7294 | vec_safe_truncate (child_cfun->local_decls, dstidx); |
b357f682 | 7295 | |
917948d3 | 7296 | /* Inform the callgraph about the new function. */ |
8c8b9f32 JJ |
7297 | child_cfun->curr_properties = cfun->curr_properties; |
7298 | child_cfun->has_simduid_loops |= cfun->has_simduid_loops; | |
7299 | child_cfun->has_force_vectorize_loops |= cfun->has_force_vectorize_loops; | |
edafad14 TV |
7300 | cgraph_node *node = cgraph_node::get_create (child_fn); |
7301 | node->parallelized_function = 1; | |
d52f5295 | 7302 | cgraph_node::add_new_function (child_fn, true); |
917948d3 | 7303 | |
e01d41e5 JJ |
7304 | bool need_asm = DECL_ASSEMBLER_NAME_SET_P (current_function_decl) |
7305 | && !DECL_ASSEMBLER_NAME_SET_P (child_fn); | |
7306 | ||
917948d3 ZD |
7307 | /* Fix the callgraph edges for child_cfun. Those for cfun will be |
7308 | fixed in a following pass. */ | |
7309 | push_cfun (child_cfun); | |
e01d41e5 JJ |
7310 | if (need_asm) |
7311 | assign_assembler_name_if_neeeded (child_fn); | |
7312 | ||
2b4cf991 | 7313 | if (optimize) |
a68ab351 | 7314 | optimize_omp_library_calls (entry_stmt); |
3dafb85c | 7315 | cgraph_edge::rebuild_edges (); |
99819c63 JJ |
7316 | |
7317 | /* Some EH regions might become dead, see PR34608. If | |
7318 | pass_cleanup_cfg isn't the first pass to happen with the | |
7319 | new child, these dead EH edges might cause problems. | |
7320 | Clean them up now. */ | |
7321 | if (flag_exceptions) | |
7322 | { | |
7323 | basic_block bb; | |
99819c63 JJ |
7324 | bool changed = false; |
7325 | ||
11cd3bed | 7326 | FOR_EACH_BB_FN (bb, cfun) |
726a989a | 7327 | changed |= gimple_purge_dead_eh_edges (bb); |
99819c63 JJ |
7328 | if (changed) |
7329 | cleanup_tree_cfg (); | |
99819c63 | 7330 | } |
5006671f RG |
7331 | if (gimple_in_ssa_p (cfun)) |
7332 | update_ssa (TODO_update_ssa); | |
b2b29377 | 7333 | if (flag_checking && !loops_state_satisfies_p (LOOPS_NEED_FIXUP)) |
e67d7a1e | 7334 | verify_loop_structure (); |
917948d3 | 7335 | pop_cfun (); |
e01d41e5 JJ |
7336 | |
7337 | if (dump_file && !gimple_in_ssa_p (cfun)) | |
7338 | { | |
7339 | omp_any_child_fn_dumped = true; | |
7340 | dump_function_header (dump_file, child_fn, dump_flags); | |
7341 | dump_function_to_file (child_fn, dump_file, dump_flags); | |
7342 | } | |
50674e96 | 7343 | } |
b8698a0f | 7344 | |
50674e96 | 7345 | /* Emit a library call to launch the children threads. */ |
9a771876 | 7346 | if (is_cilk_for) |
538dd0b7 DM |
7347 | expand_cilk_for_call (new_bb, |
7348 | as_a <gomp_parallel *> (entry_stmt), ws_args); | |
9a771876 | 7349 | else if (gimple_code (entry_stmt) == GIMPLE_OMP_PARALLEL) |
538dd0b7 DM |
7350 | expand_parallel_call (region, new_bb, |
7351 | as_a <gomp_parallel *> (entry_stmt), ws_args); | |
a68ab351 | 7352 | else |
d9a6bd32 | 7353 | expand_task_call (region, new_bb, as_a <gomp_task *> (entry_stmt)); |
a5efada7 RG |
7354 | if (gimple_in_ssa_p (cfun)) |
7355 | update_ssa (TODO_update_ssa_only_virtuals); | |
953ff289 DN |
7356 | } |
7357 | ||
e4834818 NS |
7358 | /* Information about members of an OpenACC collapsed loop nest. */ |
7359 | ||
7360 | struct oacc_collapse | |
7361 | { | |
7362 | tree base; /* Base value. */ | |
7363 | tree iters; /* Number of steps. */ | |
7364 | tree step; /* step size. */ | |
7365 | }; | |
7366 | ||
7367 | /* Helper for expand_oacc_for. Determine collapsed loop information. | |
7368 | Fill in COUNTS array. Emit any initialization code before GSI. | |
7369 | Return the calculated outer loop bound of BOUND_TYPE. */ | |
7370 | ||
7371 | static tree | |
7372 | expand_oacc_collapse_init (const struct omp_for_data *fd, | |
7373 | gimple_stmt_iterator *gsi, | |
7374 | oacc_collapse *counts, tree bound_type) | |
7375 | { | |
7376 | tree total = build_int_cst (bound_type, 1); | |
7377 | int ix; | |
7378 | ||
7379 | gcc_assert (integer_onep (fd->loop.step)); | |
7380 | gcc_assert (integer_zerop (fd->loop.n1)); | |
7381 | ||
7382 | for (ix = 0; ix != fd->collapse; ix++) | |
7383 | { | |
7384 | const omp_for_data_loop *loop = &fd->loops[ix]; | |
7385 | ||
7386 | tree iter_type = TREE_TYPE (loop->v); | |
7387 | tree diff_type = iter_type; | |
7388 | tree plus_type = iter_type; | |
7389 | ||
7390 | gcc_assert (loop->cond_code == fd->loop.cond_code); | |
7391 | ||
7392 | if (POINTER_TYPE_P (iter_type)) | |
7393 | plus_type = sizetype; | |
7394 | if (POINTER_TYPE_P (diff_type) || TYPE_UNSIGNED (diff_type)) | |
7395 | diff_type = signed_type_for (diff_type); | |
7396 | ||
7397 | tree b = loop->n1; | |
7398 | tree e = loop->n2; | |
7399 | tree s = loop->step; | |
7400 | bool up = loop->cond_code == LT_EXPR; | |
7401 | tree dir = build_int_cst (diff_type, up ? +1 : -1); | |
7402 | bool negating; | |
7403 | tree expr; | |
7404 | ||
7405 | b = force_gimple_operand_gsi (gsi, b, true, NULL_TREE, | |
7406 | true, GSI_SAME_STMT); | |
7407 | e = force_gimple_operand_gsi (gsi, e, true, NULL_TREE, | |
7408 | true, GSI_SAME_STMT); | |
7409 | ||
7410 | /* Convert the step, avoiding possible unsigned->signed overflow. */ | |
7411 | negating = !up && TYPE_UNSIGNED (TREE_TYPE (s)); | |
7412 | if (negating) | |
7413 | s = fold_build1 (NEGATE_EXPR, TREE_TYPE (s), s); | |
7414 | s = fold_convert (diff_type, s); | |
7415 | if (negating) | |
7416 | s = fold_build1 (NEGATE_EXPR, diff_type, s); | |
7417 | s = force_gimple_operand_gsi (gsi, s, true, NULL_TREE, | |
7418 | true, GSI_SAME_STMT); | |
7419 | ||
7420 | /* Determine the range, avoiding possible unsigned->signed overflow. */ | |
7421 | negating = !up && TYPE_UNSIGNED (iter_type); | |
7422 | expr = fold_build2 (MINUS_EXPR, plus_type, | |
7423 | fold_convert (plus_type, negating ? b : e), | |
7424 | fold_convert (plus_type, negating ? e : b)); | |
7425 | expr = fold_convert (diff_type, expr); | |
7426 | if (negating) | |
7427 | expr = fold_build1 (NEGATE_EXPR, diff_type, expr); | |
7428 | tree range = force_gimple_operand_gsi | |
7429 | (gsi, expr, true, NULL_TREE, true, GSI_SAME_STMT); | |
7430 | ||
7431 | /* Determine number of iterations. */ | |
7432 | expr = fold_build2 (MINUS_EXPR, diff_type, range, dir); | |
7433 | expr = fold_build2 (PLUS_EXPR, diff_type, expr, s); | |
7434 | expr = fold_build2 (TRUNC_DIV_EXPR, diff_type, expr, s); | |
7435 | ||
7436 | tree iters = force_gimple_operand_gsi (gsi, expr, true, NULL_TREE, | |
7437 | true, GSI_SAME_STMT); | |
7438 | ||
7439 | counts[ix].base = b; | |
7440 | counts[ix].iters = iters; | |
7441 | counts[ix].step = s; | |
7442 | ||
7443 | total = fold_build2 (MULT_EXPR, bound_type, total, | |
7444 | fold_convert (bound_type, iters)); | |
7445 | } | |
7446 | ||
7447 | return total; | |
7448 | } | |
7449 | ||
7450 | /* Emit initializers for collapsed loop members. IVAR is the outer | |
7451 | loop iteration variable, from which collapsed loop iteration values | |
7452 | are calculated. COUNTS array has been initialized by | |
7453 | expand_oacc_collapse_inits. */ | |
7454 | ||
7455 | static void | |
7456 | expand_oacc_collapse_vars (const struct omp_for_data *fd, | |
7457 | gimple_stmt_iterator *gsi, | |
7458 | const oacc_collapse *counts, tree ivar) | |
7459 | { | |
7460 | tree ivar_type = TREE_TYPE (ivar); | |
7461 | ||
7462 | /* The most rapidly changing iteration variable is the innermost | |
7463 | one. */ | |
7464 | for (int ix = fd->collapse; ix--;) | |
7465 | { | |
7466 | const omp_for_data_loop *loop = &fd->loops[ix]; | |
7467 | const oacc_collapse *collapse = &counts[ix]; | |
7468 | tree iter_type = TREE_TYPE (loop->v); | |
7469 | tree diff_type = TREE_TYPE (collapse->step); | |
7470 | tree plus_type = iter_type; | |
7471 | enum tree_code plus_code = PLUS_EXPR; | |
7472 | tree expr; | |
7473 | ||
7474 | if (POINTER_TYPE_P (iter_type)) | |
7475 | { | |
7476 | plus_code = POINTER_PLUS_EXPR; | |
7477 | plus_type = sizetype; | |
7478 | } | |
7479 | ||
7480 | expr = fold_build2 (TRUNC_MOD_EXPR, ivar_type, ivar, | |
7481 | fold_convert (ivar_type, collapse->iters)); | |
7482 | expr = fold_build2 (MULT_EXPR, diff_type, fold_convert (diff_type, expr), | |
7483 | collapse->step); | |
7484 | expr = fold_build2 (plus_code, iter_type, collapse->base, | |
7485 | fold_convert (plus_type, expr)); | |
7486 | expr = force_gimple_operand_gsi (gsi, expr, false, NULL_TREE, | |
7487 | true, GSI_SAME_STMT); | |
7488 | gassign *ass = gimple_build_assign (loop->v, expr); | |
7489 | gsi_insert_before (gsi, ass, GSI_SAME_STMT); | |
7490 | ||
7491 | if (ix) | |
7492 | { | |
7493 | expr = fold_build2 (TRUNC_DIV_EXPR, ivar_type, ivar, | |
7494 | fold_convert (ivar_type, collapse->iters)); | |
7495 | ivar = force_gimple_operand_gsi (gsi, expr, true, NULL_TREE, | |
7496 | true, GSI_SAME_STMT); | |
7497 | } | |
7498 | } | |
7499 | } | |
7500 | ||
50674e96 | 7501 | |
74bf76ed JJ |
7502 | /* Helper function for expand_omp_{for_*,simd}. If this is the outermost |
7503 | of the combined collapse > 1 loop constructs, generate code like: | |
7504 | if (__builtin_expect (N32 cond3 N31, 0)) goto ZERO_ITER_BB; | |
7505 | if (cond3 is <) | |
7506 | adj = STEP3 - 1; | |
7507 | else | |
7508 | adj = STEP3 + 1; | |
7509 | count3 = (adj + N32 - N31) / STEP3; | |
7510 | if (__builtin_expect (N22 cond2 N21, 0)) goto ZERO_ITER_BB; | |
7511 | if (cond2 is <) | |
7512 | adj = STEP2 - 1; | |
7513 | else | |
7514 | adj = STEP2 + 1; | |
7515 | count2 = (adj + N22 - N21) / STEP2; | |
7516 | if (__builtin_expect (N12 cond1 N11, 0)) goto ZERO_ITER_BB; | |
7517 | if (cond1 is <) | |
7518 | adj = STEP1 - 1; | |
7519 | else | |
7520 | adj = STEP1 + 1; | |
7521 | count1 = (adj + N12 - N11) / STEP1; | |
7522 | count = count1 * count2 * count3; | |
7523 | Furthermore, if ZERO_ITER_BB is NULL, create a BB which does: | |
7524 | count = 0; | |
acf0174b JJ |
7525 | and set ZERO_ITER_BB to that bb. If this isn't the outermost |
7526 | of the combined loop constructs, just initialize COUNTS array | |
7527 | from the _looptemp_ clauses. */ | |
74bf76ed JJ |
7528 | |
7529 | /* NOTE: It *could* be better to moosh all of the BBs together, | |
7530 | creating one larger BB with all the computation and the unexpected | |
7531 | jump at the end. I.e. | |
7532 | ||
7533 | bool zero3, zero2, zero1, zero; | |
7534 | ||
7535 | zero3 = N32 c3 N31; | |
7536 | count3 = (N32 - N31) /[cl] STEP3; | |
7537 | zero2 = N22 c2 N21; | |
7538 | count2 = (N22 - N21) /[cl] STEP2; | |
7539 | zero1 = N12 c1 N11; | |
7540 | count1 = (N12 - N11) /[cl] STEP1; | |
7541 | zero = zero3 || zero2 || zero1; | |
7542 | count = count1 * count2 * count3; | |
7543 | if (__builtin_expect(zero, false)) goto zero_iter_bb; | |
7544 | ||
7545 | After all, we expect the zero=false, and thus we expect to have to | |
7546 | evaluate all of the comparison expressions, so short-circuiting | |
7547 | oughtn't be a win. Since the condition isn't protecting a | |
7548 | denominator, we're not concerned about divide-by-zero, so we can | |
7549 | fully evaluate count even if a numerator turned out to be wrong. | |
7550 | ||
7551 | It seems like putting this all together would create much better | |
7552 | scheduling opportunities, and less pressure on the chip's branch | |
7553 | predictor. */ | |
7554 | ||
7555 | static void | |
7556 | expand_omp_for_init_counts (struct omp_for_data *fd, gimple_stmt_iterator *gsi, | |
7557 | basic_block &entry_bb, tree *counts, | |
d9a6bd32 JJ |
7558 | basic_block &zero_iter1_bb, int &first_zero_iter1, |
7559 | basic_block &zero_iter2_bb, int &first_zero_iter2, | |
74bf76ed JJ |
7560 | basic_block &l2_dom_bb) |
7561 | { | |
7562 | tree t, type = TREE_TYPE (fd->loop.v); | |
74bf76ed JJ |
7563 | edge e, ne; |
7564 | int i; | |
7565 | ||
7566 | /* Collapsed loops need work for expansion into SSA form. */ | |
7567 | gcc_assert (!gimple_in_ssa_p (cfun)); | |
7568 | ||
acf0174b JJ |
7569 | if (gimple_omp_for_combined_into_p (fd->for_stmt) |
7570 | && TREE_CODE (fd->loop.n2) != INTEGER_CST) | |
7571 | { | |
d9a6bd32 | 7572 | gcc_assert (fd->ordered == 0); |
acf0174b JJ |
7573 | /* First two _looptemp_ clauses are for istart/iend, counts[0] |
7574 | isn't supposed to be handled, as the inner loop doesn't | |
7575 | use it. */ | |
7576 | tree innerc = find_omp_clause (gimple_omp_for_clauses (fd->for_stmt), | |
7577 | OMP_CLAUSE__LOOPTEMP_); | |
7578 | gcc_assert (innerc); | |
7579 | for (i = 0; i < fd->collapse; i++) | |
7580 | { | |
7581 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
7582 | OMP_CLAUSE__LOOPTEMP_); | |
7583 | gcc_assert (innerc); | |
7584 | if (i) | |
7585 | counts[i] = OMP_CLAUSE_DECL (innerc); | |
7586 | else | |
7587 | counts[0] = NULL_TREE; | |
7588 | } | |
7589 | return; | |
7590 | } | |
7591 | ||
d9a6bd32 JJ |
7592 | for (i = fd->collapse; i < fd->ordered; i++) |
7593 | { | |
7594 | tree itype = TREE_TYPE (fd->loops[i].v); | |
7595 | counts[i] = NULL_TREE; | |
7596 | t = fold_binary (fd->loops[i].cond_code, boolean_type_node, | |
7597 | fold_convert (itype, fd->loops[i].n1), | |
7598 | fold_convert (itype, fd->loops[i].n2)); | |
7599 | if (t && integer_zerop (t)) | |
7600 | { | |
7601 | for (i = fd->collapse; i < fd->ordered; i++) | |
7602 | counts[i] = build_int_cst (type, 0); | |
7603 | break; | |
7604 | } | |
7605 | } | |
7606 | for (i = 0; i < (fd->ordered ? fd->ordered : fd->collapse); i++) | |
74bf76ed JJ |
7607 | { |
7608 | tree itype = TREE_TYPE (fd->loops[i].v); | |
7609 | ||
d9a6bd32 JJ |
7610 | if (i >= fd->collapse && counts[i]) |
7611 | continue; | |
7612 | if ((SSA_VAR_P (fd->loop.n2) || i >= fd->collapse) | |
74bf76ed JJ |
7613 | && ((t = fold_binary (fd->loops[i].cond_code, boolean_type_node, |
7614 | fold_convert (itype, fd->loops[i].n1), | |
7615 | fold_convert (itype, fd->loops[i].n2))) | |
7616 | == NULL_TREE || !integer_onep (t))) | |
7617 | { | |
538dd0b7 | 7618 | gcond *cond_stmt; |
74bf76ed JJ |
7619 | tree n1, n2; |
7620 | n1 = fold_convert (itype, unshare_expr (fd->loops[i].n1)); | |
7621 | n1 = force_gimple_operand_gsi (gsi, n1, true, NULL_TREE, | |
7622 | true, GSI_SAME_STMT); | |
7623 | n2 = fold_convert (itype, unshare_expr (fd->loops[i].n2)); | |
7624 | n2 = force_gimple_operand_gsi (gsi, n2, true, NULL_TREE, | |
7625 | true, GSI_SAME_STMT); | |
538dd0b7 DM |
7626 | cond_stmt = gimple_build_cond (fd->loops[i].cond_code, n1, n2, |
7627 | NULL_TREE, NULL_TREE); | |
7628 | gsi_insert_before (gsi, cond_stmt, GSI_SAME_STMT); | |
7629 | if (walk_tree (gimple_cond_lhs_ptr (cond_stmt), | |
74bf76ed | 7630 | expand_omp_regimplify_p, NULL, NULL) |
538dd0b7 | 7631 | || walk_tree (gimple_cond_rhs_ptr (cond_stmt), |
74bf76ed JJ |
7632 | expand_omp_regimplify_p, NULL, NULL)) |
7633 | { | |
538dd0b7 DM |
7634 | *gsi = gsi_for_stmt (cond_stmt); |
7635 | gimple_regimplify_operands (cond_stmt, gsi); | |
74bf76ed | 7636 | } |
538dd0b7 | 7637 | e = split_block (entry_bb, cond_stmt); |
d9a6bd32 JJ |
7638 | basic_block &zero_iter_bb |
7639 | = i < fd->collapse ? zero_iter1_bb : zero_iter2_bb; | |
7640 | int &first_zero_iter | |
7641 | = i < fd->collapse ? first_zero_iter1 : first_zero_iter2; | |
74bf76ed JJ |
7642 | if (zero_iter_bb == NULL) |
7643 | { | |
538dd0b7 | 7644 | gassign *assign_stmt; |
74bf76ed JJ |
7645 | first_zero_iter = i; |
7646 | zero_iter_bb = create_empty_bb (entry_bb); | |
726338f4 | 7647 | add_bb_to_loop (zero_iter_bb, entry_bb->loop_father); |
74bf76ed | 7648 | *gsi = gsi_after_labels (zero_iter_bb); |
d9a6bd32 JJ |
7649 | if (i < fd->collapse) |
7650 | assign_stmt = gimple_build_assign (fd->loop.n2, | |
7651 | build_zero_cst (type)); | |
7652 | else | |
7653 | { | |
7654 | counts[i] = create_tmp_reg (type, ".count"); | |
7655 | assign_stmt | |
7656 | = gimple_build_assign (counts[i], build_zero_cst (type)); | |
7657 | } | |
538dd0b7 | 7658 | gsi_insert_before (gsi, assign_stmt, GSI_SAME_STMT); |
74bf76ed JJ |
7659 | set_immediate_dominator (CDI_DOMINATORS, zero_iter_bb, |
7660 | entry_bb); | |
7661 | } | |
7662 | ne = make_edge (entry_bb, zero_iter_bb, EDGE_FALSE_VALUE); | |
7663 | ne->probability = REG_BR_PROB_BASE / 2000 - 1; | |
7664 | e->flags = EDGE_TRUE_VALUE; | |
7665 | e->probability = REG_BR_PROB_BASE - ne->probability; | |
7666 | if (l2_dom_bb == NULL) | |
7667 | l2_dom_bb = entry_bb; | |
7668 | entry_bb = e->dest; | |
7669 | *gsi = gsi_last_bb (entry_bb); | |
7670 | } | |
7671 | ||
7672 | if (POINTER_TYPE_P (itype)) | |
7673 | itype = signed_type_for (itype); | |
7674 | t = build_int_cst (itype, (fd->loops[i].cond_code == LT_EXPR | |
7675 | ? -1 : 1)); | |
7676 | t = fold_build2 (PLUS_EXPR, itype, | |
7677 | fold_convert (itype, fd->loops[i].step), t); | |
7678 | t = fold_build2 (PLUS_EXPR, itype, t, | |
7679 | fold_convert (itype, fd->loops[i].n2)); | |
7680 | t = fold_build2 (MINUS_EXPR, itype, t, | |
7681 | fold_convert (itype, fd->loops[i].n1)); | |
7682 | /* ?? We could probably use CEIL_DIV_EXPR instead of | |
7683 | TRUNC_DIV_EXPR and adjusting by hand. Unless we can't | |
7684 | generate the same code in the end because generically we | |
7685 | don't know that the values involved must be negative for | |
7686 | GT?? */ | |
7687 | if (TYPE_UNSIGNED (itype) && fd->loops[i].cond_code == GT_EXPR) | |
7688 | t = fold_build2 (TRUNC_DIV_EXPR, itype, | |
7689 | fold_build1 (NEGATE_EXPR, itype, t), | |
7690 | fold_build1 (NEGATE_EXPR, itype, | |
7691 | fold_convert (itype, | |
7692 | fd->loops[i].step))); | |
7693 | else | |
7694 | t = fold_build2 (TRUNC_DIV_EXPR, itype, t, | |
7695 | fold_convert (itype, fd->loops[i].step)); | |
7696 | t = fold_convert (type, t); | |
7697 | if (TREE_CODE (t) == INTEGER_CST) | |
7698 | counts[i] = t; | |
7699 | else | |
7700 | { | |
d9a6bd32 JJ |
7701 | if (i < fd->collapse || i != first_zero_iter2) |
7702 | counts[i] = create_tmp_reg (type, ".count"); | |
74bf76ed JJ |
7703 | expand_omp_build_assign (gsi, counts[i], t); |
7704 | } | |
d9a6bd32 | 7705 | if (SSA_VAR_P (fd->loop.n2) && i < fd->collapse) |
74bf76ed JJ |
7706 | { |
7707 | if (i == 0) | |
7708 | t = counts[0]; | |
7709 | else | |
7710 | t = fold_build2 (MULT_EXPR, type, fd->loop.n2, counts[i]); | |
7711 | expand_omp_build_assign (gsi, fd->loop.n2, t); | |
7712 | } | |
7713 | } | |
7714 | } | |
7715 | ||
7716 | ||
7717 | /* Helper function for expand_omp_{for_*,simd}. Generate code like: | |
7718 | T = V; | |
7719 | V3 = N31 + (T % count3) * STEP3; | |
7720 | T = T / count3; | |
7721 | V2 = N21 + (T % count2) * STEP2; | |
7722 | T = T / count2; | |
7723 | V1 = N11 + T * STEP1; | |
acf0174b JJ |
7724 | if this loop doesn't have an inner loop construct combined with it. |
7725 | If it does have an inner loop construct combined with it and the | |
7726 | iteration count isn't known constant, store values from counts array | |
7727 | into its _looptemp_ temporaries instead. */ | |
74bf76ed JJ |
7728 | |
7729 | static void | |
7730 | expand_omp_for_init_vars (struct omp_for_data *fd, gimple_stmt_iterator *gsi, | |
355fe088 | 7731 | tree *counts, gimple *inner_stmt, tree startvar) |
74bf76ed JJ |
7732 | { |
7733 | int i; | |
acf0174b JJ |
7734 | if (gimple_omp_for_combined_p (fd->for_stmt)) |
7735 | { | |
7736 | /* If fd->loop.n2 is constant, then no propagation of the counts | |
7737 | is needed, they are constant. */ | |
7738 | if (TREE_CODE (fd->loop.n2) == INTEGER_CST) | |
7739 | return; | |
7740 | ||
d9a6bd32 JJ |
7741 | tree clauses = gimple_code (inner_stmt) != GIMPLE_OMP_FOR |
7742 | ? gimple_omp_taskreg_clauses (inner_stmt) | |
acf0174b JJ |
7743 | : gimple_omp_for_clauses (inner_stmt); |
7744 | /* First two _looptemp_ clauses are for istart/iend, counts[0] | |
7745 | isn't supposed to be handled, as the inner loop doesn't | |
7746 | use it. */ | |
7747 | tree innerc = find_omp_clause (clauses, OMP_CLAUSE__LOOPTEMP_); | |
7748 | gcc_assert (innerc); | |
7749 | for (i = 0; i < fd->collapse; i++) | |
7750 | { | |
7751 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
7752 | OMP_CLAUSE__LOOPTEMP_); | |
7753 | gcc_assert (innerc); | |
7754 | if (i) | |
7755 | { | |
7756 | tree tem = OMP_CLAUSE_DECL (innerc); | |
7757 | tree t = fold_convert (TREE_TYPE (tem), counts[i]); | |
7758 | t = force_gimple_operand_gsi (gsi, t, false, NULL_TREE, | |
7759 | false, GSI_CONTINUE_LINKING); | |
538dd0b7 | 7760 | gassign *stmt = gimple_build_assign (tem, t); |
acf0174b JJ |
7761 | gsi_insert_after (gsi, stmt, GSI_CONTINUE_LINKING); |
7762 | } | |
7763 | } | |
7764 | return; | |
7765 | } | |
7766 | ||
74bf76ed JJ |
7767 | tree type = TREE_TYPE (fd->loop.v); |
7768 | tree tem = create_tmp_reg (type, ".tem"); | |
538dd0b7 | 7769 | gassign *stmt = gimple_build_assign (tem, startvar); |
74bf76ed JJ |
7770 | gsi_insert_after (gsi, stmt, GSI_CONTINUE_LINKING); |
7771 | ||
7772 | for (i = fd->collapse - 1; i >= 0; i--) | |
7773 | { | |
7774 | tree vtype = TREE_TYPE (fd->loops[i].v), itype, t; | |
7775 | itype = vtype; | |
7776 | if (POINTER_TYPE_P (vtype)) | |
7777 | itype = signed_type_for (vtype); | |
7778 | if (i != 0) | |
7779 | t = fold_build2 (TRUNC_MOD_EXPR, type, tem, counts[i]); | |
7780 | else | |
7781 | t = tem; | |
7782 | t = fold_convert (itype, t); | |
7783 | t = fold_build2 (MULT_EXPR, itype, t, | |
7784 | fold_convert (itype, fd->loops[i].step)); | |
7785 | if (POINTER_TYPE_P (vtype)) | |
7786 | t = fold_build_pointer_plus (fd->loops[i].n1, t); | |
7787 | else | |
7788 | t = fold_build2 (PLUS_EXPR, itype, fd->loops[i].n1, t); | |
7789 | t = force_gimple_operand_gsi (gsi, t, | |
7790 | DECL_P (fd->loops[i].v) | |
7791 | && TREE_ADDRESSABLE (fd->loops[i].v), | |
7792 | NULL_TREE, false, | |
7793 | GSI_CONTINUE_LINKING); | |
7794 | stmt = gimple_build_assign (fd->loops[i].v, t); | |
7795 | gsi_insert_after (gsi, stmt, GSI_CONTINUE_LINKING); | |
7796 | if (i != 0) | |
7797 | { | |
7798 | t = fold_build2 (TRUNC_DIV_EXPR, type, tem, counts[i]); | |
7799 | t = force_gimple_operand_gsi (gsi, t, false, NULL_TREE, | |
7800 | false, GSI_CONTINUE_LINKING); | |
7801 | stmt = gimple_build_assign (tem, t); | |
7802 | gsi_insert_after (gsi, stmt, GSI_CONTINUE_LINKING); | |
7803 | } | |
7804 | } | |
7805 | } | |
7806 | ||
7807 | ||
7808 | /* Helper function for expand_omp_for_*. Generate code like: | |
7809 | L10: | |
7810 | V3 += STEP3; | |
7811 | if (V3 cond3 N32) goto BODY_BB; else goto L11; | |
7812 | L11: | |
7813 | V3 = N31; | |
7814 | V2 += STEP2; | |
7815 | if (V2 cond2 N22) goto BODY_BB; else goto L12; | |
7816 | L12: | |
7817 | V2 = N21; | |
7818 | V1 += STEP1; | |
7819 | goto BODY_BB; */ | |
7820 | ||
7821 | static basic_block | |
7822 | extract_omp_for_update_vars (struct omp_for_data *fd, basic_block cont_bb, | |
7823 | basic_block body_bb) | |
7824 | { | |
7825 | basic_block last_bb, bb, collapse_bb = NULL; | |
7826 | int i; | |
7827 | gimple_stmt_iterator gsi; | |
7828 | edge e; | |
7829 | tree t; | |
355fe088 | 7830 | gimple *stmt; |
74bf76ed JJ |
7831 | |
7832 | last_bb = cont_bb; | |
7833 | for (i = fd->collapse - 1; i >= 0; i--) | |
7834 | { | |
7835 | tree vtype = TREE_TYPE (fd->loops[i].v); | |
7836 | ||
7837 | bb = create_empty_bb (last_bb); | |
726338f4 | 7838 | add_bb_to_loop (bb, last_bb->loop_father); |
74bf76ed JJ |
7839 | gsi = gsi_start_bb (bb); |
7840 | ||
7841 | if (i < fd->collapse - 1) | |
7842 | { | |
7843 | e = make_edge (last_bb, bb, EDGE_FALSE_VALUE); | |
7844 | e->probability = REG_BR_PROB_BASE / 8; | |
7845 | ||
7846 | t = fd->loops[i + 1].n1; | |
7847 | t = force_gimple_operand_gsi (&gsi, t, | |
7848 | DECL_P (fd->loops[i + 1].v) | |
7849 | && TREE_ADDRESSABLE (fd->loops[i | |
7850 | + 1].v), | |
7851 | NULL_TREE, false, | |
7852 | GSI_CONTINUE_LINKING); | |
7853 | stmt = gimple_build_assign (fd->loops[i + 1].v, t); | |
7854 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
7855 | } | |
7856 | else | |
7857 | collapse_bb = bb; | |
7858 | ||
7859 | set_immediate_dominator (CDI_DOMINATORS, bb, last_bb); | |
7860 | ||
7861 | if (POINTER_TYPE_P (vtype)) | |
7862 | t = fold_build_pointer_plus (fd->loops[i].v, fd->loops[i].step); | |
7863 | else | |
7864 | t = fold_build2 (PLUS_EXPR, vtype, fd->loops[i].v, fd->loops[i].step); | |
7865 | t = force_gimple_operand_gsi (&gsi, t, | |
7866 | DECL_P (fd->loops[i].v) | |
7867 | && TREE_ADDRESSABLE (fd->loops[i].v), | |
7868 | NULL_TREE, false, GSI_CONTINUE_LINKING); | |
7869 | stmt = gimple_build_assign (fd->loops[i].v, t); | |
7870 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
7871 | ||
7872 | if (i > 0) | |
7873 | { | |
7874 | t = fd->loops[i].n2; | |
7875 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
7876 | false, GSI_CONTINUE_LINKING); | |
7877 | tree v = fd->loops[i].v; | |
7878 | if (DECL_P (v) && TREE_ADDRESSABLE (v)) | |
7879 | v = force_gimple_operand_gsi (&gsi, v, true, NULL_TREE, | |
7880 | false, GSI_CONTINUE_LINKING); | |
7881 | t = fold_build2 (fd->loops[i].cond_code, boolean_type_node, v, t); | |
7882 | stmt = gimple_build_cond_empty (t); | |
7883 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
7884 | e = make_edge (bb, body_bb, EDGE_TRUE_VALUE); | |
7885 | e->probability = REG_BR_PROB_BASE * 7 / 8; | |
7886 | } | |
7887 | else | |
7888 | make_edge (bb, body_bb, EDGE_FALLTHRU); | |
7889 | last_bb = bb; | |
7890 | } | |
7891 | ||
7892 | return collapse_bb; | |
7893 | } | |
7894 | ||
7895 | ||
d9a6bd32 | 7896 | /* Expand #pragma omp ordered depend(source). */ |
953ff289 | 7897 | |
d9a6bd32 JJ |
7898 | static void |
7899 | expand_omp_ordered_source (gimple_stmt_iterator *gsi, struct omp_for_data *fd, | |
7900 | tree *counts, location_t loc) | |
7901 | { | |
7902 | enum built_in_function source_ix | |
7903 | = fd->iter_type == long_integer_type_node | |
7904 | ? BUILT_IN_GOMP_DOACROSS_POST : BUILT_IN_GOMP_DOACROSS_ULL_POST; | |
7905 | gimple *g | |
7906 | = gimple_build_call (builtin_decl_explicit (source_ix), 1, | |
7907 | build_fold_addr_expr (counts[fd->ordered])); | |
7908 | gimple_set_location (g, loc); | |
7909 | gsi_insert_before (gsi, g, GSI_SAME_STMT); | |
7910 | } | |
953ff289 | 7911 | |
d9a6bd32 | 7912 | /* Expand a single depend from #pragma omp ordered depend(sink:...). */ |
953ff289 | 7913 | |
d9a6bd32 JJ |
7914 | static void |
7915 | expand_omp_ordered_sink (gimple_stmt_iterator *gsi, struct omp_for_data *fd, | |
7916 | tree *counts, tree c, location_t loc) | |
7917 | { | |
7918 | auto_vec<tree, 10> args; | |
7919 | enum built_in_function sink_ix | |
7920 | = fd->iter_type == long_integer_type_node | |
7921 | ? BUILT_IN_GOMP_DOACROSS_WAIT : BUILT_IN_GOMP_DOACROSS_ULL_WAIT; | |
7922 | tree t, off, coff = NULL_TREE, deps = OMP_CLAUSE_DECL (c), cond = NULL_TREE; | |
7923 | int i; | |
7924 | gimple_stmt_iterator gsi2 = *gsi; | |
7925 | bool warned_step = false; | |
a68ab351 | 7926 | |
d9a6bd32 JJ |
7927 | for (i = 0; i < fd->ordered; i++) |
7928 | { | |
7929 | off = TREE_PURPOSE (deps); | |
7930 | if (!integer_zerop (off)) | |
7931 | { | |
7932 | gcc_assert (fd->loops[i].cond_code == LT_EXPR | |
7933 | || fd->loops[i].cond_code == GT_EXPR); | |
7934 | bool forward = fd->loops[i].cond_code == LT_EXPR; | |
7935 | if (forward ^ OMP_CLAUSE_DEPEND_SINK_NEGATIVE (deps)) | |
7936 | warning_at (loc, 0, "%<depend(sink)%> clause waiting for " | |
7937 | "lexically later iteration"); | |
7938 | break; | |
7939 | } | |
7940 | deps = TREE_CHAIN (deps); | |
7941 | } | |
7942 | /* If all offsets corresponding to the collapsed loops are zero, | |
7943 | this depend clause can be ignored. FIXME: but there is still a | |
7944 | flush needed. We need to emit one __sync_synchronize () for it | |
7945 | though (perhaps conditionally)? Solve this together with the | |
7946 | conservative dependence folding optimization. | |
7947 | if (i >= fd->collapse) | |
7948 | return; */ | |
a68ab351 | 7949 | |
d9a6bd32 JJ |
7950 | deps = OMP_CLAUSE_DECL (c); |
7951 | gsi_prev (&gsi2); | |
7952 | edge e1 = split_block (gsi_bb (gsi2), gsi_stmt (gsi2)); | |
7953 | edge e2 = split_block_after_labels (e1->dest); | |
a68ab351 | 7954 | |
d9a6bd32 JJ |
7955 | *gsi = gsi_after_labels (e1->dest); |
7956 | for (i = 0; i < fd->ordered; i++) | |
7957 | { | |
7958 | tree itype = TREE_TYPE (fd->loops[i].v); | |
7959 | if (POINTER_TYPE_P (itype)) | |
7960 | itype = sizetype; | |
7961 | if (i) | |
7962 | deps = TREE_CHAIN (deps); | |
7963 | off = TREE_PURPOSE (deps); | |
7964 | tree s = fold_convert_loc (loc, itype, fd->loops[i].step); | |
7965 | ||
7966 | if (integer_zerop (off)) | |
7967 | t = boolean_true_node; | |
7968 | else | |
7969 | { | |
7970 | tree a; | |
7971 | tree co = fold_convert_loc (loc, itype, off); | |
7972 | if (POINTER_TYPE_P (TREE_TYPE (fd->loops[i].v))) | |
7973 | { | |
7974 | if (OMP_CLAUSE_DEPEND_SINK_NEGATIVE (deps)) | |
7975 | co = fold_build1_loc (loc, NEGATE_EXPR, itype, co); | |
7976 | a = fold_build2_loc (loc, POINTER_PLUS_EXPR, | |
7977 | TREE_TYPE (fd->loops[i].v), fd->loops[i].v, | |
7978 | co); | |
7979 | } | |
7980 | else if (OMP_CLAUSE_DEPEND_SINK_NEGATIVE (deps)) | |
7981 | a = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (fd->loops[i].v), | |
7982 | fd->loops[i].v, co); | |
7983 | else | |
7984 | a = fold_build2_loc (loc, PLUS_EXPR, TREE_TYPE (fd->loops[i].v), | |
7985 | fd->loops[i].v, co); | |
7986 | if (fd->loops[i].cond_code == LT_EXPR) | |
7987 | { | |
7988 | if (OMP_CLAUSE_DEPEND_SINK_NEGATIVE (deps)) | |
7989 | t = fold_build2_loc (loc, GE_EXPR, boolean_type_node, a, | |
7990 | fd->loops[i].n1); | |
7991 | else | |
7992 | t = fold_build2_loc (loc, LT_EXPR, boolean_type_node, a, | |
7993 | fd->loops[i].n2); | |
7994 | } | |
7995 | else if (OMP_CLAUSE_DEPEND_SINK_NEGATIVE (deps)) | |
7996 | t = fold_build2_loc (loc, GT_EXPR, boolean_type_node, a, | |
7997 | fd->loops[i].n2); | |
7998 | else | |
7999 | t = fold_build2_loc (loc, LE_EXPR, boolean_type_node, a, | |
8000 | fd->loops[i].n1); | |
8001 | } | |
8002 | if (cond) | |
8003 | cond = fold_build2_loc (loc, BIT_AND_EXPR, boolean_type_node, cond, t); | |
8004 | else | |
8005 | cond = t; | |
8006 | ||
8007 | off = fold_convert_loc (loc, itype, off); | |
8008 | ||
8009 | if (fd->loops[i].cond_code == LT_EXPR | |
8010 | ? !integer_onep (fd->loops[i].step) | |
8011 | : !integer_minus_onep (fd->loops[i].step)) | |
8012 | { | |
8013 | if (TYPE_UNSIGNED (itype) && fd->loops[i].cond_code == GT_EXPR) | |
8014 | t = fold_build2_loc (loc, TRUNC_MOD_EXPR, itype, off, | |
8015 | fold_build1_loc (loc, NEGATE_EXPR, itype, | |
8016 | s)); | |
8017 | else | |
8018 | t = fold_build2_loc (loc, TRUNC_MOD_EXPR, itype, off, s); | |
8019 | t = fold_build2_loc (loc, EQ_EXPR, boolean_type_node, t, | |
8020 | build_int_cst (itype, 0)); | |
8021 | if (integer_zerop (t) && !warned_step) | |
8022 | { | |
8023 | warning_at (loc, 0, "%<depend(sink)%> refers to iteration never " | |
8024 | "in the iteration space"); | |
8025 | warned_step = true; | |
8026 | } | |
8027 | cond = fold_build2_loc (loc, BIT_AND_EXPR, boolean_type_node, | |
8028 | cond, t); | |
8029 | } | |
8030 | ||
8031 | if (i <= fd->collapse - 1 && fd->collapse > 1) | |
8032 | t = fd->loop.v; | |
8033 | else if (counts[i]) | |
8034 | t = counts[i]; | |
8035 | else | |
8036 | { | |
8037 | t = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (fd->loops[i].v), | |
8038 | fd->loops[i].v, fd->loops[i].n1); | |
8039 | t = fold_convert_loc (loc, fd->iter_type, t); | |
8040 | } | |
8041 | if (TYPE_UNSIGNED (itype) && fd->loops[i].cond_code == GT_EXPR) | |
8042 | off = fold_build2_loc (loc, TRUNC_DIV_EXPR, itype, off, | |
8043 | fold_build1_loc (loc, NEGATE_EXPR, itype, | |
8044 | s)); | |
8045 | else | |
8046 | off = fold_build2_loc (loc, TRUNC_DIV_EXPR, itype, off, s); | |
8047 | if (OMP_CLAUSE_DEPEND_SINK_NEGATIVE (deps)) | |
8048 | off = fold_build1_loc (loc, NEGATE_EXPR, itype, off); | |
8049 | off = fold_convert_loc (loc, fd->iter_type, off); | |
8050 | if (i <= fd->collapse - 1 && fd->collapse > 1) | |
8051 | { | |
8052 | if (i) | |
8053 | off = fold_build2_loc (loc, PLUS_EXPR, fd->iter_type, coff, | |
8054 | off); | |
8055 | if (i < fd->collapse - 1) | |
8056 | { | |
8057 | coff = fold_build2_loc (loc, MULT_EXPR, fd->iter_type, off, | |
8058 | counts[i]); | |
8059 | continue; | |
8060 | } | |
8061 | } | |
8062 | off = unshare_expr (off); | |
8063 | t = fold_build2_loc (loc, PLUS_EXPR, fd->iter_type, t, off); | |
8064 | t = force_gimple_operand_gsi (gsi, t, true, NULL_TREE, | |
8065 | true, GSI_SAME_STMT); | |
8066 | args.safe_push (t); | |
8067 | } | |
8068 | gimple *g = gimple_build_call_vec (builtin_decl_explicit (sink_ix), args); | |
8069 | gimple_set_location (g, loc); | |
8070 | gsi_insert_before (gsi, g, GSI_SAME_STMT); | |
8071 | ||
8072 | *gsi = gsi_last_bb (e1->src); | |
8073 | cond = unshare_expr (cond); | |
8074 | cond = force_gimple_operand_gsi (gsi, cond, true, NULL_TREE, false, | |
8075 | GSI_CONTINUE_LINKING); | |
8076 | gsi_insert_after (gsi, gimple_build_cond_empty (cond), GSI_NEW_STMT); | |
8077 | edge e3 = make_edge (e1->src, e2->dest, EDGE_FALSE_VALUE); | |
8078 | e3->probability = REG_BR_PROB_BASE / 8; | |
8079 | e1->probability = REG_BR_PROB_BASE - e3->probability; | |
8080 | e1->flags = EDGE_TRUE_VALUE; | |
8081 | set_immediate_dominator (CDI_DOMINATORS, e2->dest, e1->src); | |
8082 | ||
8083 | *gsi = gsi_after_labels (e2->dest); | |
8084 | } | |
8085 | ||
8086 | /* Expand all #pragma omp ordered depend(source) and | |
8087 | #pragma omp ordered depend(sink:...) constructs in the current | |
8088 | #pragma omp for ordered(n) region. */ | |
8089 | ||
8090 | static void | |
8091 | expand_omp_ordered_source_sink (struct omp_region *region, | |
8092 | struct omp_for_data *fd, tree *counts, | |
8093 | basic_block cont_bb) | |
8094 | { | |
8095 | struct omp_region *inner; | |
8096 | int i; | |
8097 | for (i = fd->collapse - 1; i < fd->ordered; i++) | |
8098 | if (i == fd->collapse - 1 && fd->collapse > 1) | |
8099 | counts[i] = NULL_TREE; | |
8100 | else if (i >= fd->collapse && !cont_bb) | |
8101 | counts[i] = build_zero_cst (fd->iter_type); | |
8102 | else if (!POINTER_TYPE_P (TREE_TYPE (fd->loops[i].v)) | |
8103 | && integer_onep (fd->loops[i].step)) | |
8104 | counts[i] = NULL_TREE; | |
8105 | else | |
8106 | counts[i] = create_tmp_var (fd->iter_type, ".orditer"); | |
8107 | tree atype | |
8108 | = build_array_type_nelts (fd->iter_type, fd->ordered - fd->collapse + 1); | |
8109 | counts[fd->ordered] = create_tmp_var (atype, ".orditera"); | |
8110 | TREE_ADDRESSABLE (counts[fd->ordered]) = 1; | |
8111 | ||
8112 | for (inner = region->inner; inner; inner = inner->next) | |
8113 | if (inner->type == GIMPLE_OMP_ORDERED) | |
8114 | { | |
8115 | gomp_ordered *ord_stmt = inner->ord_stmt; | |
8116 | gimple_stmt_iterator gsi = gsi_for_stmt (ord_stmt); | |
8117 | location_t loc = gimple_location (ord_stmt); | |
8118 | tree c; | |
8119 | for (c = gimple_omp_ordered_clauses (ord_stmt); | |
8120 | c; c = OMP_CLAUSE_CHAIN (c)) | |
8121 | if (OMP_CLAUSE_DEPEND_KIND (c) == OMP_CLAUSE_DEPEND_SOURCE) | |
8122 | break; | |
8123 | if (c) | |
8124 | expand_omp_ordered_source (&gsi, fd, counts, loc); | |
8125 | for (c = gimple_omp_ordered_clauses (ord_stmt); | |
8126 | c; c = OMP_CLAUSE_CHAIN (c)) | |
8127 | if (OMP_CLAUSE_DEPEND_KIND (c) == OMP_CLAUSE_DEPEND_SINK) | |
8128 | expand_omp_ordered_sink (&gsi, fd, counts, c, loc); | |
8129 | gsi_remove (&gsi, true); | |
8130 | } | |
8131 | } | |
8132 | ||
8133 | /* Wrap the body into fd->ordered - fd->collapse loops that aren't | |
8134 | collapsed. */ | |
8135 | ||
8136 | static basic_block | |
8137 | expand_omp_for_ordered_loops (struct omp_for_data *fd, tree *counts, | |
8138 | basic_block cont_bb, basic_block body_bb, | |
8139 | bool ordered_lastprivate) | |
8140 | { | |
8141 | if (fd->ordered == fd->collapse) | |
8142 | return cont_bb; | |
8143 | ||
8144 | if (!cont_bb) | |
8145 | { | |
8146 | gimple_stmt_iterator gsi = gsi_after_labels (body_bb); | |
8147 | for (int i = fd->collapse; i < fd->ordered; i++) | |
8148 | { | |
8149 | tree type = TREE_TYPE (fd->loops[i].v); | |
8150 | tree n1 = fold_convert (type, fd->loops[i].n1); | |
8151 | expand_omp_build_assign (&gsi, fd->loops[i].v, n1); | |
8152 | tree aref = build4 (ARRAY_REF, fd->iter_type, counts[fd->ordered], | |
8153 | size_int (i - fd->collapse + 1), | |
8154 | NULL_TREE, NULL_TREE); | |
8155 | expand_omp_build_assign (&gsi, aref, build_zero_cst (fd->iter_type)); | |
8156 | } | |
8157 | return NULL; | |
8158 | } | |
8159 | ||
8160 | for (int i = fd->ordered - 1; i >= fd->collapse; i--) | |
8161 | { | |
8162 | tree t, type = TREE_TYPE (fd->loops[i].v); | |
8163 | gimple_stmt_iterator gsi = gsi_after_labels (body_bb); | |
8164 | expand_omp_build_assign (&gsi, fd->loops[i].v, | |
8165 | fold_convert (type, fd->loops[i].n1)); | |
8166 | if (counts[i]) | |
8167 | expand_omp_build_assign (&gsi, counts[i], | |
8168 | build_zero_cst (fd->iter_type)); | |
8169 | tree aref = build4 (ARRAY_REF, fd->iter_type, counts[fd->ordered], | |
8170 | size_int (i - fd->collapse + 1), | |
8171 | NULL_TREE, NULL_TREE); | |
8172 | expand_omp_build_assign (&gsi, aref, build_zero_cst (fd->iter_type)); | |
8173 | if (!gsi_end_p (gsi)) | |
8174 | gsi_prev (&gsi); | |
8175 | else | |
8176 | gsi = gsi_last_bb (body_bb); | |
8177 | edge e1 = split_block (body_bb, gsi_stmt (gsi)); | |
8178 | basic_block new_body = e1->dest; | |
8179 | if (body_bb == cont_bb) | |
8180 | cont_bb = new_body; | |
8181 | edge e2 = NULL; | |
8182 | basic_block new_header; | |
8183 | if (EDGE_COUNT (cont_bb->preds) > 0) | |
8184 | { | |
8185 | gsi = gsi_last_bb (cont_bb); | |
8186 | if (POINTER_TYPE_P (type)) | |
8187 | t = fold_build_pointer_plus (fd->loops[i].v, | |
8188 | fold_convert (sizetype, | |
8189 | fd->loops[i].step)); | |
8190 | else | |
8191 | t = fold_build2 (PLUS_EXPR, type, fd->loops[i].v, | |
8192 | fold_convert (type, fd->loops[i].step)); | |
8193 | expand_omp_build_assign (&gsi, fd->loops[i].v, t); | |
8194 | if (counts[i]) | |
8195 | { | |
8196 | t = fold_build2 (PLUS_EXPR, fd->iter_type, counts[i], | |
8197 | build_int_cst (fd->iter_type, 1)); | |
8198 | expand_omp_build_assign (&gsi, counts[i], t); | |
8199 | t = counts[i]; | |
8200 | } | |
8201 | else | |
8202 | { | |
8203 | t = fold_build2 (MINUS_EXPR, TREE_TYPE (fd->loops[i].v), | |
8204 | fd->loops[i].v, fd->loops[i].n1); | |
8205 | t = fold_convert (fd->iter_type, t); | |
8206 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
8207 | true, GSI_SAME_STMT); | |
8208 | } | |
8209 | aref = build4 (ARRAY_REF, fd->iter_type, counts[fd->ordered], | |
8210 | size_int (i - fd->collapse + 1), | |
8211 | NULL_TREE, NULL_TREE); | |
8212 | expand_omp_build_assign (&gsi, aref, t); | |
8213 | gsi_prev (&gsi); | |
8214 | e2 = split_block (cont_bb, gsi_stmt (gsi)); | |
8215 | new_header = e2->dest; | |
8216 | } | |
8217 | else | |
8218 | new_header = cont_bb; | |
8219 | gsi = gsi_after_labels (new_header); | |
8220 | tree v = force_gimple_operand_gsi (&gsi, fd->loops[i].v, true, NULL_TREE, | |
8221 | true, GSI_SAME_STMT); | |
8222 | tree n2 | |
8223 | = force_gimple_operand_gsi (&gsi, fold_convert (type, fd->loops[i].n2), | |
8224 | true, NULL_TREE, true, GSI_SAME_STMT); | |
8225 | t = build2 (fd->loops[i].cond_code, boolean_type_node, v, n2); | |
8226 | gsi_insert_before (&gsi, gimple_build_cond_empty (t), GSI_NEW_STMT); | |
8227 | edge e3 = split_block (new_header, gsi_stmt (gsi)); | |
8228 | cont_bb = e3->dest; | |
8229 | remove_edge (e1); | |
8230 | make_edge (body_bb, new_header, EDGE_FALLTHRU); | |
8231 | e3->flags = EDGE_FALSE_VALUE; | |
8232 | e3->probability = REG_BR_PROB_BASE / 8; | |
8233 | e1 = make_edge (new_header, new_body, EDGE_TRUE_VALUE); | |
8234 | e1->probability = REG_BR_PROB_BASE - e3->probability; | |
8235 | ||
8236 | set_immediate_dominator (CDI_DOMINATORS, new_header, body_bb); | |
8237 | set_immediate_dominator (CDI_DOMINATORS, new_body, new_header); | |
8238 | ||
8239 | if (e2) | |
8240 | { | |
8241 | struct loop *loop = alloc_loop (); | |
8242 | loop->header = new_header; | |
8243 | loop->latch = e2->src; | |
8244 | add_loop (loop, body_bb->loop_father); | |
8245 | } | |
8246 | } | |
8247 | ||
8248 | /* If there are any lastprivate clauses and it is possible some loops | |
8249 | might have zero iterations, ensure all the decls are initialized, | |
8250 | otherwise we could crash evaluating C++ class iterators with lastprivate | |
8251 | clauses. */ | |
8252 | bool need_inits = false; | |
8253 | for (int i = fd->collapse; ordered_lastprivate && i < fd->ordered; i++) | |
8254 | if (need_inits) | |
8255 | { | |
8256 | tree type = TREE_TYPE (fd->loops[i].v); | |
8257 | gimple_stmt_iterator gsi = gsi_after_labels (body_bb); | |
8258 | expand_omp_build_assign (&gsi, fd->loops[i].v, | |
8259 | fold_convert (type, fd->loops[i].n1)); | |
8260 | } | |
8261 | else | |
8262 | { | |
8263 | tree type = TREE_TYPE (fd->loops[i].v); | |
8264 | tree this_cond = fold_build2 (fd->loops[i].cond_code, | |
8265 | boolean_type_node, | |
8266 | fold_convert (type, fd->loops[i].n1), | |
8267 | fold_convert (type, fd->loops[i].n2)); | |
8268 | if (!integer_onep (this_cond)) | |
8269 | need_inits = true; | |
8270 | } | |
8271 | ||
8272 | return cont_bb; | |
8273 | } | |
8274 | ||
8275 | ||
8276 | /* A subroutine of expand_omp_for. Generate code for a parallel | |
8277 | loop with any schedule. Given parameters: | |
8278 | ||
8279 | for (V = N1; V cond N2; V += STEP) BODY; | |
8280 | ||
8281 | where COND is "<" or ">", we generate pseudocode | |
8282 | ||
8283 | more = GOMP_loop_foo_start (N1, N2, STEP, CHUNK, &istart0, &iend0); | |
8284 | if (more) goto L0; else goto L3; | |
8285 | L0: | |
8286 | V = istart0; | |
8287 | iend = iend0; | |
8288 | L1: | |
8289 | BODY; | |
8290 | V += STEP; | |
8291 | if (V cond iend) goto L1; else goto L2; | |
8292 | L2: | |
8293 | if (GOMP_loop_foo_next (&istart0, &iend0)) goto L0; else goto L3; | |
8294 | L3: | |
8295 | ||
8296 | If this is a combined omp parallel loop, instead of the call to | |
8297 | GOMP_loop_foo_start, we call GOMP_loop_foo_next. | |
8298 | If this is gimple_omp_for_combined_p loop, then instead of assigning | |
8299 | V and iend in L0 we assign the first two _looptemp_ clause decls of the | |
8300 | inner GIMPLE_OMP_FOR and V += STEP; and | |
8301 | if (V cond iend) goto L1; else goto L2; are removed. | |
8302 | ||
8303 | For collapsed loops, given parameters: | |
8304 | collapse(3) | |
8305 | for (V1 = N11; V1 cond1 N12; V1 += STEP1) | |
8306 | for (V2 = N21; V2 cond2 N22; V2 += STEP2) | |
8307 | for (V3 = N31; V3 cond3 N32; V3 += STEP3) | |
8308 | BODY; | |
8309 | ||
8310 | we generate pseudocode | |
8311 | ||
8312 | if (__builtin_expect (N32 cond3 N31, 0)) goto Z0; | |
8313 | if (cond3 is <) | |
8314 | adj = STEP3 - 1; | |
8315 | else | |
8316 | adj = STEP3 + 1; | |
8317 | count3 = (adj + N32 - N31) / STEP3; | |
8318 | if (__builtin_expect (N22 cond2 N21, 0)) goto Z0; | |
8319 | if (cond2 is <) | |
8320 | adj = STEP2 - 1; | |
8321 | else | |
8322 | adj = STEP2 + 1; | |
a68ab351 | 8323 | count2 = (adj + N22 - N21) / STEP2; |
5a0f4dd3 | 8324 | if (__builtin_expect (N12 cond1 N11, 0)) goto Z0; |
a68ab351 JJ |
8325 | if (cond1 is <) |
8326 | adj = STEP1 - 1; | |
8327 | else | |
8328 | adj = STEP1 + 1; | |
8329 | count1 = (adj + N12 - N11) / STEP1; | |
8330 | count = count1 * count2 * count3; | |
5a0f4dd3 JJ |
8331 | goto Z1; |
8332 | Z0: | |
8333 | count = 0; | |
8334 | Z1: | |
a68ab351 JJ |
8335 | more = GOMP_loop_foo_start (0, count, 1, CHUNK, &istart0, &iend0); |
8336 | if (more) goto L0; else goto L3; | |
8337 | L0: | |
8338 | V = istart0; | |
8339 | T = V; | |
8340 | V3 = N31 + (T % count3) * STEP3; | |
8341 | T = T / count3; | |
8342 | V2 = N21 + (T % count2) * STEP2; | |
8343 | T = T / count2; | |
8344 | V1 = N11 + T * STEP1; | |
8345 | iend = iend0; | |
8346 | L1: | |
8347 | BODY; | |
8348 | V += 1; | |
8349 | if (V < iend) goto L10; else goto L2; | |
8350 | L10: | |
8351 | V3 += STEP3; | |
8352 | if (V3 cond3 N32) goto L1; else goto L11; | |
8353 | L11: | |
8354 | V3 = N31; | |
8355 | V2 += STEP2; | |
8356 | if (V2 cond2 N22) goto L1; else goto L12; | |
8357 | L12: | |
8358 | V2 = N21; | |
8359 | V1 += STEP1; | |
8360 | goto L1; | |
8361 | L2: | |
8362 | if (GOMP_loop_foo_next (&istart0, &iend0)) goto L0; else goto L3; | |
8363 | L3: | |
8364 | ||
8365 | */ | |
953ff289 | 8366 | |
777f7f9a | 8367 | static void |
50674e96 DN |
8368 | expand_omp_for_generic (struct omp_region *region, |
8369 | struct omp_for_data *fd, | |
953ff289 | 8370 | enum built_in_function start_fn, |
acf0174b | 8371 | enum built_in_function next_fn, |
355fe088 | 8372 | gimple *inner_stmt) |
953ff289 | 8373 | { |
726a989a | 8374 | tree type, istart0, iend0, iend; |
a68ab351 JJ |
8375 | tree t, vmain, vback, bias = NULL_TREE; |
8376 | basic_block entry_bb, cont_bb, exit_bb, l0_bb, l1_bb, collapse_bb; | |
d3c673c7 | 8377 | basic_block l2_bb = NULL, l3_bb = NULL; |
726a989a | 8378 | gimple_stmt_iterator gsi; |
538dd0b7 | 8379 | gassign *assign_stmt; |
50674e96 | 8380 | bool in_combined_parallel = is_combined_parallel (region); |
e5c95afe | 8381 | bool broken_loop = region->cont == NULL; |
917948d3 | 8382 | edge e, ne; |
a68ab351 JJ |
8383 | tree *counts = NULL; |
8384 | int i; | |
d9a6bd32 | 8385 | bool ordered_lastprivate = false; |
e5c95afe ZD |
8386 | |
8387 | gcc_assert (!broken_loop || !in_combined_parallel); | |
a68ab351 JJ |
8388 | gcc_assert (fd->iter_type == long_integer_type_node |
8389 | || !in_combined_parallel); | |
953ff289 | 8390 | |
777f7f9a | 8391 | entry_bb = region->entry; |
d3c673c7 | 8392 | cont_bb = region->cont; |
a68ab351 | 8393 | collapse_bb = NULL; |
e5c95afe ZD |
8394 | gcc_assert (EDGE_COUNT (entry_bb->succs) == 2); |
8395 | gcc_assert (broken_loop | |
8396 | || BRANCH_EDGE (entry_bb)->dest == FALLTHRU_EDGE (cont_bb)->dest); | |
8397 | l0_bb = split_edge (FALLTHRU_EDGE (entry_bb)); | |
8398 | l1_bb = single_succ (l0_bb); | |
8399 | if (!broken_loop) | |
d3c673c7 JJ |
8400 | { |
8401 | l2_bb = create_empty_bb (cont_bb); | |
7aab672f TV |
8402 | gcc_assert (BRANCH_EDGE (cont_bb)->dest == l1_bb |
8403 | || (single_succ_edge (BRANCH_EDGE (cont_bb)->dest)->dest | |
8404 | == l1_bb)); | |
e5c95afe | 8405 | gcc_assert (EDGE_COUNT (cont_bb->succs) == 2); |
d3c673c7 | 8406 | } |
e5c95afe ZD |
8407 | else |
8408 | l2_bb = NULL; | |
8409 | l3_bb = BRANCH_EDGE (entry_bb)->dest; | |
8410 | exit_bb = region->exit; | |
50674e96 | 8411 | |
726a989a | 8412 | gsi = gsi_last_bb (entry_bb); |
a68ab351 | 8413 | |
726a989a | 8414 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_FOR); |
d9a6bd32 JJ |
8415 | if (fd->ordered |
8416 | && find_omp_clause (gimple_omp_for_clauses (gsi_stmt (gsi)), | |
8417 | OMP_CLAUSE_LASTPRIVATE)) | |
8418 | ordered_lastprivate = false; | |
8419 | if (fd->collapse > 1 || fd->ordered) | |
a68ab351 | 8420 | { |
d9a6bd32 JJ |
8421 | int first_zero_iter1 = -1, first_zero_iter2 = -1; |
8422 | basic_block zero_iter1_bb = NULL, zero_iter2_bb = NULL, l2_dom_bb = NULL; | |
5a0f4dd3 | 8423 | |
d9a6bd32 | 8424 | counts = XALLOCAVEC (tree, fd->ordered ? fd->ordered + 1 : fd->collapse); |
74bf76ed | 8425 | expand_omp_for_init_counts (fd, &gsi, entry_bb, counts, |
d9a6bd32 JJ |
8426 | zero_iter1_bb, first_zero_iter1, |
8427 | zero_iter2_bb, first_zero_iter2, l2_dom_bb); | |
a68ab351 | 8428 | |
d9a6bd32 | 8429 | if (zero_iter1_bb) |
5a0f4dd3 JJ |
8430 | { |
8431 | /* Some counts[i] vars might be uninitialized if | |
8432 | some loop has zero iterations. But the body shouldn't | |
8433 | be executed in that case, so just avoid uninit warnings. */ | |
d9a6bd32 JJ |
8434 | for (i = first_zero_iter1; |
8435 | i < (fd->ordered ? fd->ordered : fd->collapse); i++) | |
5a0f4dd3 JJ |
8436 | if (SSA_VAR_P (counts[i])) |
8437 | TREE_NO_WARNING (counts[i]) = 1; | |
8438 | gsi_prev (&gsi); | |
8439 | e = split_block (entry_bb, gsi_stmt (gsi)); | |
8440 | entry_bb = e->dest; | |
d9a6bd32 | 8441 | make_edge (zero_iter1_bb, entry_bb, EDGE_FALLTHRU); |
5a0f4dd3 JJ |
8442 | gsi = gsi_last_bb (entry_bb); |
8443 | set_immediate_dominator (CDI_DOMINATORS, entry_bb, | |
8444 | get_immediate_dominator (CDI_DOMINATORS, | |
d9a6bd32 JJ |
8445 | zero_iter1_bb)); |
8446 | } | |
8447 | if (zero_iter2_bb) | |
8448 | { | |
8449 | /* Some counts[i] vars might be uninitialized if | |
8450 | some loop has zero iterations. But the body shouldn't | |
8451 | be executed in that case, so just avoid uninit warnings. */ | |
8452 | for (i = first_zero_iter2; i < fd->ordered; i++) | |
8453 | if (SSA_VAR_P (counts[i])) | |
8454 | TREE_NO_WARNING (counts[i]) = 1; | |
8455 | if (zero_iter1_bb) | |
8456 | make_edge (zero_iter2_bb, entry_bb, EDGE_FALLTHRU); | |
8457 | else | |
8458 | { | |
8459 | gsi_prev (&gsi); | |
8460 | e = split_block (entry_bb, gsi_stmt (gsi)); | |
8461 | entry_bb = e->dest; | |
8462 | make_edge (zero_iter2_bb, entry_bb, EDGE_FALLTHRU); | |
8463 | gsi = gsi_last_bb (entry_bb); | |
8464 | set_immediate_dominator (CDI_DOMINATORS, entry_bb, | |
8465 | get_immediate_dominator | |
8466 | (CDI_DOMINATORS, zero_iter2_bb)); | |
8467 | } | |
8468 | } | |
8469 | if (fd->collapse == 1) | |
8470 | { | |
8471 | counts[0] = fd->loop.n2; | |
8472 | fd->loop = fd->loops[0]; | |
8473 | } | |
8474 | } | |
8475 | ||
8476 | type = TREE_TYPE (fd->loop.v); | |
8477 | istart0 = create_tmp_var (fd->iter_type, ".istart0"); | |
8478 | iend0 = create_tmp_var (fd->iter_type, ".iend0"); | |
8479 | TREE_ADDRESSABLE (istart0) = 1; | |
8480 | TREE_ADDRESSABLE (iend0) = 1; | |
8481 | ||
8482 | /* See if we need to bias by LLONG_MIN. */ | |
8483 | if (fd->iter_type == long_long_unsigned_type_node | |
8484 | && TREE_CODE (type) == INTEGER_TYPE | |
8485 | && !TYPE_UNSIGNED (type) | |
8486 | && fd->ordered == 0) | |
8487 | { | |
8488 | tree n1, n2; | |
8489 | ||
8490 | if (fd->loop.cond_code == LT_EXPR) | |
8491 | { | |
8492 | n1 = fd->loop.n1; | |
8493 | n2 = fold_build2 (PLUS_EXPR, type, fd->loop.n2, fd->loop.step); | |
5a0f4dd3 | 8494 | } |
d9a6bd32 JJ |
8495 | else |
8496 | { | |
8497 | n1 = fold_build2 (MINUS_EXPR, type, fd->loop.n2, fd->loop.step); | |
8498 | n2 = fd->loop.n1; | |
8499 | } | |
8500 | if (TREE_CODE (n1) != INTEGER_CST | |
8501 | || TREE_CODE (n2) != INTEGER_CST | |
8502 | || ((tree_int_cst_sgn (n1) < 0) ^ (tree_int_cst_sgn (n2) < 0))) | |
8503 | bias = fold_convert (fd->iter_type, TYPE_MIN_VALUE (type)); | |
a68ab351 | 8504 | } |
d9a6bd32 JJ |
8505 | |
8506 | gimple_stmt_iterator gsif = gsi; | |
8507 | gsi_prev (&gsif); | |
8508 | ||
8509 | tree arr = NULL_TREE; | |
917948d3 ZD |
8510 | if (in_combined_parallel) |
8511 | { | |
d9a6bd32 | 8512 | gcc_assert (fd->ordered == 0); |
917948d3 ZD |
8513 | /* In a combined parallel loop, emit a call to |
8514 | GOMP_loop_foo_next. */ | |
e79983f4 | 8515 | t = build_call_expr (builtin_decl_explicit (next_fn), 2, |
917948d3 ZD |
8516 | build_fold_addr_expr (istart0), |
8517 | build_fold_addr_expr (iend0)); | |
8518 | } | |
8519 | else | |
953ff289 | 8520 | { |
5039610b | 8521 | tree t0, t1, t2, t3, t4; |
50674e96 DN |
8522 | /* If this is not a combined parallel loop, emit a call to |
8523 | GOMP_loop_foo_start in ENTRY_BB. */ | |
5039610b SL |
8524 | t4 = build_fold_addr_expr (iend0); |
8525 | t3 = build_fold_addr_expr (istart0); | |
d9a6bd32 | 8526 | if (fd->ordered) |
c6ff4493 | 8527 | { |
d9a6bd32 JJ |
8528 | t0 = build_int_cst (unsigned_type_node, |
8529 | fd->ordered - fd->collapse + 1); | |
8530 | arr = create_tmp_var (build_array_type_nelts (fd->iter_type, | |
8531 | fd->ordered | |
8532 | - fd->collapse + 1), | |
8533 | ".omp_counts"); | |
8534 | DECL_NAMELESS (arr) = 1; | |
8535 | TREE_ADDRESSABLE (arr) = 1; | |
8536 | TREE_STATIC (arr) = 1; | |
8537 | vec<constructor_elt, va_gc> *v; | |
8538 | vec_alloc (v, fd->ordered - fd->collapse + 1); | |
8539 | int idx; | |
8540 | ||
8541 | for (idx = 0; idx < fd->ordered - fd->collapse + 1; idx++) | |
8542 | { | |
8543 | tree c; | |
8544 | if (idx == 0 && fd->collapse > 1) | |
8545 | c = fd->loop.n2; | |
8546 | else | |
8547 | c = counts[idx + fd->collapse - 1]; | |
8548 | tree purpose = size_int (idx); | |
8549 | CONSTRUCTOR_APPEND_ELT (v, purpose, c); | |
8550 | if (TREE_CODE (c) != INTEGER_CST) | |
8551 | TREE_STATIC (arr) = 0; | |
8552 | } | |
8553 | ||
8554 | DECL_INITIAL (arr) = build_constructor (TREE_TYPE (arr), v); | |
8555 | if (!TREE_STATIC (arr)) | |
8556 | force_gimple_operand_gsi (&gsi, build1 (DECL_EXPR, | |
8557 | void_type_node, arr), | |
8558 | true, NULL_TREE, true, GSI_SAME_STMT); | |
8559 | t1 = build_fold_addr_expr (arr); | |
8560 | t2 = NULL_TREE; | |
c6ff4493 SE |
8561 | } |
8562 | else | |
8563 | { | |
d9a6bd32 JJ |
8564 | t2 = fold_convert (fd->iter_type, fd->loop.step); |
8565 | t1 = fd->loop.n2; | |
8566 | t0 = fd->loop.n1; | |
8567 | if (gimple_omp_for_combined_into_p (fd->for_stmt)) | |
8568 | { | |
8569 | tree innerc | |
8570 | = find_omp_clause (gimple_omp_for_clauses (fd->for_stmt), | |
8571 | OMP_CLAUSE__LOOPTEMP_); | |
8572 | gcc_assert (innerc); | |
8573 | t0 = OMP_CLAUSE_DECL (innerc); | |
8574 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
8575 | OMP_CLAUSE__LOOPTEMP_); | |
8576 | gcc_assert (innerc); | |
8577 | t1 = OMP_CLAUSE_DECL (innerc); | |
8578 | } | |
8579 | if (POINTER_TYPE_P (TREE_TYPE (t0)) | |
8580 | && TYPE_PRECISION (TREE_TYPE (t0)) | |
8581 | != TYPE_PRECISION (fd->iter_type)) | |
8582 | { | |
8583 | /* Avoid casting pointers to integer of a different size. */ | |
8584 | tree itype = signed_type_for (type); | |
8585 | t1 = fold_convert (fd->iter_type, fold_convert (itype, t1)); | |
8586 | t0 = fold_convert (fd->iter_type, fold_convert (itype, t0)); | |
8587 | } | |
8588 | else | |
8589 | { | |
8590 | t1 = fold_convert (fd->iter_type, t1); | |
8591 | t0 = fold_convert (fd->iter_type, t0); | |
8592 | } | |
8593 | if (bias) | |
8594 | { | |
8595 | t1 = fold_build2 (PLUS_EXPR, fd->iter_type, t1, bias); | |
8596 | t0 = fold_build2 (PLUS_EXPR, fd->iter_type, t0, bias); | |
8597 | } | |
a68ab351 | 8598 | } |
d9a6bd32 | 8599 | if (fd->iter_type == long_integer_type_node || fd->ordered) |
a68ab351 JJ |
8600 | { |
8601 | if (fd->chunk_size) | |
8602 | { | |
8603 | t = fold_convert (fd->iter_type, fd->chunk_size); | |
d9a6bd32 JJ |
8604 | t = omp_adjust_chunk_size (t, fd->simd_schedule); |
8605 | if (fd->ordered) | |
8606 | t = build_call_expr (builtin_decl_explicit (start_fn), | |
8607 | 5, t0, t1, t, t3, t4); | |
8608 | else | |
8609 | t = build_call_expr (builtin_decl_explicit (start_fn), | |
8610 | 6, t0, t1, t2, t, t3, t4); | |
a68ab351 | 8611 | } |
d9a6bd32 JJ |
8612 | else if (fd->ordered) |
8613 | t = build_call_expr (builtin_decl_explicit (start_fn), | |
8614 | 4, t0, t1, t3, t4); | |
a68ab351 | 8615 | else |
e79983f4 MM |
8616 | t = build_call_expr (builtin_decl_explicit (start_fn), |
8617 | 5, t0, t1, t2, t3, t4); | |
953ff289 | 8618 | } |
5039610b | 8619 | else |
a68ab351 JJ |
8620 | { |
8621 | tree t5; | |
8622 | tree c_bool_type; | |
e79983f4 | 8623 | tree bfn_decl; |
a68ab351 JJ |
8624 | |
8625 | /* The GOMP_loop_ull_*start functions have additional boolean | |
8626 | argument, true for < loops and false for > loops. | |
8627 | In Fortran, the C bool type can be different from | |
8628 | boolean_type_node. */ | |
e79983f4 MM |
8629 | bfn_decl = builtin_decl_explicit (start_fn); |
8630 | c_bool_type = TREE_TYPE (TREE_TYPE (bfn_decl)); | |
a68ab351 JJ |
8631 | t5 = build_int_cst (c_bool_type, |
8632 | fd->loop.cond_code == LT_EXPR ? 1 : 0); | |
8633 | if (fd->chunk_size) | |
8634 | { | |
e79983f4 | 8635 | tree bfn_decl = builtin_decl_explicit (start_fn); |
a68ab351 | 8636 | t = fold_convert (fd->iter_type, fd->chunk_size); |
d9a6bd32 | 8637 | t = omp_adjust_chunk_size (t, fd->simd_schedule); |
e79983f4 | 8638 | t = build_call_expr (bfn_decl, 7, t5, t0, t1, t2, t, t3, t4); |
a68ab351 JJ |
8639 | } |
8640 | else | |
e79983f4 MM |
8641 | t = build_call_expr (builtin_decl_explicit (start_fn), |
8642 | 6, t5, t0, t1, t2, t3, t4); | |
a68ab351 | 8643 | } |
953ff289 | 8644 | } |
a68ab351 JJ |
8645 | if (TREE_TYPE (t) != boolean_type_node) |
8646 | t = fold_build2 (NE_EXPR, boolean_type_node, | |
8647 | t, build_int_cst (TREE_TYPE (t), 0)); | |
726a989a RB |
8648 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
8649 | true, GSI_SAME_STMT); | |
d9a6bd32 JJ |
8650 | if (arr && !TREE_STATIC (arr)) |
8651 | { | |
8652 | tree clobber = build_constructor (TREE_TYPE (arr), NULL); | |
8653 | TREE_THIS_VOLATILE (clobber) = 1; | |
8654 | gsi_insert_before (&gsi, gimple_build_assign (arr, clobber), | |
8655 | GSI_SAME_STMT); | |
8656 | } | |
726a989a | 8657 | gsi_insert_after (&gsi, gimple_build_cond_empty (t), GSI_SAME_STMT); |
917948d3 | 8658 | |
726a989a RB |
8659 | /* Remove the GIMPLE_OMP_FOR statement. */ |
8660 | gsi_remove (&gsi, true); | |
953ff289 | 8661 | |
d9a6bd32 JJ |
8662 | if (gsi_end_p (gsif)) |
8663 | gsif = gsi_after_labels (gsi_bb (gsif)); | |
8664 | gsi_next (&gsif); | |
8665 | ||
50674e96 | 8666 | /* Iteration setup for sequential loop goes in L0_BB. */ |
74bf76ed JJ |
8667 | tree startvar = fd->loop.v; |
8668 | tree endvar = NULL_TREE; | |
8669 | ||
acf0174b JJ |
8670 | if (gimple_omp_for_combined_p (fd->for_stmt)) |
8671 | { | |
8672 | gcc_assert (gimple_code (inner_stmt) == GIMPLE_OMP_FOR | |
8673 | && gimple_omp_for_kind (inner_stmt) | |
8674 | == GF_OMP_FOR_KIND_SIMD); | |
8675 | tree innerc = find_omp_clause (gimple_omp_for_clauses (inner_stmt), | |
8676 | OMP_CLAUSE__LOOPTEMP_); | |
8677 | gcc_assert (innerc); | |
8678 | startvar = OMP_CLAUSE_DECL (innerc); | |
8679 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
8680 | OMP_CLAUSE__LOOPTEMP_); | |
8681 | gcc_assert (innerc); | |
8682 | endvar = OMP_CLAUSE_DECL (innerc); | |
8683 | } | |
8684 | ||
726a989a | 8685 | gsi = gsi_start_bb (l0_bb); |
550918ca | 8686 | t = istart0; |
d9a6bd32 JJ |
8687 | if (fd->ordered && fd->collapse == 1) |
8688 | t = fold_build2 (MULT_EXPR, fd->iter_type, t, | |
8689 | fold_convert (fd->iter_type, fd->loop.step)); | |
8690 | else if (bias) | |
550918ca | 8691 | t = fold_build2 (MINUS_EXPR, fd->iter_type, t, bias); |
d9a6bd32 JJ |
8692 | if (fd->ordered && fd->collapse == 1) |
8693 | { | |
8694 | if (POINTER_TYPE_P (TREE_TYPE (startvar))) | |
8695 | t = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (startvar), | |
8696 | fd->loop.n1, fold_convert (sizetype, t)); | |
8697 | else | |
8698 | { | |
8699 | t = fold_convert (TREE_TYPE (startvar), t); | |
8700 | t = fold_build2 (PLUS_EXPR, TREE_TYPE (startvar), | |
8701 | fd->loop.n1, t); | |
8702 | } | |
8703 | } | |
8704 | else | |
8705 | { | |
8706 | if (POINTER_TYPE_P (TREE_TYPE (startvar))) | |
8707 | t = fold_convert (signed_type_for (TREE_TYPE (startvar)), t); | |
8708 | t = fold_convert (TREE_TYPE (startvar), t); | |
8709 | } | |
ea3a0fde | 8710 | t = force_gimple_operand_gsi (&gsi, t, |
74bf76ed JJ |
8711 | DECL_P (startvar) |
8712 | && TREE_ADDRESSABLE (startvar), | |
ea3a0fde | 8713 | NULL_TREE, false, GSI_CONTINUE_LINKING); |
538dd0b7 DM |
8714 | assign_stmt = gimple_build_assign (startvar, t); |
8715 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
953ff289 | 8716 | |
550918ca | 8717 | t = iend0; |
d9a6bd32 JJ |
8718 | if (fd->ordered && fd->collapse == 1) |
8719 | t = fold_build2 (MULT_EXPR, fd->iter_type, t, | |
8720 | fold_convert (fd->iter_type, fd->loop.step)); | |
8721 | else if (bias) | |
550918ca | 8722 | t = fold_build2 (MINUS_EXPR, fd->iter_type, t, bias); |
d9a6bd32 | 8723 | if (fd->ordered && fd->collapse == 1) |
a68ab351 | 8724 | { |
d9a6bd32 JJ |
8725 | if (POINTER_TYPE_P (TREE_TYPE (startvar))) |
8726 | t = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (startvar), | |
8727 | fd->loop.n1, fold_convert (sizetype, t)); | |
8728 | else | |
8729 | { | |
8730 | t = fold_convert (TREE_TYPE (startvar), t); | |
8731 | t = fold_build2 (PLUS_EXPR, TREE_TYPE (startvar), | |
8732 | fd->loop.n1, t); | |
8733 | } | |
8734 | } | |
8735 | else | |
8736 | { | |
8737 | if (POINTER_TYPE_P (TREE_TYPE (startvar))) | |
8738 | t = fold_convert (signed_type_for (TREE_TYPE (startvar)), t); | |
8739 | t = fold_convert (TREE_TYPE (startvar), t); | |
8740 | } | |
8741 | iend = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
8742 | false, GSI_CONTINUE_LINKING); | |
8743 | if (endvar) | |
8744 | { | |
8745 | assign_stmt = gimple_build_assign (endvar, iend); | |
538dd0b7 | 8746 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); |
95782571 | 8747 | if (useless_type_conversion_p (TREE_TYPE (fd->loop.v), TREE_TYPE (iend))) |
538dd0b7 | 8748 | assign_stmt = gimple_build_assign (fd->loop.v, iend); |
95782571 | 8749 | else |
0d0e4a03 | 8750 | assign_stmt = gimple_build_assign (fd->loop.v, NOP_EXPR, iend); |
538dd0b7 | 8751 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); |
a68ab351 | 8752 | } |
d9a6bd32 JJ |
8753 | /* Handle linear clause adjustments. */ |
8754 | tree itercnt = NULL_TREE; | |
8755 | if (gimple_omp_for_kind (fd->for_stmt) == GF_OMP_FOR_KIND_FOR) | |
8756 | for (tree c = gimple_omp_for_clauses (fd->for_stmt); | |
8757 | c; c = OMP_CLAUSE_CHAIN (c)) | |
8758 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR | |
8759 | && !OMP_CLAUSE_LINEAR_NO_COPYIN (c)) | |
8760 | { | |
8761 | tree d = OMP_CLAUSE_DECL (c); | |
8762 | bool is_ref = is_reference (d); | |
8763 | tree t = d, a, dest; | |
8764 | if (is_ref) | |
8765 | t = build_simple_mem_ref_loc (OMP_CLAUSE_LOCATION (c), t); | |
8766 | tree type = TREE_TYPE (t); | |
8767 | if (POINTER_TYPE_P (type)) | |
8768 | type = sizetype; | |
8769 | dest = unshare_expr (t); | |
8770 | tree v = create_tmp_var (TREE_TYPE (t), NULL); | |
8771 | expand_omp_build_assign (&gsif, v, t); | |
8772 | if (itercnt == NULL_TREE) | |
8773 | { | |
8774 | itercnt = startvar; | |
8775 | tree n1 = fd->loop.n1; | |
8776 | if (POINTER_TYPE_P (TREE_TYPE (itercnt))) | |
8777 | { | |
8778 | itercnt | |
8779 | = fold_convert (signed_type_for (TREE_TYPE (itercnt)), | |
8780 | itercnt); | |
8781 | n1 = fold_convert (TREE_TYPE (itercnt), n1); | |
8782 | } | |
8783 | itercnt = fold_build2 (MINUS_EXPR, TREE_TYPE (itercnt), | |
8784 | itercnt, n1); | |
8785 | itercnt = fold_build2 (EXACT_DIV_EXPR, TREE_TYPE (itercnt), | |
8786 | itercnt, fd->loop.step); | |
8787 | itercnt = force_gimple_operand_gsi (&gsi, itercnt, true, | |
8788 | NULL_TREE, false, | |
8789 | GSI_CONTINUE_LINKING); | |
8790 | } | |
8791 | a = fold_build2 (MULT_EXPR, type, | |
8792 | fold_convert (type, itercnt), | |
8793 | fold_convert (type, OMP_CLAUSE_LINEAR_STEP (c))); | |
8794 | t = fold_build2 (type == TREE_TYPE (t) ? PLUS_EXPR | |
8795 | : POINTER_PLUS_EXPR, TREE_TYPE (t), v, a); | |
8796 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
8797 | false, GSI_CONTINUE_LINKING); | |
8798 | assign_stmt = gimple_build_assign (dest, t); | |
8799 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
8800 | } | |
74bf76ed | 8801 | if (fd->collapse > 1) |
acf0174b | 8802 | expand_omp_for_init_vars (fd, &gsi, counts, inner_stmt, startvar); |
50674e96 | 8803 | |
d9a6bd32 JJ |
8804 | if (fd->ordered) |
8805 | { | |
8806 | /* Until now, counts array contained number of iterations or | |
8807 | variable containing it for ith loop. From now on, we need | |
8808 | those counts only for collapsed loops, and only for the 2nd | |
8809 | till the last collapsed one. Move those one element earlier, | |
8810 | we'll use counts[fd->collapse - 1] for the first source/sink | |
8811 | iteration counter and so on and counts[fd->ordered] | |
8812 | as the array holding the current counter values for | |
8813 | depend(source). */ | |
8814 | if (fd->collapse > 1) | |
8815 | memmove (counts, counts + 1, (fd->collapse - 1) * sizeof (counts[0])); | |
8816 | if (broken_loop) | |
8817 | { | |
8818 | int i; | |
8819 | for (i = fd->collapse; i < fd->ordered; i++) | |
8820 | { | |
8821 | tree type = TREE_TYPE (fd->loops[i].v); | |
8822 | tree this_cond | |
8823 | = fold_build2 (fd->loops[i].cond_code, boolean_type_node, | |
8824 | fold_convert (type, fd->loops[i].n1), | |
8825 | fold_convert (type, fd->loops[i].n2)); | |
8826 | if (!integer_onep (this_cond)) | |
8827 | break; | |
8828 | } | |
8829 | if (i < fd->ordered) | |
8830 | { | |
8831 | cont_bb | |
8832 | = create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb); | |
8833 | add_bb_to_loop (cont_bb, l1_bb->loop_father); | |
8834 | gimple_stmt_iterator gsi = gsi_after_labels (cont_bb); | |
8835 | gimple *g = gimple_build_omp_continue (fd->loop.v, fd->loop.v); | |
8836 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
8837 | make_edge (cont_bb, l3_bb, EDGE_FALLTHRU); | |
8838 | make_edge (cont_bb, l1_bb, 0); | |
8839 | l2_bb = create_empty_bb (cont_bb); | |
8840 | broken_loop = false; | |
8841 | } | |
8842 | } | |
8843 | expand_omp_ordered_source_sink (region, fd, counts, cont_bb); | |
8844 | cont_bb = expand_omp_for_ordered_loops (fd, counts, cont_bb, l1_bb, | |
8845 | ordered_lastprivate); | |
8846 | if (counts[fd->collapse - 1]) | |
8847 | { | |
8848 | gcc_assert (fd->collapse == 1); | |
8849 | gsi = gsi_last_bb (l0_bb); | |
8850 | expand_omp_build_assign (&gsi, counts[fd->collapse - 1], | |
8851 | istart0, true); | |
8852 | gsi = gsi_last_bb (cont_bb); | |
8853 | t = fold_build2 (PLUS_EXPR, fd->iter_type, counts[fd->collapse - 1], | |
8854 | build_int_cst (fd->iter_type, 1)); | |
8855 | expand_omp_build_assign (&gsi, counts[fd->collapse - 1], t); | |
8856 | tree aref = build4 (ARRAY_REF, fd->iter_type, counts[fd->ordered], | |
8857 | size_zero_node, NULL_TREE, NULL_TREE); | |
8858 | expand_omp_build_assign (&gsi, aref, counts[fd->collapse - 1]); | |
8859 | t = counts[fd->collapse - 1]; | |
8860 | } | |
8861 | else if (fd->collapse > 1) | |
8862 | t = fd->loop.v; | |
8863 | else | |
8864 | { | |
8865 | t = fold_build2 (MINUS_EXPR, TREE_TYPE (fd->loops[0].v), | |
8866 | fd->loops[0].v, fd->loops[0].n1); | |
8867 | t = fold_convert (fd->iter_type, t); | |
8868 | } | |
8869 | gsi = gsi_last_bb (l0_bb); | |
8870 | tree aref = build4 (ARRAY_REF, fd->iter_type, counts[fd->ordered], | |
8871 | size_zero_node, NULL_TREE, NULL_TREE); | |
8872 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
8873 | false, GSI_CONTINUE_LINKING); | |
8874 | expand_omp_build_assign (&gsi, aref, t, true); | |
8875 | } | |
8876 | ||
e5c95afe | 8877 | if (!broken_loop) |
d3c673c7 | 8878 | { |
e5c95afe ZD |
8879 | /* Code to control the increment and predicate for the sequential |
8880 | loop goes in the CONT_BB. */ | |
726a989a | 8881 | gsi = gsi_last_bb (cont_bb); |
538dd0b7 DM |
8882 | gomp_continue *cont_stmt = as_a <gomp_continue *> (gsi_stmt (gsi)); |
8883 | gcc_assert (gimple_code (cont_stmt) == GIMPLE_OMP_CONTINUE); | |
8884 | vmain = gimple_omp_continue_control_use (cont_stmt); | |
8885 | vback = gimple_omp_continue_control_def (cont_stmt); | |
917948d3 | 8886 | |
acf0174b | 8887 | if (!gimple_omp_for_combined_p (fd->for_stmt)) |
74bf76ed JJ |
8888 | { |
8889 | if (POINTER_TYPE_P (type)) | |
8890 | t = fold_build_pointer_plus (vmain, fd->loop.step); | |
8891 | else | |
8892 | t = fold_build2 (PLUS_EXPR, type, vmain, fd->loop.step); | |
8893 | t = force_gimple_operand_gsi (&gsi, t, | |
8894 | DECL_P (vback) | |
8895 | && TREE_ADDRESSABLE (vback), | |
8896 | NULL_TREE, true, GSI_SAME_STMT); | |
538dd0b7 DM |
8897 | assign_stmt = gimple_build_assign (vback, t); |
8898 | gsi_insert_before (&gsi, assign_stmt, GSI_SAME_STMT); | |
74bf76ed | 8899 | |
d9a6bd32 JJ |
8900 | if (fd->ordered && counts[fd->collapse - 1] == NULL_TREE) |
8901 | { | |
8902 | if (fd->collapse > 1) | |
8903 | t = fd->loop.v; | |
8904 | else | |
8905 | { | |
8906 | t = fold_build2 (MINUS_EXPR, TREE_TYPE (fd->loops[0].v), | |
8907 | fd->loops[0].v, fd->loops[0].n1); | |
8908 | t = fold_convert (fd->iter_type, t); | |
8909 | } | |
8910 | tree aref = build4 (ARRAY_REF, fd->iter_type, | |
8911 | counts[fd->ordered], size_zero_node, | |
8912 | NULL_TREE, NULL_TREE); | |
8913 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
8914 | true, GSI_SAME_STMT); | |
8915 | expand_omp_build_assign (&gsi, aref, t); | |
8916 | } | |
8917 | ||
74bf76ed JJ |
8918 | t = build2 (fd->loop.cond_code, boolean_type_node, |
8919 | DECL_P (vback) && TREE_ADDRESSABLE (vback) ? t : vback, | |
8920 | iend); | |
538dd0b7 DM |
8921 | gcond *cond_stmt = gimple_build_cond_empty (t); |
8922 | gsi_insert_before (&gsi, cond_stmt, GSI_SAME_STMT); | |
74bf76ed | 8923 | } |
50674e96 | 8924 | |
726a989a RB |
8925 | /* Remove GIMPLE_OMP_CONTINUE. */ |
8926 | gsi_remove (&gsi, true); | |
50674e96 | 8927 | |
acf0174b | 8928 | if (fd->collapse > 1 && !gimple_omp_for_combined_p (fd->for_stmt)) |
74bf76ed | 8929 | collapse_bb = extract_omp_for_update_vars (fd, cont_bb, l1_bb); |
a68ab351 | 8930 | |
e5c95afe | 8931 | /* Emit code to get the next parallel iteration in L2_BB. */ |
726a989a | 8932 | gsi = gsi_start_bb (l2_bb); |
50674e96 | 8933 | |
e79983f4 | 8934 | t = build_call_expr (builtin_decl_explicit (next_fn), 2, |
e5c95afe ZD |
8935 | build_fold_addr_expr (istart0), |
8936 | build_fold_addr_expr (iend0)); | |
726a989a RB |
8937 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
8938 | false, GSI_CONTINUE_LINKING); | |
a68ab351 JJ |
8939 | if (TREE_TYPE (t) != boolean_type_node) |
8940 | t = fold_build2 (NE_EXPR, boolean_type_node, | |
8941 | t, build_int_cst (TREE_TYPE (t), 0)); | |
538dd0b7 DM |
8942 | gcond *cond_stmt = gimple_build_cond_empty (t); |
8943 | gsi_insert_after (&gsi, cond_stmt, GSI_CONTINUE_LINKING); | |
e5c95afe | 8944 | } |
953ff289 | 8945 | |
777f7f9a | 8946 | /* Add the loop cleanup function. */ |
726a989a RB |
8947 | gsi = gsi_last_bb (exit_bb); |
8948 | if (gimple_omp_return_nowait_p (gsi_stmt (gsi))) | |
e79983f4 | 8949 | t = builtin_decl_explicit (BUILT_IN_GOMP_LOOP_END_NOWAIT); |
acf0174b JJ |
8950 | else if (gimple_omp_return_lhs (gsi_stmt (gsi))) |
8951 | t = builtin_decl_explicit (BUILT_IN_GOMP_LOOP_END_CANCEL); | |
777f7f9a | 8952 | else |
e79983f4 | 8953 | t = builtin_decl_explicit (BUILT_IN_GOMP_LOOP_END); |
538dd0b7 | 8954 | gcall *call_stmt = gimple_build_call (t, 0); |
acf0174b | 8955 | if (gimple_omp_return_lhs (gsi_stmt (gsi))) |
538dd0b7 DM |
8956 | gimple_call_set_lhs (call_stmt, gimple_omp_return_lhs (gsi_stmt (gsi))); |
8957 | gsi_insert_after (&gsi, call_stmt, GSI_SAME_STMT); | |
d9a6bd32 JJ |
8958 | if (fd->ordered) |
8959 | { | |
8960 | tree arr = counts[fd->ordered]; | |
8961 | tree clobber = build_constructor (TREE_TYPE (arr), NULL); | |
8962 | TREE_THIS_VOLATILE (clobber) = 1; | |
8963 | gsi_insert_after (&gsi, gimple_build_assign (arr, clobber), | |
8964 | GSI_SAME_STMT); | |
8965 | } | |
726a989a | 8966 | gsi_remove (&gsi, true); |
50674e96 DN |
8967 | |
8968 | /* Connect the new blocks. */ | |
917948d3 ZD |
8969 | find_edge (entry_bb, l0_bb)->flags = EDGE_TRUE_VALUE; |
8970 | find_edge (entry_bb, l3_bb)->flags = EDGE_FALSE_VALUE; | |
953ff289 | 8971 | |
e5c95afe ZD |
8972 | if (!broken_loop) |
8973 | { | |
726a989a RB |
8974 | gimple_seq phis; |
8975 | ||
917948d3 ZD |
8976 | e = find_edge (cont_bb, l3_bb); |
8977 | ne = make_edge (l2_bb, l3_bb, EDGE_FALSE_VALUE); | |
8978 | ||
726a989a RB |
8979 | phis = phi_nodes (l3_bb); |
8980 | for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi)) | |
8981 | { | |
355fe088 | 8982 | gimple *phi = gsi_stmt (gsi); |
726a989a RB |
8983 | SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, ne), |
8984 | PHI_ARG_DEF_FROM_EDGE (phi, e)); | |
8985 | } | |
917948d3 ZD |
8986 | remove_edge (e); |
8987 | ||
e5c95afe | 8988 | make_edge (cont_bb, l2_bb, EDGE_FALSE_VALUE); |
74bf76ed | 8989 | e = find_edge (cont_bb, l1_bb); |
7aab672f TV |
8990 | if (e == NULL) |
8991 | { | |
8992 | e = BRANCH_EDGE (cont_bb); | |
8993 | gcc_assert (single_succ (e->dest) == l1_bb); | |
8994 | } | |
acf0174b JJ |
8995 | if (gimple_omp_for_combined_p (fd->for_stmt)) |
8996 | { | |
8997 | remove_edge (e); | |
8998 | e = NULL; | |
8999 | } | |
74bf76ed | 9000 | else if (fd->collapse > 1) |
a68ab351 | 9001 | { |
a68ab351 JJ |
9002 | remove_edge (e); |
9003 | e = make_edge (cont_bb, collapse_bb, EDGE_TRUE_VALUE); | |
9004 | } | |
9005 | else | |
74bf76ed JJ |
9006 | e->flags = EDGE_TRUE_VALUE; |
9007 | if (e) | |
a68ab351 | 9008 | { |
74bf76ed JJ |
9009 | e->probability = REG_BR_PROB_BASE * 7 / 8; |
9010 | find_edge (cont_bb, l2_bb)->probability = REG_BR_PROB_BASE / 8; | |
9011 | } | |
9012 | else | |
9013 | { | |
9014 | e = find_edge (cont_bb, l2_bb); | |
9015 | e->flags = EDGE_FALLTHRU; | |
a68ab351 | 9016 | } |
e5c95afe | 9017 | make_edge (l2_bb, l0_bb, EDGE_TRUE_VALUE); |
917948d3 | 9018 | |
56102c7f TV |
9019 | if (gimple_in_ssa_p (cfun)) |
9020 | { | |
9021 | /* Add phis to the outer loop that connect to the phis in the inner, | |
9022 | original loop, and move the loop entry value of the inner phi to | |
9023 | the loop entry value of the outer phi. */ | |
9024 | gphi_iterator psi; | |
9025 | for (psi = gsi_start_phis (l3_bb); !gsi_end_p (psi); gsi_next (&psi)) | |
9026 | { | |
9027 | source_location locus; | |
9028 | gphi *nphi; | |
9029 | gphi *exit_phi = psi.phi (); | |
9030 | ||
9031 | edge l2_to_l3 = find_edge (l2_bb, l3_bb); | |
9032 | tree exit_res = PHI_ARG_DEF_FROM_EDGE (exit_phi, l2_to_l3); | |
9033 | ||
9034 | basic_block latch = BRANCH_EDGE (cont_bb)->dest; | |
9035 | edge latch_to_l1 = find_edge (latch, l1_bb); | |
9036 | gphi *inner_phi | |
9037 | = find_phi_with_arg_on_edge (exit_res, latch_to_l1); | |
9038 | ||
9039 | tree t = gimple_phi_result (exit_phi); | |
9040 | tree new_res = copy_ssa_name (t, NULL); | |
9041 | nphi = create_phi_node (new_res, l0_bb); | |
9042 | ||
9043 | edge l0_to_l1 = find_edge (l0_bb, l1_bb); | |
9044 | t = PHI_ARG_DEF_FROM_EDGE (inner_phi, l0_to_l1); | |
9045 | locus = gimple_phi_arg_location_from_edge (inner_phi, l0_to_l1); | |
9046 | edge entry_to_l0 = find_edge (entry_bb, l0_bb); | |
9047 | add_phi_arg (nphi, t, entry_to_l0, locus); | |
9048 | ||
9049 | edge l2_to_l0 = find_edge (l2_bb, l0_bb); | |
9050 | add_phi_arg (nphi, exit_res, l2_to_l0, UNKNOWN_LOCATION); | |
9051 | ||
9052 | add_phi_arg (inner_phi, new_res, l0_to_l1, UNKNOWN_LOCATION); | |
9053 | }; | |
9054 | } | |
9055 | ||
917948d3 ZD |
9056 | set_immediate_dominator (CDI_DOMINATORS, l2_bb, |
9057 | recompute_dominator (CDI_DOMINATORS, l2_bb)); | |
9058 | set_immediate_dominator (CDI_DOMINATORS, l3_bb, | |
9059 | recompute_dominator (CDI_DOMINATORS, l3_bb)); | |
9060 | set_immediate_dominator (CDI_DOMINATORS, l0_bb, | |
9061 | recompute_dominator (CDI_DOMINATORS, l0_bb)); | |
9062 | set_immediate_dominator (CDI_DOMINATORS, l1_bb, | |
9063 | recompute_dominator (CDI_DOMINATORS, l1_bb)); | |
6093bc06 | 9064 | |
7fd103ef TV |
9065 | /* We enter expand_omp_for_generic with a loop. This original loop may |
9066 | have its own loop struct, or it may be part of an outer loop struct | |
9067 | (which may be the fake loop). */ | |
9068 | struct loop *outer_loop = entry_bb->loop_father; | |
9069 | bool orig_loop_has_loop_struct = l1_bb->loop_father != outer_loop; | |
9070 | ||
9071 | add_bb_to_loop (l2_bb, outer_loop); | |
9072 | ||
9073 | /* We've added a new loop around the original loop. Allocate the | |
9074 | corresponding loop struct. */ | |
9075 | struct loop *new_loop = alloc_loop (); | |
9076 | new_loop->header = l0_bb; | |
9077 | new_loop->latch = l2_bb; | |
9078 | add_loop (new_loop, outer_loop); | |
9079 | ||
9080 | /* Allocate a loop structure for the original loop unless we already | |
9081 | had one. */ | |
9082 | if (!orig_loop_has_loop_struct | |
9083 | && !gimple_omp_for_combined_p (fd->for_stmt)) | |
74bf76ed | 9084 | { |
7fd103ef TV |
9085 | struct loop *orig_loop = alloc_loop (); |
9086 | orig_loop->header = l1_bb; | |
74bf76ed | 9087 | /* The loop may have multiple latches. */ |
7fd103ef | 9088 | add_loop (orig_loop, new_loop); |
74bf76ed | 9089 | } |
e5c95afe | 9090 | } |
953ff289 DN |
9091 | } |
9092 | ||
9093 | ||
50674e96 DN |
9094 | /* A subroutine of expand_omp_for. Generate code for a parallel |
9095 | loop with static schedule and no specified chunk size. Given | |
9096 | parameters: | |
953ff289 DN |
9097 | |
9098 | for (V = N1; V cond N2; V += STEP) BODY; | |
9099 | ||
9100 | where COND is "<" or ">", we generate pseudocode | |
9101 | ||
5a0f4dd3 | 9102 | if ((__typeof (V)) -1 > 0 && N2 cond N1) goto L2; |
953ff289 DN |
9103 | if (cond is <) |
9104 | adj = STEP - 1; | |
9105 | else | |
9106 | adj = STEP + 1; | |
a68ab351 JJ |
9107 | if ((__typeof (V)) -1 > 0 && cond is >) |
9108 | n = -(adj + N2 - N1) / -STEP; | |
9109 | else | |
9110 | n = (adj + N2 - N1) / STEP; | |
953ff289 | 9111 | q = n / nthreads; |
fb79f500 JJ |
9112 | tt = n % nthreads; |
9113 | if (threadid < tt) goto L3; else goto L4; | |
9114 | L3: | |
9115 | tt = 0; | |
9116 | q = q + 1; | |
9117 | L4: | |
9118 | s0 = q * threadid + tt; | |
9119 | e0 = s0 + q; | |
917948d3 | 9120 | V = s0 * STEP + N1; |
953ff289 DN |
9121 | if (s0 >= e0) goto L2; else goto L0; |
9122 | L0: | |
953ff289 DN |
9123 | e = e0 * STEP + N1; |
9124 | L1: | |
9125 | BODY; | |
9126 | V += STEP; | |
9127 | if (V cond e) goto L1; | |
953ff289 DN |
9128 | L2: |
9129 | */ | |
9130 | ||
777f7f9a | 9131 | static void |
50674e96 | 9132 | expand_omp_for_static_nochunk (struct omp_region *region, |
acf0174b | 9133 | struct omp_for_data *fd, |
355fe088 | 9134 | gimple *inner_stmt) |
953ff289 | 9135 | { |
fb79f500 | 9136 | tree n, q, s0, e0, e, t, tt, nthreads, threadid; |
a68ab351 | 9137 | tree type, itype, vmain, vback; |
fb79f500 | 9138 | basic_block entry_bb, second_bb, third_bb, exit_bb, seq_start_bb; |
acf0174b | 9139 | basic_block body_bb, cont_bb, collapse_bb = NULL; |
777f7f9a | 9140 | basic_block fin_bb; |
726a989a | 9141 | gimple_stmt_iterator gsi; |
fb79f500 | 9142 | edge ep; |
acf0174b JJ |
9143 | bool broken_loop = region->cont == NULL; |
9144 | tree *counts = NULL; | |
9145 | tree n1, n2, step; | |
953ff289 | 9146 | |
a68ab351 JJ |
9147 | itype = type = TREE_TYPE (fd->loop.v); |
9148 | if (POINTER_TYPE_P (type)) | |
96f9265a | 9149 | itype = signed_type_for (type); |
953ff289 | 9150 | |
777f7f9a | 9151 | entry_bb = region->entry; |
777f7f9a | 9152 | cont_bb = region->cont; |
e5c95afe | 9153 | gcc_assert (EDGE_COUNT (entry_bb->succs) == 2); |
acf0174b JJ |
9154 | fin_bb = BRANCH_EDGE (entry_bb)->dest; |
9155 | gcc_assert (broken_loop | |
9156 | || (fin_bb == FALLTHRU_EDGE (cont_bb)->dest)); | |
e5c95afe ZD |
9157 | seq_start_bb = split_edge (FALLTHRU_EDGE (entry_bb)); |
9158 | body_bb = single_succ (seq_start_bb); | |
acf0174b JJ |
9159 | if (!broken_loop) |
9160 | { | |
e67d7a1e TV |
9161 | gcc_assert (BRANCH_EDGE (cont_bb)->dest == body_bb |
9162 | || single_succ (BRANCH_EDGE (cont_bb)->dest) == body_bb); | |
acf0174b JJ |
9163 | gcc_assert (EDGE_COUNT (cont_bb->succs) == 2); |
9164 | } | |
777f7f9a RH |
9165 | exit_bb = region->exit; |
9166 | ||
50674e96 | 9167 | /* Iteration space partitioning goes in ENTRY_BB. */ |
726a989a RB |
9168 | gsi = gsi_last_bb (entry_bb); |
9169 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_FOR); | |
777f7f9a | 9170 | |
acf0174b JJ |
9171 | if (fd->collapse > 1) |
9172 | { | |
d9a6bd32 JJ |
9173 | int first_zero_iter = -1, dummy = -1; |
9174 | basic_block l2_dom_bb = NULL, dummy_bb = NULL; | |
acf0174b JJ |
9175 | |
9176 | counts = XALLOCAVEC (tree, fd->collapse); | |
9177 | expand_omp_for_init_counts (fd, &gsi, entry_bb, counts, | |
9178 | fin_bb, first_zero_iter, | |
d9a6bd32 | 9179 | dummy_bb, dummy, l2_dom_bb); |
acf0174b JJ |
9180 | t = NULL_TREE; |
9181 | } | |
9182 | else if (gimple_omp_for_combined_into_p (fd->for_stmt)) | |
9183 | t = integer_one_node; | |
9184 | else | |
9185 | t = fold_binary (fd->loop.cond_code, boolean_type_node, | |
9186 | fold_convert (type, fd->loop.n1), | |
9187 | fold_convert (type, fd->loop.n2)); | |
9188 | if (fd->collapse == 1 | |
9189 | && TYPE_UNSIGNED (type) | |
5a0f4dd3 JJ |
9190 | && (t == NULL_TREE || !integer_onep (t))) |
9191 | { | |
5a0f4dd3 JJ |
9192 | n1 = fold_convert (type, unshare_expr (fd->loop.n1)); |
9193 | n1 = force_gimple_operand_gsi (&gsi, n1, true, NULL_TREE, | |
9194 | true, GSI_SAME_STMT); | |
9195 | n2 = fold_convert (type, unshare_expr (fd->loop.n2)); | |
9196 | n2 = force_gimple_operand_gsi (&gsi, n2, true, NULL_TREE, | |
9197 | true, GSI_SAME_STMT); | |
538dd0b7 DM |
9198 | gcond *cond_stmt = gimple_build_cond (fd->loop.cond_code, n1, n2, |
9199 | NULL_TREE, NULL_TREE); | |
9200 | gsi_insert_before (&gsi, cond_stmt, GSI_SAME_STMT); | |
9201 | if (walk_tree (gimple_cond_lhs_ptr (cond_stmt), | |
5a0f4dd3 | 9202 | expand_omp_regimplify_p, NULL, NULL) |
538dd0b7 | 9203 | || walk_tree (gimple_cond_rhs_ptr (cond_stmt), |
5a0f4dd3 JJ |
9204 | expand_omp_regimplify_p, NULL, NULL)) |
9205 | { | |
538dd0b7 DM |
9206 | gsi = gsi_for_stmt (cond_stmt); |
9207 | gimple_regimplify_operands (cond_stmt, &gsi); | |
5a0f4dd3 | 9208 | } |
538dd0b7 | 9209 | ep = split_block (entry_bb, cond_stmt); |
5a0f4dd3 JJ |
9210 | ep->flags = EDGE_TRUE_VALUE; |
9211 | entry_bb = ep->dest; | |
9212 | ep->probability = REG_BR_PROB_BASE - (REG_BR_PROB_BASE / 2000 - 1); | |
9213 | ep = make_edge (ep->src, fin_bb, EDGE_FALSE_VALUE); | |
9214 | ep->probability = REG_BR_PROB_BASE / 2000 - 1; | |
9215 | if (gimple_in_ssa_p (cfun)) | |
9216 | { | |
9217 | int dest_idx = find_edge (entry_bb, fin_bb)->dest_idx; | |
538dd0b7 DM |
9218 | for (gphi_iterator gpi = gsi_start_phis (fin_bb); |
9219 | !gsi_end_p (gpi); gsi_next (&gpi)) | |
5a0f4dd3 | 9220 | { |
538dd0b7 | 9221 | gphi *phi = gpi.phi (); |
5a0f4dd3 JJ |
9222 | add_phi_arg (phi, gimple_phi_arg_def (phi, dest_idx), |
9223 | ep, UNKNOWN_LOCATION); | |
9224 | } | |
9225 | } | |
9226 | gsi = gsi_last_bb (entry_bb); | |
9227 | } | |
9228 | ||
41dbbb37 TS |
9229 | switch (gimple_omp_for_kind (fd->for_stmt)) |
9230 | { | |
9231 | case GF_OMP_FOR_KIND_FOR: | |
9232 | nthreads = builtin_decl_explicit (BUILT_IN_OMP_GET_NUM_THREADS); | |
9233 | threadid = builtin_decl_explicit (BUILT_IN_OMP_GET_THREAD_NUM); | |
9234 | break; | |
9235 | case GF_OMP_FOR_KIND_DISTRIBUTE: | |
9236 | nthreads = builtin_decl_explicit (BUILT_IN_OMP_GET_NUM_TEAMS); | |
9237 | threadid = builtin_decl_explicit (BUILT_IN_OMP_GET_TEAM_NUM); | |
9238 | break; | |
41dbbb37 TS |
9239 | default: |
9240 | gcc_unreachable (); | |
9241 | } | |
9242 | nthreads = build_call_expr (nthreads, 0); | |
9243 | nthreads = fold_convert (itype, nthreads); | |
9244 | nthreads = force_gimple_operand_gsi (&gsi, nthreads, true, NULL_TREE, | |
726a989a | 9245 | true, GSI_SAME_STMT); |
41dbbb37 TS |
9246 | threadid = build_call_expr (threadid, 0); |
9247 | threadid = fold_convert (itype, threadid); | |
9248 | threadid = force_gimple_operand_gsi (&gsi, threadid, true, NULL_TREE, | |
726a989a | 9249 | true, GSI_SAME_STMT); |
953ff289 | 9250 | |
acf0174b JJ |
9251 | n1 = fd->loop.n1; |
9252 | n2 = fd->loop.n2; | |
9253 | step = fd->loop.step; | |
9254 | if (gimple_omp_for_combined_into_p (fd->for_stmt)) | |
9255 | { | |
9256 | tree innerc = find_omp_clause (gimple_omp_for_clauses (fd->for_stmt), | |
9257 | OMP_CLAUSE__LOOPTEMP_); | |
9258 | gcc_assert (innerc); | |
9259 | n1 = OMP_CLAUSE_DECL (innerc); | |
9260 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
9261 | OMP_CLAUSE__LOOPTEMP_); | |
9262 | gcc_assert (innerc); | |
9263 | n2 = OMP_CLAUSE_DECL (innerc); | |
9264 | } | |
9265 | n1 = force_gimple_operand_gsi (&gsi, fold_convert (type, n1), | |
9266 | true, NULL_TREE, true, GSI_SAME_STMT); | |
9267 | n2 = force_gimple_operand_gsi (&gsi, fold_convert (itype, n2), | |
9268 | true, NULL_TREE, true, GSI_SAME_STMT); | |
9269 | step = force_gimple_operand_gsi (&gsi, fold_convert (itype, step), | |
9270 | true, NULL_TREE, true, GSI_SAME_STMT); | |
a68ab351 JJ |
9271 | |
9272 | t = build_int_cst (itype, (fd->loop.cond_code == LT_EXPR ? -1 : 1)); | |
acf0174b JJ |
9273 | t = fold_build2 (PLUS_EXPR, itype, step, t); |
9274 | t = fold_build2 (PLUS_EXPR, itype, t, n2); | |
9275 | t = fold_build2 (MINUS_EXPR, itype, t, fold_convert (itype, n1)); | |
a68ab351 JJ |
9276 | if (TYPE_UNSIGNED (itype) && fd->loop.cond_code == GT_EXPR) |
9277 | t = fold_build2 (TRUNC_DIV_EXPR, itype, | |
9278 | fold_build1 (NEGATE_EXPR, itype, t), | |
acf0174b | 9279 | fold_build1 (NEGATE_EXPR, itype, step)); |
a68ab351 | 9280 | else |
acf0174b | 9281 | t = fold_build2 (TRUNC_DIV_EXPR, itype, t, step); |
a68ab351 | 9282 | t = fold_convert (itype, t); |
726a989a | 9283 | n = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, true, GSI_SAME_STMT); |
953ff289 | 9284 | |
7cc434a3 | 9285 | q = create_tmp_reg (itype, "q"); |
a68ab351 | 9286 | t = fold_build2 (TRUNC_DIV_EXPR, itype, n, nthreads); |
fb79f500 JJ |
9287 | t = force_gimple_operand_gsi (&gsi, t, false, NULL_TREE, true, GSI_SAME_STMT); |
9288 | gsi_insert_before (&gsi, gimple_build_assign (q, t), GSI_SAME_STMT); | |
9289 | ||
7cc434a3 | 9290 | tt = create_tmp_reg (itype, "tt"); |
fb79f500 JJ |
9291 | t = fold_build2 (TRUNC_MOD_EXPR, itype, n, nthreads); |
9292 | t = force_gimple_operand_gsi (&gsi, t, false, NULL_TREE, true, GSI_SAME_STMT); | |
9293 | gsi_insert_before (&gsi, gimple_build_assign (tt, t), GSI_SAME_STMT); | |
953ff289 | 9294 | |
fb79f500 | 9295 | t = build2 (LT_EXPR, boolean_type_node, threadid, tt); |
538dd0b7 DM |
9296 | gcond *cond_stmt = gimple_build_cond_empty (t); |
9297 | gsi_insert_before (&gsi, cond_stmt, GSI_SAME_STMT); | |
fb79f500 | 9298 | |
538dd0b7 | 9299 | second_bb = split_block (entry_bb, cond_stmt)->dest; |
fb79f500 JJ |
9300 | gsi = gsi_last_bb (second_bb); |
9301 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_FOR); | |
9302 | ||
9303 | gsi_insert_before (&gsi, gimple_build_assign (tt, build_int_cst (itype, 0)), | |
9304 | GSI_SAME_STMT); | |
538dd0b7 | 9305 | gassign *assign_stmt |
0d0e4a03 | 9306 | = gimple_build_assign (q, PLUS_EXPR, q, build_int_cst (itype, 1)); |
538dd0b7 | 9307 | gsi_insert_before (&gsi, assign_stmt, GSI_SAME_STMT); |
fb79f500 | 9308 | |
538dd0b7 | 9309 | third_bb = split_block (second_bb, assign_stmt)->dest; |
fb79f500 JJ |
9310 | gsi = gsi_last_bb (third_bb); |
9311 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_FOR); | |
953ff289 | 9312 | |
a68ab351 | 9313 | t = build2 (MULT_EXPR, itype, q, threadid); |
fb79f500 | 9314 | t = build2 (PLUS_EXPR, itype, t, tt); |
726a989a | 9315 | s0 = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, true, GSI_SAME_STMT); |
953ff289 | 9316 | |
a68ab351 | 9317 | t = fold_build2 (PLUS_EXPR, itype, s0, q); |
726a989a | 9318 | e0 = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, true, GSI_SAME_STMT); |
917948d3 | 9319 | |
953ff289 | 9320 | t = build2 (GE_EXPR, boolean_type_node, s0, e0); |
726a989a | 9321 | gsi_insert_before (&gsi, gimple_build_cond_empty (t), GSI_SAME_STMT); |
50674e96 | 9322 | |
726a989a RB |
9323 | /* Remove the GIMPLE_OMP_FOR statement. */ |
9324 | gsi_remove (&gsi, true); | |
50674e96 DN |
9325 | |
9326 | /* Setup code for sequential iteration goes in SEQ_START_BB. */ | |
726a989a | 9327 | gsi = gsi_start_bb (seq_start_bb); |
953ff289 | 9328 | |
acf0174b JJ |
9329 | tree startvar = fd->loop.v; |
9330 | tree endvar = NULL_TREE; | |
9331 | ||
9332 | if (gimple_omp_for_combined_p (fd->for_stmt)) | |
9333 | { | |
9334 | tree clauses = gimple_code (inner_stmt) == GIMPLE_OMP_PARALLEL | |
9335 | ? gimple_omp_parallel_clauses (inner_stmt) | |
9336 | : gimple_omp_for_clauses (inner_stmt); | |
9337 | tree innerc = find_omp_clause (clauses, OMP_CLAUSE__LOOPTEMP_); | |
9338 | gcc_assert (innerc); | |
9339 | startvar = OMP_CLAUSE_DECL (innerc); | |
9340 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
9341 | OMP_CLAUSE__LOOPTEMP_); | |
9342 | gcc_assert (innerc); | |
9343 | endvar = OMP_CLAUSE_DECL (innerc); | |
e01d41e5 JJ |
9344 | if (fd->collapse > 1 && TREE_CODE (fd->loop.n2) != INTEGER_CST |
9345 | && gimple_omp_for_kind (fd->for_stmt) == GF_OMP_FOR_KIND_DISTRIBUTE) | |
9346 | { | |
9347 | int i; | |
9348 | for (i = 1; i < fd->collapse; i++) | |
9349 | { | |
9350 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
9351 | OMP_CLAUSE__LOOPTEMP_); | |
9352 | gcc_assert (innerc); | |
9353 | } | |
9354 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
9355 | OMP_CLAUSE__LOOPTEMP_); | |
9356 | if (innerc) | |
9357 | { | |
9358 | /* If needed (distribute parallel for with lastprivate), | |
9359 | propagate down the total number of iterations. */ | |
9360 | tree t = fold_convert (TREE_TYPE (OMP_CLAUSE_DECL (innerc)), | |
9361 | fd->loop.n2); | |
9362 | t = force_gimple_operand_gsi (&gsi, t, false, NULL_TREE, false, | |
9363 | GSI_CONTINUE_LINKING); | |
9364 | assign_stmt = gimple_build_assign (OMP_CLAUSE_DECL (innerc), t); | |
9365 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
9366 | } | |
9367 | } | |
acf0174b | 9368 | } |
a68ab351 | 9369 | t = fold_convert (itype, s0); |
acf0174b | 9370 | t = fold_build2 (MULT_EXPR, itype, t, step); |
a68ab351 | 9371 | if (POINTER_TYPE_P (type)) |
acf0174b | 9372 | t = fold_build_pointer_plus (n1, t); |
a68ab351 | 9373 | else |
acf0174b JJ |
9374 | t = fold_build2 (PLUS_EXPR, type, t, n1); |
9375 | t = fold_convert (TREE_TYPE (startvar), t); | |
ea3a0fde | 9376 | t = force_gimple_operand_gsi (&gsi, t, |
acf0174b JJ |
9377 | DECL_P (startvar) |
9378 | && TREE_ADDRESSABLE (startvar), | |
ea3a0fde | 9379 | NULL_TREE, false, GSI_CONTINUE_LINKING); |
538dd0b7 DM |
9380 | assign_stmt = gimple_build_assign (startvar, t); |
9381 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
b8698a0f | 9382 | |
a68ab351 | 9383 | t = fold_convert (itype, e0); |
acf0174b | 9384 | t = fold_build2 (MULT_EXPR, itype, t, step); |
a68ab351 | 9385 | if (POINTER_TYPE_P (type)) |
acf0174b | 9386 | t = fold_build_pointer_plus (n1, t); |
a68ab351 | 9387 | else |
acf0174b JJ |
9388 | t = fold_build2 (PLUS_EXPR, type, t, n1); |
9389 | t = fold_convert (TREE_TYPE (startvar), t); | |
726a989a RB |
9390 | e = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
9391 | false, GSI_CONTINUE_LINKING); | |
acf0174b JJ |
9392 | if (endvar) |
9393 | { | |
538dd0b7 DM |
9394 | assign_stmt = gimple_build_assign (endvar, e); |
9395 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
95782571 | 9396 | if (useless_type_conversion_p (TREE_TYPE (fd->loop.v), TREE_TYPE (e))) |
538dd0b7 | 9397 | assign_stmt = gimple_build_assign (fd->loop.v, e); |
95782571 | 9398 | else |
0d0e4a03 | 9399 | assign_stmt = gimple_build_assign (fd->loop.v, NOP_EXPR, e); |
538dd0b7 | 9400 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); |
acf0174b | 9401 | } |
d9a6bd32 JJ |
9402 | /* Handle linear clause adjustments. */ |
9403 | tree itercnt = NULL_TREE; | |
9404 | if (gimple_omp_for_kind (fd->for_stmt) == GF_OMP_FOR_KIND_FOR) | |
9405 | for (tree c = gimple_omp_for_clauses (fd->for_stmt); | |
9406 | c; c = OMP_CLAUSE_CHAIN (c)) | |
9407 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR | |
9408 | && !OMP_CLAUSE_LINEAR_NO_COPYIN (c)) | |
9409 | { | |
9410 | tree d = OMP_CLAUSE_DECL (c); | |
9411 | bool is_ref = is_reference (d); | |
9412 | tree t = d, a, dest; | |
9413 | if (is_ref) | |
9414 | t = build_simple_mem_ref_loc (OMP_CLAUSE_LOCATION (c), t); | |
9415 | if (itercnt == NULL_TREE) | |
9416 | { | |
9417 | if (gimple_omp_for_combined_into_p (fd->for_stmt)) | |
9418 | { | |
9419 | itercnt = fold_build2 (MINUS_EXPR, itype, | |
9420 | fold_convert (itype, n1), | |
9421 | fold_convert (itype, fd->loop.n1)); | |
9422 | itercnt = fold_build2 (EXACT_DIV_EXPR, itype, itercnt, step); | |
9423 | itercnt = fold_build2 (PLUS_EXPR, itype, itercnt, s0); | |
9424 | itercnt = force_gimple_operand_gsi (&gsi, itercnt, true, | |
9425 | NULL_TREE, false, | |
9426 | GSI_CONTINUE_LINKING); | |
9427 | } | |
9428 | else | |
9429 | itercnt = s0; | |
9430 | } | |
9431 | tree type = TREE_TYPE (t); | |
9432 | if (POINTER_TYPE_P (type)) | |
9433 | type = sizetype; | |
9434 | a = fold_build2 (MULT_EXPR, type, | |
9435 | fold_convert (type, itercnt), | |
9436 | fold_convert (type, OMP_CLAUSE_LINEAR_STEP (c))); | |
9437 | dest = unshare_expr (t); | |
9438 | t = fold_build2 (type == TREE_TYPE (t) ? PLUS_EXPR | |
9439 | : POINTER_PLUS_EXPR, TREE_TYPE (t), t, a); | |
9440 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
9441 | false, GSI_CONTINUE_LINKING); | |
9442 | assign_stmt = gimple_build_assign (dest, t); | |
9443 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
9444 | } | |
acf0174b JJ |
9445 | if (fd->collapse > 1) |
9446 | expand_omp_for_init_vars (fd, &gsi, counts, inner_stmt, startvar); | |
953ff289 | 9447 | |
acf0174b JJ |
9448 | if (!broken_loop) |
9449 | { | |
9450 | /* The code controlling the sequential loop replaces the | |
9451 | GIMPLE_OMP_CONTINUE. */ | |
9452 | gsi = gsi_last_bb (cont_bb); | |
538dd0b7 DM |
9453 | gomp_continue *cont_stmt = as_a <gomp_continue *> (gsi_stmt (gsi)); |
9454 | gcc_assert (gimple_code (cont_stmt) == GIMPLE_OMP_CONTINUE); | |
9455 | vmain = gimple_omp_continue_control_use (cont_stmt); | |
9456 | vback = gimple_omp_continue_control_def (cont_stmt); | |
917948d3 | 9457 | |
acf0174b JJ |
9458 | if (!gimple_omp_for_combined_p (fd->for_stmt)) |
9459 | { | |
9460 | if (POINTER_TYPE_P (type)) | |
9461 | t = fold_build_pointer_plus (vmain, step); | |
9462 | else | |
9463 | t = fold_build2 (PLUS_EXPR, type, vmain, step); | |
9464 | t = force_gimple_operand_gsi (&gsi, t, | |
9465 | DECL_P (vback) | |
9466 | && TREE_ADDRESSABLE (vback), | |
9467 | NULL_TREE, true, GSI_SAME_STMT); | |
538dd0b7 DM |
9468 | assign_stmt = gimple_build_assign (vback, t); |
9469 | gsi_insert_before (&gsi, assign_stmt, GSI_SAME_STMT); | |
917948d3 | 9470 | |
acf0174b JJ |
9471 | t = build2 (fd->loop.cond_code, boolean_type_node, |
9472 | DECL_P (vback) && TREE_ADDRESSABLE (vback) | |
9473 | ? t : vback, e); | |
9474 | gsi_insert_before (&gsi, gimple_build_cond_empty (t), GSI_SAME_STMT); | |
9475 | } | |
953ff289 | 9476 | |
acf0174b JJ |
9477 | /* Remove the GIMPLE_OMP_CONTINUE statement. */ |
9478 | gsi_remove (&gsi, true); | |
9479 | ||
9480 | if (fd->collapse > 1 && !gimple_omp_for_combined_p (fd->for_stmt)) | |
9481 | collapse_bb = extract_omp_for_update_vars (fd, cont_bb, body_bb); | |
9482 | } | |
50674e96 | 9483 | |
726a989a RB |
9484 | /* Replace the GIMPLE_OMP_RETURN with a barrier, or nothing. */ |
9485 | gsi = gsi_last_bb (exit_bb); | |
9486 | if (!gimple_omp_return_nowait_p (gsi_stmt (gsi))) | |
acf0174b JJ |
9487 | { |
9488 | t = gimple_omp_return_lhs (gsi_stmt (gsi)); | |
e4834818 | 9489 | gsi_insert_after (&gsi, build_omp_barrier (t), GSI_SAME_STMT); |
acf0174b | 9490 | } |
726a989a | 9491 | gsi_remove (&gsi, true); |
50674e96 DN |
9492 | |
9493 | /* Connect all the blocks. */ | |
fb79f500 JJ |
9494 | ep = make_edge (entry_bb, third_bb, EDGE_FALSE_VALUE); |
9495 | ep->probability = REG_BR_PROB_BASE / 4 * 3; | |
9496 | ep = find_edge (entry_bb, second_bb); | |
9497 | ep->flags = EDGE_TRUE_VALUE; | |
9498 | ep->probability = REG_BR_PROB_BASE / 4; | |
9499 | find_edge (third_bb, seq_start_bb)->flags = EDGE_FALSE_VALUE; | |
9500 | find_edge (third_bb, fin_bb)->flags = EDGE_TRUE_VALUE; | |
917948d3 | 9501 | |
acf0174b JJ |
9502 | if (!broken_loop) |
9503 | { | |
9504 | ep = find_edge (cont_bb, body_bb); | |
e67d7a1e TV |
9505 | if (ep == NULL) |
9506 | { | |
9507 | ep = BRANCH_EDGE (cont_bb); | |
9508 | gcc_assert (single_succ (ep->dest) == body_bb); | |
9509 | } | |
acf0174b JJ |
9510 | if (gimple_omp_for_combined_p (fd->for_stmt)) |
9511 | { | |
9512 | remove_edge (ep); | |
9513 | ep = NULL; | |
9514 | } | |
9515 | else if (fd->collapse > 1) | |
9516 | { | |
9517 | remove_edge (ep); | |
9518 | ep = make_edge (cont_bb, collapse_bb, EDGE_TRUE_VALUE); | |
9519 | } | |
9520 | else | |
9521 | ep->flags = EDGE_TRUE_VALUE; | |
9522 | find_edge (cont_bb, fin_bb)->flags | |
9523 | = ep ? EDGE_FALSE_VALUE : EDGE_FALLTHRU; | |
9524 | } | |
b8698a0f | 9525 | |
fb79f500 JJ |
9526 | set_immediate_dominator (CDI_DOMINATORS, second_bb, entry_bb); |
9527 | set_immediate_dominator (CDI_DOMINATORS, third_bb, entry_bb); | |
9528 | set_immediate_dominator (CDI_DOMINATORS, seq_start_bb, third_bb); | |
acf0174b | 9529 | |
917948d3 ZD |
9530 | set_immediate_dominator (CDI_DOMINATORS, body_bb, |
9531 | recompute_dominator (CDI_DOMINATORS, body_bb)); | |
9532 | set_immediate_dominator (CDI_DOMINATORS, fin_bb, | |
9533 | recompute_dominator (CDI_DOMINATORS, fin_bb)); | |
6093bc06 | 9534 | |
e67d7a1e TV |
9535 | struct loop *loop = body_bb->loop_father; |
9536 | if (loop != entry_bb->loop_father) | |
9537 | { | |
9538 | gcc_assert (loop->header == body_bb); | |
9539 | gcc_assert (broken_loop | |
9540 | || loop->latch == region->cont | |
9541 | || single_pred (loop->latch) == region->cont); | |
9542 | return; | |
9543 | } | |
9544 | ||
acf0174b JJ |
9545 | if (!broken_loop && !gimple_omp_for_combined_p (fd->for_stmt)) |
9546 | { | |
e67d7a1e | 9547 | loop = alloc_loop (); |
acf0174b JJ |
9548 | loop->header = body_bb; |
9549 | if (collapse_bb == NULL) | |
9550 | loop->latch = cont_bb; | |
9551 | add_loop (loop, body_bb->loop_father); | |
9552 | } | |
953ff289 DN |
9553 | } |
9554 | ||
1b96e9a4 TV |
9555 | /* Return phi in E->DEST with ARG on edge E. */ |
9556 | ||
9557 | static gphi * | |
9558 | find_phi_with_arg_on_edge (tree arg, edge e) | |
9559 | { | |
9560 | basic_block bb = e->dest; | |
9561 | ||
9562 | for (gphi_iterator gpi = gsi_start_phis (bb); | |
9563 | !gsi_end_p (gpi); | |
9564 | gsi_next (&gpi)) | |
9565 | { | |
9566 | gphi *phi = gpi.phi (); | |
9567 | if (PHI_ARG_DEF_FROM_EDGE (phi, e) == arg) | |
9568 | return phi; | |
9569 | } | |
9570 | ||
9571 | return NULL; | |
9572 | } | |
50674e96 DN |
9573 | |
9574 | /* A subroutine of expand_omp_for. Generate code for a parallel | |
9575 | loop with static schedule and a specified chunk size. Given | |
9576 | parameters: | |
953ff289 DN |
9577 | |
9578 | for (V = N1; V cond N2; V += STEP) BODY; | |
9579 | ||
9580 | where COND is "<" or ">", we generate pseudocode | |
9581 | ||
5a0f4dd3 | 9582 | if ((__typeof (V)) -1 > 0 && N2 cond N1) goto L2; |
953ff289 DN |
9583 | if (cond is <) |
9584 | adj = STEP - 1; | |
9585 | else | |
9586 | adj = STEP + 1; | |
a68ab351 JJ |
9587 | if ((__typeof (V)) -1 > 0 && cond is >) |
9588 | n = -(adj + N2 - N1) / -STEP; | |
9589 | else | |
9590 | n = (adj + N2 - N1) / STEP; | |
953ff289 | 9591 | trip = 0; |
917948d3 ZD |
9592 | V = threadid * CHUNK * STEP + N1; -- this extra definition of V is |
9593 | here so that V is defined | |
9594 | if the loop is not entered | |
953ff289 DN |
9595 | L0: |
9596 | s0 = (trip * nthreads + threadid) * CHUNK; | |
9597 | e0 = min(s0 + CHUNK, n); | |
9598 | if (s0 < n) goto L1; else goto L4; | |
9599 | L1: | |
9600 | V = s0 * STEP + N1; | |
9601 | e = e0 * STEP + N1; | |
9602 | L2: | |
9603 | BODY; | |
9604 | V += STEP; | |
9605 | if (V cond e) goto L2; else goto L3; | |
9606 | L3: | |
9607 | trip += 1; | |
9608 | goto L0; | |
9609 | L4: | |
953ff289 DN |
9610 | */ |
9611 | ||
777f7f9a | 9612 | static void |
acf0174b | 9613 | expand_omp_for_static_chunk (struct omp_region *region, |
355fe088 | 9614 | struct omp_for_data *fd, gimple *inner_stmt) |
953ff289 | 9615 | { |
726a989a | 9616 | tree n, s0, e0, e, t; |
917948d3 | 9617 | tree trip_var, trip_init, trip_main, trip_back, nthreads, threadid; |
ed20ae98 | 9618 | tree type, itype, vmain, vback, vextra; |
50674e96 | 9619 | basic_block entry_bb, exit_bb, body_bb, seq_start_bb, iter_part_bb; |
acf0174b | 9620 | basic_block trip_update_bb = NULL, cont_bb, collapse_bb = NULL, fin_bb; |
ed20ae98 | 9621 | gimple_stmt_iterator gsi; |
726a989a | 9622 | edge se; |
acf0174b JJ |
9623 | bool broken_loop = region->cont == NULL; |
9624 | tree *counts = NULL; | |
9625 | tree n1, n2, step; | |
953ff289 | 9626 | |
a68ab351 JJ |
9627 | itype = type = TREE_TYPE (fd->loop.v); |
9628 | if (POINTER_TYPE_P (type)) | |
96f9265a | 9629 | itype = signed_type_for (type); |
953ff289 | 9630 | |
777f7f9a | 9631 | entry_bb = region->entry; |
e5c95afe ZD |
9632 | se = split_block (entry_bb, last_stmt (entry_bb)); |
9633 | entry_bb = se->src; | |
9634 | iter_part_bb = se->dest; | |
777f7f9a | 9635 | cont_bb = region->cont; |
e5c95afe | 9636 | gcc_assert (EDGE_COUNT (iter_part_bb->succs) == 2); |
acf0174b JJ |
9637 | fin_bb = BRANCH_EDGE (iter_part_bb)->dest; |
9638 | gcc_assert (broken_loop | |
9639 | || fin_bb == FALLTHRU_EDGE (cont_bb)->dest); | |
e5c95afe ZD |
9640 | seq_start_bb = split_edge (FALLTHRU_EDGE (iter_part_bb)); |
9641 | body_bb = single_succ (seq_start_bb); | |
acf0174b JJ |
9642 | if (!broken_loop) |
9643 | { | |
8cba6b95 TV |
9644 | gcc_assert (BRANCH_EDGE (cont_bb)->dest == body_bb |
9645 | || single_succ (BRANCH_EDGE (cont_bb)->dest) == body_bb); | |
acf0174b JJ |
9646 | gcc_assert (EDGE_COUNT (cont_bb->succs) == 2); |
9647 | trip_update_bb = split_edge (FALLTHRU_EDGE (cont_bb)); | |
9648 | } | |
777f7f9a | 9649 | exit_bb = region->exit; |
50674e96 | 9650 | |
50674e96 | 9651 | /* Trip and adjustment setup goes in ENTRY_BB. */ |
ed20ae98 TS |
9652 | gsi = gsi_last_bb (entry_bb); |
9653 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_FOR); | |
50674e96 | 9654 | |
acf0174b JJ |
9655 | if (fd->collapse > 1) |
9656 | { | |
d9a6bd32 JJ |
9657 | int first_zero_iter = -1, dummy = -1; |
9658 | basic_block l2_dom_bb = NULL, dummy_bb = NULL; | |
acf0174b JJ |
9659 | |
9660 | counts = XALLOCAVEC (tree, fd->collapse); | |
ed20ae98 | 9661 | expand_omp_for_init_counts (fd, &gsi, entry_bb, counts, |
acf0174b | 9662 | fin_bb, first_zero_iter, |
d9a6bd32 | 9663 | dummy_bb, dummy, l2_dom_bb); |
acf0174b JJ |
9664 | t = NULL_TREE; |
9665 | } | |
9666 | else if (gimple_omp_for_combined_into_p (fd->for_stmt)) | |
9667 | t = integer_one_node; | |
9668 | else | |
9669 | t = fold_binary (fd->loop.cond_code, boolean_type_node, | |
9670 | fold_convert (type, fd->loop.n1), | |
9671 | fold_convert (type, fd->loop.n2)); | |
9672 | if (fd->collapse == 1 | |
9673 | && TYPE_UNSIGNED (type) | |
5a0f4dd3 JJ |
9674 | && (t == NULL_TREE || !integer_onep (t))) |
9675 | { | |
5a0f4dd3 | 9676 | n1 = fold_convert (type, unshare_expr (fd->loop.n1)); |
ed20ae98 | 9677 | n1 = force_gimple_operand_gsi (&gsi, n1, true, NULL_TREE, |
5a0f4dd3 JJ |
9678 | true, GSI_SAME_STMT); |
9679 | n2 = fold_convert (type, unshare_expr (fd->loop.n2)); | |
ed20ae98 | 9680 | n2 = force_gimple_operand_gsi (&gsi, n2, true, NULL_TREE, |
5a0f4dd3 | 9681 | true, GSI_SAME_STMT); |
538dd0b7 DM |
9682 | gcond *cond_stmt = gimple_build_cond (fd->loop.cond_code, n1, n2, |
9683 | NULL_TREE, NULL_TREE); | |
9684 | gsi_insert_before (&gsi, cond_stmt, GSI_SAME_STMT); | |
9685 | if (walk_tree (gimple_cond_lhs_ptr (cond_stmt), | |
5a0f4dd3 | 9686 | expand_omp_regimplify_p, NULL, NULL) |
538dd0b7 | 9687 | || walk_tree (gimple_cond_rhs_ptr (cond_stmt), |
5a0f4dd3 JJ |
9688 | expand_omp_regimplify_p, NULL, NULL)) |
9689 | { | |
538dd0b7 DM |
9690 | gsi = gsi_for_stmt (cond_stmt); |
9691 | gimple_regimplify_operands (cond_stmt, &gsi); | |
5a0f4dd3 | 9692 | } |
538dd0b7 | 9693 | se = split_block (entry_bb, cond_stmt); |
5a0f4dd3 JJ |
9694 | se->flags = EDGE_TRUE_VALUE; |
9695 | entry_bb = se->dest; | |
9696 | se->probability = REG_BR_PROB_BASE - (REG_BR_PROB_BASE / 2000 - 1); | |
9697 | se = make_edge (se->src, fin_bb, EDGE_FALSE_VALUE); | |
9698 | se->probability = REG_BR_PROB_BASE / 2000 - 1; | |
9699 | if (gimple_in_ssa_p (cfun)) | |
9700 | { | |
17720e84 | 9701 | int dest_idx = find_edge (iter_part_bb, fin_bb)->dest_idx; |
538dd0b7 DM |
9702 | for (gphi_iterator gpi = gsi_start_phis (fin_bb); |
9703 | !gsi_end_p (gpi); gsi_next (&gpi)) | |
5a0f4dd3 | 9704 | { |
538dd0b7 | 9705 | gphi *phi = gpi.phi (); |
5a0f4dd3 JJ |
9706 | add_phi_arg (phi, gimple_phi_arg_def (phi, dest_idx), |
9707 | se, UNKNOWN_LOCATION); | |
9708 | } | |
9709 | } | |
ed20ae98 | 9710 | gsi = gsi_last_bb (entry_bb); |
5a0f4dd3 JJ |
9711 | } |
9712 | ||
41dbbb37 TS |
9713 | switch (gimple_omp_for_kind (fd->for_stmt)) |
9714 | { | |
9715 | case GF_OMP_FOR_KIND_FOR: | |
9716 | nthreads = builtin_decl_explicit (BUILT_IN_OMP_GET_NUM_THREADS); | |
9717 | threadid = builtin_decl_explicit (BUILT_IN_OMP_GET_THREAD_NUM); | |
9718 | break; | |
9719 | case GF_OMP_FOR_KIND_DISTRIBUTE: | |
9720 | nthreads = builtin_decl_explicit (BUILT_IN_OMP_GET_NUM_TEAMS); | |
9721 | threadid = builtin_decl_explicit (BUILT_IN_OMP_GET_TEAM_NUM); | |
9722 | break; | |
41dbbb37 TS |
9723 | default: |
9724 | gcc_unreachable (); | |
9725 | } | |
9726 | nthreads = build_call_expr (nthreads, 0); | |
9727 | nthreads = fold_convert (itype, nthreads); | |
9728 | nthreads = force_gimple_operand_gsi (&gsi, nthreads, true, NULL_TREE, | |
726a989a | 9729 | true, GSI_SAME_STMT); |
41dbbb37 TS |
9730 | threadid = build_call_expr (threadid, 0); |
9731 | threadid = fold_convert (itype, threadid); | |
9732 | threadid = force_gimple_operand_gsi (&gsi, threadid, true, NULL_TREE, | |
726a989a | 9733 | true, GSI_SAME_STMT); |
917948d3 | 9734 | |
acf0174b JJ |
9735 | n1 = fd->loop.n1; |
9736 | n2 = fd->loop.n2; | |
9737 | step = fd->loop.step; | |
9738 | if (gimple_omp_for_combined_into_p (fd->for_stmt)) | |
9739 | { | |
9740 | tree innerc = find_omp_clause (gimple_omp_for_clauses (fd->for_stmt), | |
9741 | OMP_CLAUSE__LOOPTEMP_); | |
9742 | gcc_assert (innerc); | |
9743 | n1 = OMP_CLAUSE_DECL (innerc); | |
9744 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
9745 | OMP_CLAUSE__LOOPTEMP_); | |
9746 | gcc_assert (innerc); | |
9747 | n2 = OMP_CLAUSE_DECL (innerc); | |
9748 | } | |
ed20ae98 | 9749 | n1 = force_gimple_operand_gsi (&gsi, fold_convert (type, n1), |
acf0174b | 9750 | true, NULL_TREE, true, GSI_SAME_STMT); |
ed20ae98 | 9751 | n2 = force_gimple_operand_gsi (&gsi, fold_convert (itype, n2), |
acf0174b | 9752 | true, NULL_TREE, true, GSI_SAME_STMT); |
ed20ae98 | 9753 | step = force_gimple_operand_gsi (&gsi, fold_convert (itype, step), |
acf0174b | 9754 | true, NULL_TREE, true, GSI_SAME_STMT); |
d9a6bd32 JJ |
9755 | tree chunk_size = fold_convert (itype, fd->chunk_size); |
9756 | chunk_size = omp_adjust_chunk_size (chunk_size, fd->simd_schedule); | |
9757 | chunk_size | |
9758 | = force_gimple_operand_gsi (&gsi, chunk_size, true, NULL_TREE, true, | |
9759 | GSI_SAME_STMT); | |
a68ab351 JJ |
9760 | |
9761 | t = build_int_cst (itype, (fd->loop.cond_code == LT_EXPR ? -1 : 1)); | |
acf0174b JJ |
9762 | t = fold_build2 (PLUS_EXPR, itype, step, t); |
9763 | t = fold_build2 (PLUS_EXPR, itype, t, n2); | |
9764 | t = fold_build2 (MINUS_EXPR, itype, t, fold_convert (itype, n1)); | |
a68ab351 JJ |
9765 | if (TYPE_UNSIGNED (itype) && fd->loop.cond_code == GT_EXPR) |
9766 | t = fold_build2 (TRUNC_DIV_EXPR, itype, | |
9767 | fold_build1 (NEGATE_EXPR, itype, t), | |
acf0174b | 9768 | fold_build1 (NEGATE_EXPR, itype, step)); |
a68ab351 | 9769 | else |
acf0174b | 9770 | t = fold_build2 (TRUNC_DIV_EXPR, itype, t, step); |
a68ab351 | 9771 | t = fold_convert (itype, t); |
ed20ae98 | 9772 | n = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
726a989a | 9773 | true, GSI_SAME_STMT); |
917948d3 | 9774 | |
a5efada7 | 9775 | trip_var = create_tmp_reg (itype, ".trip"); |
917948d3 ZD |
9776 | if (gimple_in_ssa_p (cfun)) |
9777 | { | |
b731b390 JJ |
9778 | trip_init = make_ssa_name (trip_var); |
9779 | trip_main = make_ssa_name (trip_var); | |
9780 | trip_back = make_ssa_name (trip_var); | |
917948d3 | 9781 | } |
953ff289 | 9782 | else |
917948d3 ZD |
9783 | { |
9784 | trip_init = trip_var; | |
9785 | trip_main = trip_var; | |
9786 | trip_back = trip_var; | |
9787 | } | |
953ff289 | 9788 | |
538dd0b7 DM |
9789 | gassign *assign_stmt |
9790 | = gimple_build_assign (trip_init, build_int_cst (itype, 0)); | |
9791 | gsi_insert_before (&gsi, assign_stmt, GSI_SAME_STMT); | |
50674e96 | 9792 | |
d9a6bd32 | 9793 | t = fold_build2 (MULT_EXPR, itype, threadid, chunk_size); |
acf0174b | 9794 | t = fold_build2 (MULT_EXPR, itype, t, step); |
a68ab351 | 9795 | if (POINTER_TYPE_P (type)) |
acf0174b | 9796 | t = fold_build_pointer_plus (n1, t); |
a68ab351 | 9797 | else |
acf0174b | 9798 | t = fold_build2 (PLUS_EXPR, type, t, n1); |
ed20ae98 TS |
9799 | vextra = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
9800 | true, GSI_SAME_STMT); | |
917948d3 | 9801 | |
726a989a | 9802 | /* Remove the GIMPLE_OMP_FOR. */ |
ed20ae98 | 9803 | gsi_remove (&gsi, true); |
50674e96 | 9804 | |
d9a6bd32 JJ |
9805 | gimple_stmt_iterator gsif = gsi; |
9806 | ||
50674e96 | 9807 | /* Iteration space partitioning goes in ITER_PART_BB. */ |
ed20ae98 | 9808 | gsi = gsi_last_bb (iter_part_bb); |
953ff289 | 9809 | |
a68ab351 JJ |
9810 | t = fold_build2 (MULT_EXPR, itype, trip_main, nthreads); |
9811 | t = fold_build2 (PLUS_EXPR, itype, t, threadid); | |
d9a6bd32 | 9812 | t = fold_build2 (MULT_EXPR, itype, t, chunk_size); |
ed20ae98 | 9813 | s0 = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
726a989a | 9814 | false, GSI_CONTINUE_LINKING); |
953ff289 | 9815 | |
d9a6bd32 | 9816 | t = fold_build2 (PLUS_EXPR, itype, s0, chunk_size); |
a68ab351 | 9817 | t = fold_build2 (MIN_EXPR, itype, t, n); |
ed20ae98 | 9818 | e0 = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
726a989a | 9819 | false, GSI_CONTINUE_LINKING); |
953ff289 DN |
9820 | |
9821 | t = build2 (LT_EXPR, boolean_type_node, s0, n); | |
ed20ae98 | 9822 | gsi_insert_after (&gsi, gimple_build_cond_empty (t), GSI_CONTINUE_LINKING); |
50674e96 DN |
9823 | |
9824 | /* Setup code for sequential iteration goes in SEQ_START_BB. */ | |
ed20ae98 | 9825 | gsi = gsi_start_bb (seq_start_bb); |
953ff289 | 9826 | |
acf0174b JJ |
9827 | tree startvar = fd->loop.v; |
9828 | tree endvar = NULL_TREE; | |
9829 | ||
9830 | if (gimple_omp_for_combined_p (fd->for_stmt)) | |
9831 | { | |
9832 | tree clauses = gimple_code (inner_stmt) == GIMPLE_OMP_PARALLEL | |
9833 | ? gimple_omp_parallel_clauses (inner_stmt) | |
9834 | : gimple_omp_for_clauses (inner_stmt); | |
9835 | tree innerc = find_omp_clause (clauses, OMP_CLAUSE__LOOPTEMP_); | |
9836 | gcc_assert (innerc); | |
9837 | startvar = OMP_CLAUSE_DECL (innerc); | |
9838 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
9839 | OMP_CLAUSE__LOOPTEMP_); | |
9840 | gcc_assert (innerc); | |
9841 | endvar = OMP_CLAUSE_DECL (innerc); | |
e01d41e5 JJ |
9842 | if (fd->collapse > 1 && TREE_CODE (fd->loop.n2) != INTEGER_CST |
9843 | && gimple_omp_for_kind (fd->for_stmt) == GF_OMP_FOR_KIND_DISTRIBUTE) | |
9844 | { | |
9845 | int i; | |
9846 | for (i = 1; i < fd->collapse; i++) | |
9847 | { | |
9848 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
9849 | OMP_CLAUSE__LOOPTEMP_); | |
9850 | gcc_assert (innerc); | |
9851 | } | |
9852 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
9853 | OMP_CLAUSE__LOOPTEMP_); | |
9854 | if (innerc) | |
9855 | { | |
9856 | /* If needed (distribute parallel for with lastprivate), | |
9857 | propagate down the total number of iterations. */ | |
9858 | tree t = fold_convert (TREE_TYPE (OMP_CLAUSE_DECL (innerc)), | |
9859 | fd->loop.n2); | |
9860 | t = force_gimple_operand_gsi (&gsi, t, false, NULL_TREE, false, | |
9861 | GSI_CONTINUE_LINKING); | |
9862 | assign_stmt = gimple_build_assign (OMP_CLAUSE_DECL (innerc), t); | |
9863 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
9864 | } | |
9865 | } | |
acf0174b JJ |
9866 | } |
9867 | ||
a68ab351 | 9868 | t = fold_convert (itype, s0); |
acf0174b | 9869 | t = fold_build2 (MULT_EXPR, itype, t, step); |
a68ab351 | 9870 | if (POINTER_TYPE_P (type)) |
acf0174b | 9871 | t = fold_build_pointer_plus (n1, t); |
a68ab351 | 9872 | else |
acf0174b JJ |
9873 | t = fold_build2 (PLUS_EXPR, type, t, n1); |
9874 | t = fold_convert (TREE_TYPE (startvar), t); | |
ed20ae98 | 9875 | t = force_gimple_operand_gsi (&gsi, t, |
acf0174b JJ |
9876 | DECL_P (startvar) |
9877 | && TREE_ADDRESSABLE (startvar), | |
ea3a0fde | 9878 | NULL_TREE, false, GSI_CONTINUE_LINKING); |
538dd0b7 DM |
9879 | assign_stmt = gimple_build_assign (startvar, t); |
9880 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
953ff289 | 9881 | |
a68ab351 | 9882 | t = fold_convert (itype, e0); |
acf0174b | 9883 | t = fold_build2 (MULT_EXPR, itype, t, step); |
a68ab351 | 9884 | if (POINTER_TYPE_P (type)) |
acf0174b | 9885 | t = fold_build_pointer_plus (n1, t); |
a68ab351 | 9886 | else |
acf0174b JJ |
9887 | t = fold_build2 (PLUS_EXPR, type, t, n1); |
9888 | t = fold_convert (TREE_TYPE (startvar), t); | |
ed20ae98 | 9889 | e = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, |
726a989a | 9890 | false, GSI_CONTINUE_LINKING); |
acf0174b JJ |
9891 | if (endvar) |
9892 | { | |
538dd0b7 DM |
9893 | assign_stmt = gimple_build_assign (endvar, e); |
9894 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
95782571 | 9895 | if (useless_type_conversion_p (TREE_TYPE (fd->loop.v), TREE_TYPE (e))) |
538dd0b7 | 9896 | assign_stmt = gimple_build_assign (fd->loop.v, e); |
95782571 | 9897 | else |
0d0e4a03 | 9898 | assign_stmt = gimple_build_assign (fd->loop.v, NOP_EXPR, e); |
538dd0b7 | 9899 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); |
acf0174b | 9900 | } |
d9a6bd32 JJ |
9901 | /* Handle linear clause adjustments. */ |
9902 | tree itercnt = NULL_TREE, itercntbias = NULL_TREE; | |
9903 | if (gimple_omp_for_kind (fd->for_stmt) == GF_OMP_FOR_KIND_FOR) | |
9904 | for (tree c = gimple_omp_for_clauses (fd->for_stmt); | |
9905 | c; c = OMP_CLAUSE_CHAIN (c)) | |
9906 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR | |
9907 | && !OMP_CLAUSE_LINEAR_NO_COPYIN (c)) | |
9908 | { | |
9909 | tree d = OMP_CLAUSE_DECL (c); | |
9910 | bool is_ref = is_reference (d); | |
9911 | tree t = d, a, dest; | |
9912 | if (is_ref) | |
9913 | t = build_simple_mem_ref_loc (OMP_CLAUSE_LOCATION (c), t); | |
9914 | tree type = TREE_TYPE (t); | |
9915 | if (POINTER_TYPE_P (type)) | |
9916 | type = sizetype; | |
9917 | dest = unshare_expr (t); | |
9918 | tree v = create_tmp_var (TREE_TYPE (t), NULL); | |
9919 | expand_omp_build_assign (&gsif, v, t); | |
9920 | if (itercnt == NULL_TREE) | |
9921 | { | |
9922 | if (gimple_omp_for_combined_into_p (fd->for_stmt)) | |
9923 | { | |
9924 | itercntbias | |
9925 | = fold_build2 (MINUS_EXPR, itype, fold_convert (itype, n1), | |
9926 | fold_convert (itype, fd->loop.n1)); | |
9927 | itercntbias = fold_build2 (EXACT_DIV_EXPR, itype, | |
9928 | itercntbias, step); | |
9929 | itercntbias | |
9930 | = force_gimple_operand_gsi (&gsif, itercntbias, true, | |
9931 | NULL_TREE, true, | |
9932 | GSI_SAME_STMT); | |
9933 | itercnt = fold_build2 (PLUS_EXPR, itype, itercntbias, s0); | |
9934 | itercnt = force_gimple_operand_gsi (&gsi, itercnt, true, | |
9935 | NULL_TREE, false, | |
9936 | GSI_CONTINUE_LINKING); | |
9937 | } | |
9938 | else | |
9939 | itercnt = s0; | |
9940 | } | |
9941 | a = fold_build2 (MULT_EXPR, type, | |
9942 | fold_convert (type, itercnt), | |
9943 | fold_convert (type, OMP_CLAUSE_LINEAR_STEP (c))); | |
9944 | t = fold_build2 (type == TREE_TYPE (t) ? PLUS_EXPR | |
9945 | : POINTER_PLUS_EXPR, TREE_TYPE (t), v, a); | |
9946 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
9947 | false, GSI_CONTINUE_LINKING); | |
9948 | assign_stmt = gimple_build_assign (dest, t); | |
9949 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
9950 | } | |
acf0174b | 9951 | if (fd->collapse > 1) |
ed20ae98 | 9952 | expand_omp_for_init_vars (fd, &gsi, counts, inner_stmt, startvar); |
acf0174b JJ |
9953 | |
9954 | if (!broken_loop) | |
9955 | { | |
9956 | /* The code controlling the sequential loop goes in CONT_BB, | |
9957 | replacing the GIMPLE_OMP_CONTINUE. */ | |
ed20ae98 | 9958 | gsi = gsi_last_bb (cont_bb); |
538dd0b7 DM |
9959 | gomp_continue *cont_stmt = as_a <gomp_continue *> (gsi_stmt (gsi)); |
9960 | vmain = gimple_omp_continue_control_use (cont_stmt); | |
9961 | vback = gimple_omp_continue_control_def (cont_stmt); | |
953ff289 | 9962 | |
acf0174b JJ |
9963 | if (!gimple_omp_for_combined_p (fd->for_stmt)) |
9964 | { | |
9965 | if (POINTER_TYPE_P (type)) | |
ed20ae98 | 9966 | t = fold_build_pointer_plus (vmain, step); |
acf0174b | 9967 | else |
ed20ae98 TS |
9968 | t = fold_build2 (PLUS_EXPR, type, vmain, step); |
9969 | if (DECL_P (vback) && TREE_ADDRESSABLE (vback)) | |
9970 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
acf0174b | 9971 | true, GSI_SAME_STMT); |
538dd0b7 DM |
9972 | assign_stmt = gimple_build_assign (vback, t); |
9973 | gsi_insert_before (&gsi, assign_stmt, GSI_SAME_STMT); | |
917948d3 | 9974 | |
6be5c241 TV |
9975 | if (tree_int_cst_equal (fd->chunk_size, integer_one_node)) |
9976 | t = build2 (EQ_EXPR, boolean_type_node, | |
9977 | build_int_cst (itype, 0), | |
9978 | build_int_cst (itype, 1)); | |
9979 | else | |
9980 | t = build2 (fd->loop.cond_code, boolean_type_node, | |
9981 | DECL_P (vback) && TREE_ADDRESSABLE (vback) | |
9982 | ? t : vback, e); | |
ed20ae98 | 9983 | gsi_insert_before (&gsi, gimple_build_cond_empty (t), GSI_SAME_STMT); |
acf0174b | 9984 | } |
917948d3 | 9985 | |
acf0174b | 9986 | /* Remove GIMPLE_OMP_CONTINUE. */ |
ed20ae98 | 9987 | gsi_remove (&gsi, true); |
b8698a0f | 9988 | |
acf0174b JJ |
9989 | if (fd->collapse > 1 && !gimple_omp_for_combined_p (fd->for_stmt)) |
9990 | collapse_bb = extract_omp_for_update_vars (fd, cont_bb, body_bb); | |
50674e96 | 9991 | |
acf0174b | 9992 | /* Trip update code goes into TRIP_UPDATE_BB. */ |
ed20ae98 | 9993 | gsi = gsi_start_bb (trip_update_bb); |
953ff289 | 9994 | |
acf0174b JJ |
9995 | t = build_int_cst (itype, 1); |
9996 | t = build2 (PLUS_EXPR, itype, trip_main, t); | |
538dd0b7 DM |
9997 | assign_stmt = gimple_build_assign (trip_back, t); |
9998 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
acf0174b | 9999 | } |
953ff289 | 10000 | |
726a989a | 10001 | /* Replace the GIMPLE_OMP_RETURN with a barrier, or nothing. */ |
ed20ae98 TS |
10002 | gsi = gsi_last_bb (exit_bb); |
10003 | if (!gimple_omp_return_nowait_p (gsi_stmt (gsi))) | |
acf0174b | 10004 | { |
ed20ae98 | 10005 | t = gimple_omp_return_lhs (gsi_stmt (gsi)); |
e4834818 | 10006 | gsi_insert_after (&gsi, build_omp_barrier (t), GSI_SAME_STMT); |
acf0174b | 10007 | } |
ed20ae98 | 10008 | gsi_remove (&gsi, true); |
953ff289 | 10009 | |
50674e96 | 10010 | /* Connect the new blocks. */ |
e5c95afe ZD |
10011 | find_edge (iter_part_bb, seq_start_bb)->flags = EDGE_TRUE_VALUE; |
10012 | find_edge (iter_part_bb, fin_bb)->flags = EDGE_FALSE_VALUE; | |
917948d3 | 10013 | |
acf0174b JJ |
10014 | if (!broken_loop) |
10015 | { | |
10016 | se = find_edge (cont_bb, body_bb); | |
8cba6b95 TV |
10017 | if (se == NULL) |
10018 | { | |
10019 | se = BRANCH_EDGE (cont_bb); | |
10020 | gcc_assert (single_succ (se->dest) == body_bb); | |
10021 | } | |
acf0174b JJ |
10022 | if (gimple_omp_for_combined_p (fd->for_stmt)) |
10023 | { | |
10024 | remove_edge (se); | |
10025 | se = NULL; | |
10026 | } | |
10027 | else if (fd->collapse > 1) | |
10028 | { | |
10029 | remove_edge (se); | |
10030 | se = make_edge (cont_bb, collapse_bb, EDGE_TRUE_VALUE); | |
10031 | } | |
10032 | else | |
10033 | se->flags = EDGE_TRUE_VALUE; | |
10034 | find_edge (cont_bb, trip_update_bb)->flags | |
10035 | = se ? EDGE_FALSE_VALUE : EDGE_FALLTHRU; | |
917948d3 | 10036 | |
acf0174b JJ |
10037 | redirect_edge_and_branch (single_succ_edge (trip_update_bb), iter_part_bb); |
10038 | } | |
917948d3 ZD |
10039 | |
10040 | if (gimple_in_ssa_p (cfun)) | |
10041 | { | |
538dd0b7 DM |
10042 | gphi_iterator psi; |
10043 | gphi *phi; | |
726a989a | 10044 | edge re, ene; |
726a989a RB |
10045 | edge_var_map *vm; |
10046 | size_t i; | |
10047 | ||
acf0174b JJ |
10048 | gcc_assert (fd->collapse == 1 && !broken_loop); |
10049 | ||
917948d3 ZD |
10050 | /* When we redirect the edge from trip_update_bb to iter_part_bb, we |
10051 | remove arguments of the phi nodes in fin_bb. We need to create | |
10052 | appropriate phi nodes in iter_part_bb instead. */ | |
17720e84 | 10053 | se = find_edge (iter_part_bb, fin_bb); |
917948d3 | 10054 | re = single_succ_edge (trip_update_bb); |
b787e7a2 | 10055 | vec<edge_var_map> *head = redirect_edge_var_map_vector (re); |
917948d3 ZD |
10056 | ene = single_succ_edge (entry_bb); |
10057 | ||
726a989a | 10058 | psi = gsi_start_phis (fin_bb); |
9771b263 | 10059 | for (i = 0; !gsi_end_p (psi) && head->iterate (i, &vm); |
726a989a | 10060 | gsi_next (&psi), ++i) |
917948d3 | 10061 | { |
538dd0b7 | 10062 | gphi *nphi; |
f5045c96 | 10063 | source_location locus; |
726a989a | 10064 | |
538dd0b7 | 10065 | phi = psi.phi (); |
726a989a RB |
10066 | t = gimple_phi_result (phi); |
10067 | gcc_assert (t == redirect_edge_var_map_result (vm)); | |
17720e84 TV |
10068 | |
10069 | if (!single_pred_p (fin_bb)) | |
10070 | t = copy_ssa_name (t, phi); | |
10071 | ||
917948d3 | 10072 | nphi = create_phi_node (t, iter_part_bb); |
917948d3 ZD |
10073 | |
10074 | t = PHI_ARG_DEF_FROM_EDGE (phi, se); | |
f5045c96 AM |
10075 | locus = gimple_phi_arg_location_from_edge (phi, se); |
10076 | ||
a68ab351 | 10077 | /* A special case -- fd->loop.v is not yet computed in |
ed20ae98 | 10078 | iter_part_bb, we need to use vextra instead. */ |
a68ab351 | 10079 | if (t == fd->loop.v) |
ed20ae98 | 10080 | t = vextra; |
9e227d60 | 10081 | add_phi_arg (nphi, t, ene, locus); |
f5045c96 | 10082 | locus = redirect_edge_var_map_location (vm); |
1b96e9a4 TV |
10083 | tree back_arg = redirect_edge_var_map_def (vm); |
10084 | add_phi_arg (nphi, back_arg, re, locus); | |
10085 | edge ce = find_edge (cont_bb, body_bb); | |
10086 | if (ce == NULL) | |
10087 | { | |
10088 | ce = BRANCH_EDGE (cont_bb); | |
10089 | gcc_assert (single_succ (ce->dest) == body_bb); | |
10090 | ce = single_succ_edge (ce->dest); | |
10091 | } | |
10092 | gphi *inner_loop_phi = find_phi_with_arg_on_edge (back_arg, ce); | |
10093 | gcc_assert (inner_loop_phi != NULL); | |
10094 | add_phi_arg (inner_loop_phi, gimple_phi_result (nphi), | |
10095 | find_edge (seq_start_bb, body_bb), locus); | |
17720e84 TV |
10096 | |
10097 | if (!single_pred_p (fin_bb)) | |
10098 | add_phi_arg (phi, gimple_phi_result (nphi), se, locus); | |
726a989a | 10099 | } |
8050766e | 10100 | gcc_assert (gsi_end_p (psi) && (head == NULL || i == head->length ())); |
726a989a | 10101 | redirect_edge_var_map_clear (re); |
17720e84 TV |
10102 | if (single_pred_p (fin_bb)) |
10103 | while (1) | |
10104 | { | |
10105 | psi = gsi_start_phis (fin_bb); | |
10106 | if (gsi_end_p (psi)) | |
10107 | break; | |
10108 | remove_phi_node (&psi, false); | |
10109 | } | |
917948d3 ZD |
10110 | |
10111 | /* Make phi node for trip. */ | |
10112 | phi = create_phi_node (trip_main, iter_part_bb); | |
f5045c96 | 10113 | add_phi_arg (phi, trip_back, single_succ_edge (trip_update_bb), |
9e227d60 | 10114 | UNKNOWN_LOCATION); |
f5045c96 | 10115 | add_phi_arg (phi, trip_init, single_succ_edge (entry_bb), |
9e227d60 | 10116 | UNKNOWN_LOCATION); |
917948d3 ZD |
10117 | } |
10118 | ||
acf0174b JJ |
10119 | if (!broken_loop) |
10120 | set_immediate_dominator (CDI_DOMINATORS, trip_update_bb, cont_bb); | |
917948d3 ZD |
10121 | set_immediate_dominator (CDI_DOMINATORS, iter_part_bb, |
10122 | recompute_dominator (CDI_DOMINATORS, iter_part_bb)); | |
10123 | set_immediate_dominator (CDI_DOMINATORS, fin_bb, | |
10124 | recompute_dominator (CDI_DOMINATORS, fin_bb)); | |
10125 | set_immediate_dominator (CDI_DOMINATORS, seq_start_bb, | |
10126 | recompute_dominator (CDI_DOMINATORS, seq_start_bb)); | |
10127 | set_immediate_dominator (CDI_DOMINATORS, body_bb, | |
10128 | recompute_dominator (CDI_DOMINATORS, body_bb)); | |
6093bc06 | 10129 | |
acf0174b JJ |
10130 | if (!broken_loop) |
10131 | { | |
8cba6b95 | 10132 | struct loop *loop = body_bb->loop_father; |
acf0174b JJ |
10133 | struct loop *trip_loop = alloc_loop (); |
10134 | trip_loop->header = iter_part_bb; | |
10135 | trip_loop->latch = trip_update_bb; | |
10136 | add_loop (trip_loop, iter_part_bb->loop_father); | |
6093bc06 | 10137 | |
8cba6b95 TV |
10138 | if (loop != entry_bb->loop_father) |
10139 | { | |
10140 | gcc_assert (loop->header == body_bb); | |
10141 | gcc_assert (loop->latch == region->cont | |
10142 | || single_pred (loop->latch) == region->cont); | |
10143 | trip_loop->inner = loop; | |
10144 | return; | |
10145 | } | |
10146 | ||
acf0174b JJ |
10147 | if (!gimple_omp_for_combined_p (fd->for_stmt)) |
10148 | { | |
8cba6b95 | 10149 | loop = alloc_loop (); |
acf0174b | 10150 | loop->header = body_bb; |
01dde9b0 JJ |
10151 | if (collapse_bb == NULL) |
10152 | loop->latch = cont_bb; | |
acf0174b JJ |
10153 | add_loop (loop, trip_loop); |
10154 | } | |
10155 | } | |
953ff289 DN |
10156 | } |
10157 | ||
9a771876 JJ |
10158 | /* A subroutine of expand_omp_for. Generate code for _Cilk_for loop. |
10159 | Given parameters: | |
10160 | for (V = N1; V cond N2; V += STEP) BODY; | |
10161 | ||
10162 | where COND is "<" or ">" or "!=", we generate pseudocode | |
10163 | ||
10164 | for (ind_var = low; ind_var < high; ind_var++) | |
10165 | { | |
10166 | V = n1 + (ind_var * STEP) | |
10167 | ||
10168 | <BODY> | |
10169 | } | |
10170 | ||
10171 | In the above pseudocode, low and high are function parameters of the | |
10172 | child function. In the function below, we are inserting a temp. | |
10173 | variable that will be making a call to two OMP functions that will not be | |
10174 | found in the body of _Cilk_for (since OMP_FOR cannot be mixed | |
10175 | with _Cilk_for). These functions are replaced with low and high | |
10176 | by the function that handles taskreg. */ | |
10177 | ||
10178 | ||
10179 | static void | |
10180 | expand_cilk_for (struct omp_region *region, struct omp_for_data *fd) | |
10181 | { | |
10182 | bool broken_loop = region->cont == NULL; | |
10183 | basic_block entry_bb = region->entry; | |
10184 | basic_block cont_bb = region->cont; | |
10185 | ||
10186 | gcc_assert (EDGE_COUNT (entry_bb->succs) == 2); | |
10187 | gcc_assert (broken_loop | |
10188 | || BRANCH_EDGE (entry_bb)->dest == FALLTHRU_EDGE (cont_bb)->dest); | |
10189 | basic_block l0_bb = FALLTHRU_EDGE (entry_bb)->dest; | |
10190 | basic_block l1_bb, l2_bb; | |
10191 | ||
10192 | if (!broken_loop) | |
10193 | { | |
10194 | gcc_assert (BRANCH_EDGE (cont_bb)->dest == l0_bb); | |
10195 | gcc_assert (EDGE_COUNT (cont_bb->succs) == 2); | |
10196 | l1_bb = split_block (cont_bb, last_stmt (cont_bb))->dest; | |
10197 | l2_bb = BRANCH_EDGE (entry_bb)->dest; | |
10198 | } | |
10199 | else | |
10200 | { | |
10201 | BRANCH_EDGE (entry_bb)->flags &= ~EDGE_ABNORMAL; | |
10202 | l1_bb = split_edge (BRANCH_EDGE (entry_bb)); | |
10203 | l2_bb = single_succ (l1_bb); | |
10204 | } | |
10205 | basic_block exit_bb = region->exit; | |
10206 | basic_block l2_dom_bb = NULL; | |
10207 | ||
10208 | gimple_stmt_iterator gsi = gsi_last_bb (entry_bb); | |
10209 | ||
10210 | /* Below statements until the "tree high_val = ..." are pseudo statements | |
10211 | used to pass information to be used by expand_omp_taskreg. | |
10212 | low_val and high_val will be replaced by the __low and __high | |
10213 | parameter from the child function. | |
10214 | ||
10215 | The call_exprs part is a place-holder, it is mainly used | |
10216 | to distinctly identify to the top-level part that this is | |
10217 | where we should put low and high (reasoning given in header | |
10218 | comment). */ | |
10219 | ||
10220 | tree child_fndecl | |
538dd0b7 DM |
10221 | = gimple_omp_parallel_child_fn ( |
10222 | as_a <gomp_parallel *> (last_stmt (region->outer->entry))); | |
9a771876 JJ |
10223 | tree t, low_val = NULL_TREE, high_val = NULL_TREE; |
10224 | for (t = DECL_ARGUMENTS (child_fndecl); t; t = TREE_CHAIN (t)) | |
10225 | { | |
10226 | if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (t)), "__high")) | |
10227 | high_val = t; | |
10228 | else if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (t)), "__low")) | |
10229 | low_val = t; | |
10230 | } | |
10231 | gcc_assert (low_val && high_val); | |
10232 | ||
10233 | tree type = TREE_TYPE (low_val); | |
10234 | tree ind_var = create_tmp_reg (type, "__cilk_ind_var"); | |
10235 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_FOR); | |
10236 | ||
10237 | /* Not needed in SSA form right now. */ | |
10238 | gcc_assert (!gimple_in_ssa_p (cfun)); | |
10239 | if (l2_dom_bb == NULL) | |
10240 | l2_dom_bb = l1_bb; | |
10241 | ||
10242 | tree n1 = low_val; | |
10243 | tree n2 = high_val; | |
10244 | ||
355fe088 | 10245 | gimple *stmt = gimple_build_assign (ind_var, n1); |
9a771876 JJ |
10246 | |
10247 | /* Replace the GIMPLE_OMP_FOR statement. */ | |
10248 | gsi_replace (&gsi, stmt, true); | |
10249 | ||
10250 | if (!broken_loop) | |
10251 | { | |
10252 | /* Code to control the increment goes in the CONT_BB. */ | |
10253 | gsi = gsi_last_bb (cont_bb); | |
10254 | stmt = gsi_stmt (gsi); | |
10255 | gcc_assert (gimple_code (stmt) == GIMPLE_OMP_CONTINUE); | |
0d0e4a03 JJ |
10256 | stmt = gimple_build_assign (ind_var, PLUS_EXPR, ind_var, |
10257 | build_one_cst (type)); | |
9a771876 JJ |
10258 | |
10259 | /* Replace GIMPLE_OMP_CONTINUE. */ | |
10260 | gsi_replace (&gsi, stmt, true); | |
10261 | } | |
10262 | ||
10263 | /* Emit the condition in L1_BB. */ | |
10264 | gsi = gsi_after_labels (l1_bb); | |
10265 | t = fold_build2 (MULT_EXPR, TREE_TYPE (fd->loop.step), | |
10266 | fold_convert (TREE_TYPE (fd->loop.step), ind_var), | |
10267 | fd->loop.step); | |
10268 | if (POINTER_TYPE_P (TREE_TYPE (fd->loop.n1))) | |
10269 | t = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (fd->loop.n1), | |
10270 | fd->loop.n1, fold_convert (sizetype, t)); | |
10271 | else | |
10272 | t = fold_build2 (PLUS_EXPR, TREE_TYPE (fd->loop.n1), | |
10273 | fd->loop.n1, fold_convert (TREE_TYPE (fd->loop.n1), t)); | |
10274 | t = fold_convert (TREE_TYPE (fd->loop.v), t); | |
10275 | expand_omp_build_assign (&gsi, fd->loop.v, t); | |
10276 | ||
10277 | /* The condition is always '<' since the runtime will fill in the low | |
10278 | and high values. */ | |
10279 | stmt = gimple_build_cond (LT_EXPR, ind_var, n2, NULL_TREE, NULL_TREE); | |
10280 | gsi_insert_before (&gsi, stmt, GSI_SAME_STMT); | |
10281 | ||
10282 | /* Remove GIMPLE_OMP_RETURN. */ | |
10283 | gsi = gsi_last_bb (exit_bb); | |
10284 | gsi_remove (&gsi, true); | |
10285 | ||
10286 | /* Connect the new blocks. */ | |
10287 | remove_edge (FALLTHRU_EDGE (entry_bb)); | |
10288 | ||
10289 | edge e, ne; | |
10290 | if (!broken_loop) | |
10291 | { | |
10292 | remove_edge (BRANCH_EDGE (entry_bb)); | |
10293 | make_edge (entry_bb, l1_bb, EDGE_FALLTHRU); | |
10294 | ||
10295 | e = BRANCH_EDGE (l1_bb); | |
10296 | ne = FALLTHRU_EDGE (l1_bb); | |
10297 | e->flags = EDGE_TRUE_VALUE; | |
10298 | } | |
10299 | else | |
10300 | { | |
10301 | single_succ_edge (entry_bb)->flags = EDGE_FALLTHRU; | |
10302 | ||
10303 | ne = single_succ_edge (l1_bb); | |
10304 | e = make_edge (l1_bb, l0_bb, EDGE_TRUE_VALUE); | |
10305 | ||
10306 | } | |
10307 | ne->flags = EDGE_FALSE_VALUE; | |
10308 | e->probability = REG_BR_PROB_BASE * 7 / 8; | |
10309 | ne->probability = REG_BR_PROB_BASE / 8; | |
10310 | ||
10311 | set_immediate_dominator (CDI_DOMINATORS, l1_bb, entry_bb); | |
10312 | set_immediate_dominator (CDI_DOMINATORS, l2_bb, l2_dom_bb); | |
10313 | set_immediate_dominator (CDI_DOMINATORS, l0_bb, l1_bb); | |
10314 | ||
10315 | if (!broken_loop) | |
10316 | { | |
10317 | struct loop *loop = alloc_loop (); | |
10318 | loop->header = l1_bb; | |
10319 | loop->latch = cont_bb; | |
10320 | add_loop (loop, l1_bb->loop_father); | |
10321 | loop->safelen = INT_MAX; | |
10322 | } | |
10323 | ||
10324 | /* Pick the correct library function based on the precision of the | |
10325 | induction variable type. */ | |
10326 | tree lib_fun = NULL_TREE; | |
10327 | if (TYPE_PRECISION (type) == 32) | |
10328 | lib_fun = cilk_for_32_fndecl; | |
10329 | else if (TYPE_PRECISION (type) == 64) | |
10330 | lib_fun = cilk_for_64_fndecl; | |
10331 | else | |
10332 | gcc_unreachable (); | |
10333 | ||
10334 | gcc_assert (fd->sched_kind == OMP_CLAUSE_SCHEDULE_CILKFOR); | |
10335 | ||
10336 | /* WS_ARGS contains the library function flavor to call: | |
10337 | __libcilkrts_cilk_for_64 or __libcilkrts_cilk_for_32), and the | |
10338 | user-defined grain value. If the user does not define one, then zero | |
10339 | is passed in by the parser. */ | |
10340 | vec_alloc (region->ws_args, 2); | |
10341 | region->ws_args->quick_push (lib_fun); | |
10342 | region->ws_args->quick_push (fd->chunk_size); | |
10343 | } | |
acf0174b | 10344 | |
74bf76ed JJ |
10345 | /* A subroutine of expand_omp_for. Generate code for a simd non-worksharing |
10346 | loop. Given parameters: | |
10347 | ||
10348 | for (V = N1; V cond N2; V += STEP) BODY; | |
10349 | ||
10350 | where COND is "<" or ">", we generate pseudocode | |
10351 | ||
10352 | V = N1; | |
10353 | goto L1; | |
10354 | L0: | |
10355 | BODY; | |
10356 | V += STEP; | |
10357 | L1: | |
10358 | if (V cond N2) goto L0; else goto L2; | |
10359 | L2: | |
10360 | ||
10361 | For collapsed loops, given parameters: | |
10362 | collapse(3) | |
10363 | for (V1 = N11; V1 cond1 N12; V1 += STEP1) | |
10364 | for (V2 = N21; V2 cond2 N22; V2 += STEP2) | |
10365 | for (V3 = N31; V3 cond3 N32; V3 += STEP3) | |
10366 | BODY; | |
10367 | ||
10368 | we generate pseudocode | |
10369 | ||
10370 | if (cond3 is <) | |
10371 | adj = STEP3 - 1; | |
10372 | else | |
10373 | adj = STEP3 + 1; | |
10374 | count3 = (adj + N32 - N31) / STEP3; | |
10375 | if (cond2 is <) | |
10376 | adj = STEP2 - 1; | |
10377 | else | |
10378 | adj = STEP2 + 1; | |
10379 | count2 = (adj + N22 - N21) / STEP2; | |
10380 | if (cond1 is <) | |
10381 | adj = STEP1 - 1; | |
10382 | else | |
10383 | adj = STEP1 + 1; | |
10384 | count1 = (adj + N12 - N11) / STEP1; | |
10385 | count = count1 * count2 * count3; | |
10386 | V = 0; | |
10387 | V1 = N11; | |
10388 | V2 = N21; | |
10389 | V3 = N31; | |
10390 | goto L1; | |
10391 | L0: | |
10392 | BODY; | |
10393 | V += 1; | |
10394 | V3 += STEP3; | |
10395 | V2 += (V3 cond3 N32) ? 0 : STEP2; | |
10396 | V3 = (V3 cond3 N32) ? V3 : N31; | |
10397 | V1 += (V2 cond2 N22) ? 0 : STEP1; | |
10398 | V2 = (V2 cond2 N22) ? V2 : N21; | |
10399 | L1: | |
10400 | if (V < count) goto L0; else goto L2; | |
10401 | L2: | |
10402 | ||
10403 | */ | |
10404 | ||
10405 | static void | |
10406 | expand_omp_simd (struct omp_region *region, struct omp_for_data *fd) | |
10407 | { | |
10408 | tree type, t; | |
10409 | basic_block entry_bb, cont_bb, exit_bb, l0_bb, l1_bb, l2_bb, l2_dom_bb; | |
10410 | gimple_stmt_iterator gsi; | |
355fe088 | 10411 | gimple *stmt; |
538dd0b7 | 10412 | gcond *cond_stmt; |
74bf76ed JJ |
10413 | bool broken_loop = region->cont == NULL; |
10414 | edge e, ne; | |
10415 | tree *counts = NULL; | |
10416 | int i; | |
10417 | tree safelen = find_omp_clause (gimple_omp_for_clauses (fd->for_stmt), | |
10418 | OMP_CLAUSE_SAFELEN); | |
10419 | tree simduid = find_omp_clause (gimple_omp_for_clauses (fd->for_stmt), | |
10420 | OMP_CLAUSE__SIMDUID_); | |
acf0174b | 10421 | tree n1, n2; |
74bf76ed JJ |
10422 | |
10423 | type = TREE_TYPE (fd->loop.v); | |
10424 | entry_bb = region->entry; | |
10425 | cont_bb = region->cont; | |
10426 | gcc_assert (EDGE_COUNT (entry_bb->succs) == 2); | |
10427 | gcc_assert (broken_loop | |
10428 | || BRANCH_EDGE (entry_bb)->dest == FALLTHRU_EDGE (cont_bb)->dest); | |
10429 | l0_bb = FALLTHRU_EDGE (entry_bb)->dest; | |
10430 | if (!broken_loop) | |
10431 | { | |
10432 | gcc_assert (BRANCH_EDGE (cont_bb)->dest == l0_bb); | |
10433 | gcc_assert (EDGE_COUNT (cont_bb->succs) == 2); | |
10434 | l1_bb = split_block (cont_bb, last_stmt (cont_bb))->dest; | |
10435 | l2_bb = BRANCH_EDGE (entry_bb)->dest; | |
10436 | } | |
10437 | else | |
10438 | { | |
10439 | BRANCH_EDGE (entry_bb)->flags &= ~EDGE_ABNORMAL; | |
10440 | l1_bb = split_edge (BRANCH_EDGE (entry_bb)); | |
10441 | l2_bb = single_succ (l1_bb); | |
10442 | } | |
10443 | exit_bb = region->exit; | |
10444 | l2_dom_bb = NULL; | |
10445 | ||
10446 | gsi = gsi_last_bb (entry_bb); | |
10447 | ||
10448 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_FOR); | |
10449 | /* Not needed in SSA form right now. */ | |
10450 | gcc_assert (!gimple_in_ssa_p (cfun)); | |
10451 | if (fd->collapse > 1) | |
10452 | { | |
d9a6bd32 JJ |
10453 | int first_zero_iter = -1, dummy = -1; |
10454 | basic_block zero_iter_bb = l2_bb, dummy_bb = NULL; | |
74bf76ed JJ |
10455 | |
10456 | counts = XALLOCAVEC (tree, fd->collapse); | |
10457 | expand_omp_for_init_counts (fd, &gsi, entry_bb, counts, | |
10458 | zero_iter_bb, first_zero_iter, | |
d9a6bd32 | 10459 | dummy_bb, dummy, l2_dom_bb); |
74bf76ed JJ |
10460 | } |
10461 | if (l2_dom_bb == NULL) | |
10462 | l2_dom_bb = l1_bb; | |
10463 | ||
acf0174b | 10464 | n1 = fd->loop.n1; |
74bf76ed | 10465 | n2 = fd->loop.n2; |
acf0174b JJ |
10466 | if (gimple_omp_for_combined_into_p (fd->for_stmt)) |
10467 | { | |
10468 | tree innerc = find_omp_clause (gimple_omp_for_clauses (fd->for_stmt), | |
10469 | OMP_CLAUSE__LOOPTEMP_); | |
10470 | gcc_assert (innerc); | |
10471 | n1 = OMP_CLAUSE_DECL (innerc); | |
10472 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
10473 | OMP_CLAUSE__LOOPTEMP_); | |
10474 | gcc_assert (innerc); | |
10475 | n2 = OMP_CLAUSE_DECL (innerc); | |
10476 | expand_omp_build_assign (&gsi, fd->loop.v, | |
10477 | fold_convert (type, n1)); | |
10478 | if (fd->collapse > 1) | |
10479 | { | |
10480 | gsi_prev (&gsi); | |
10481 | expand_omp_for_init_vars (fd, &gsi, counts, NULL, n1); | |
10482 | gsi_next (&gsi); | |
10483 | } | |
10484 | } | |
74bf76ed JJ |
10485 | else |
10486 | { | |
10487 | expand_omp_build_assign (&gsi, fd->loop.v, | |
10488 | fold_convert (type, fd->loop.n1)); | |
10489 | if (fd->collapse > 1) | |
10490 | for (i = 0; i < fd->collapse; i++) | |
10491 | { | |
10492 | tree itype = TREE_TYPE (fd->loops[i].v); | |
10493 | if (POINTER_TYPE_P (itype)) | |
10494 | itype = signed_type_for (itype); | |
10495 | t = fold_convert (TREE_TYPE (fd->loops[i].v), fd->loops[i].n1); | |
10496 | expand_omp_build_assign (&gsi, fd->loops[i].v, t); | |
10497 | } | |
10498 | } | |
10499 | ||
10500 | /* Remove the GIMPLE_OMP_FOR statement. */ | |
10501 | gsi_remove (&gsi, true); | |
10502 | ||
10503 | if (!broken_loop) | |
10504 | { | |
10505 | /* Code to control the increment goes in the CONT_BB. */ | |
10506 | gsi = gsi_last_bb (cont_bb); | |
10507 | stmt = gsi_stmt (gsi); | |
10508 | gcc_assert (gimple_code (stmt) == GIMPLE_OMP_CONTINUE); | |
10509 | ||
10510 | if (POINTER_TYPE_P (type)) | |
10511 | t = fold_build_pointer_plus (fd->loop.v, fd->loop.step); | |
10512 | else | |
10513 | t = fold_build2 (PLUS_EXPR, type, fd->loop.v, fd->loop.step); | |
10514 | expand_omp_build_assign (&gsi, fd->loop.v, t); | |
10515 | ||
10516 | if (fd->collapse > 1) | |
10517 | { | |
10518 | i = fd->collapse - 1; | |
10519 | if (POINTER_TYPE_P (TREE_TYPE (fd->loops[i].v))) | |
10520 | { | |
10521 | t = fold_convert (sizetype, fd->loops[i].step); | |
10522 | t = fold_build_pointer_plus (fd->loops[i].v, t); | |
10523 | } | |
10524 | else | |
10525 | { | |
10526 | t = fold_convert (TREE_TYPE (fd->loops[i].v), | |
10527 | fd->loops[i].step); | |
10528 | t = fold_build2 (PLUS_EXPR, TREE_TYPE (fd->loops[i].v), | |
10529 | fd->loops[i].v, t); | |
10530 | } | |
10531 | expand_omp_build_assign (&gsi, fd->loops[i].v, t); | |
10532 | ||
10533 | for (i = fd->collapse - 1; i > 0; i--) | |
10534 | { | |
10535 | tree itype = TREE_TYPE (fd->loops[i].v); | |
10536 | tree itype2 = TREE_TYPE (fd->loops[i - 1].v); | |
10537 | if (POINTER_TYPE_P (itype2)) | |
10538 | itype2 = signed_type_for (itype2); | |
10539 | t = build3 (COND_EXPR, itype2, | |
10540 | build2 (fd->loops[i].cond_code, boolean_type_node, | |
10541 | fd->loops[i].v, | |
10542 | fold_convert (itype, fd->loops[i].n2)), | |
10543 | build_int_cst (itype2, 0), | |
10544 | fold_convert (itype2, fd->loops[i - 1].step)); | |
10545 | if (POINTER_TYPE_P (TREE_TYPE (fd->loops[i - 1].v))) | |
10546 | t = fold_build_pointer_plus (fd->loops[i - 1].v, t); | |
10547 | else | |
10548 | t = fold_build2 (PLUS_EXPR, itype2, fd->loops[i - 1].v, t); | |
10549 | expand_omp_build_assign (&gsi, fd->loops[i - 1].v, t); | |
10550 | ||
10551 | t = build3 (COND_EXPR, itype, | |
10552 | build2 (fd->loops[i].cond_code, boolean_type_node, | |
10553 | fd->loops[i].v, | |
10554 | fold_convert (itype, fd->loops[i].n2)), | |
10555 | fd->loops[i].v, | |
10556 | fold_convert (itype, fd->loops[i].n1)); | |
10557 | expand_omp_build_assign (&gsi, fd->loops[i].v, t); | |
10558 | } | |
10559 | } | |
10560 | ||
10561 | /* Remove GIMPLE_OMP_CONTINUE. */ | |
10562 | gsi_remove (&gsi, true); | |
10563 | } | |
10564 | ||
10565 | /* Emit the condition in L1_BB. */ | |
10566 | gsi = gsi_start_bb (l1_bb); | |
10567 | ||
10568 | t = fold_convert (type, n2); | |
10569 | t = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
10570 | false, GSI_CONTINUE_LINKING); | |
d9a6bd32 JJ |
10571 | tree v = fd->loop.v; |
10572 | if (DECL_P (v) && TREE_ADDRESSABLE (v)) | |
10573 | v = force_gimple_operand_gsi (&gsi, v, true, NULL_TREE, | |
10574 | false, GSI_CONTINUE_LINKING); | |
10575 | t = build2 (fd->loop.cond_code, boolean_type_node, v, t); | |
538dd0b7 DM |
10576 | cond_stmt = gimple_build_cond_empty (t); |
10577 | gsi_insert_after (&gsi, cond_stmt, GSI_CONTINUE_LINKING); | |
10578 | if (walk_tree (gimple_cond_lhs_ptr (cond_stmt), expand_omp_regimplify_p, | |
74bf76ed | 10579 | NULL, NULL) |
538dd0b7 | 10580 | || walk_tree (gimple_cond_rhs_ptr (cond_stmt), expand_omp_regimplify_p, |
74bf76ed JJ |
10581 | NULL, NULL)) |
10582 | { | |
538dd0b7 DM |
10583 | gsi = gsi_for_stmt (cond_stmt); |
10584 | gimple_regimplify_operands (cond_stmt, &gsi); | |
74bf76ed JJ |
10585 | } |
10586 | ||
10587 | /* Remove GIMPLE_OMP_RETURN. */ | |
10588 | gsi = gsi_last_bb (exit_bb); | |
10589 | gsi_remove (&gsi, true); | |
10590 | ||
10591 | /* Connect the new blocks. */ | |
10592 | remove_edge (FALLTHRU_EDGE (entry_bb)); | |
10593 | ||
10594 | if (!broken_loop) | |
10595 | { | |
10596 | remove_edge (BRANCH_EDGE (entry_bb)); | |
10597 | make_edge (entry_bb, l1_bb, EDGE_FALLTHRU); | |
10598 | ||
10599 | e = BRANCH_EDGE (l1_bb); | |
10600 | ne = FALLTHRU_EDGE (l1_bb); | |
10601 | e->flags = EDGE_TRUE_VALUE; | |
10602 | } | |
10603 | else | |
10604 | { | |
10605 | single_succ_edge (entry_bb)->flags = EDGE_FALLTHRU; | |
10606 | ||
10607 | ne = single_succ_edge (l1_bb); | |
10608 | e = make_edge (l1_bb, l0_bb, EDGE_TRUE_VALUE); | |
10609 | ||
10610 | } | |
10611 | ne->flags = EDGE_FALSE_VALUE; | |
10612 | e->probability = REG_BR_PROB_BASE * 7 / 8; | |
10613 | ne->probability = REG_BR_PROB_BASE / 8; | |
10614 | ||
10615 | set_immediate_dominator (CDI_DOMINATORS, l1_bb, entry_bb); | |
10616 | set_immediate_dominator (CDI_DOMINATORS, l2_bb, l2_dom_bb); | |
10617 | set_immediate_dominator (CDI_DOMINATORS, l0_bb, l1_bb); | |
10618 | ||
10619 | if (!broken_loop) | |
10620 | { | |
10621 | struct loop *loop = alloc_loop (); | |
10622 | loop->header = l1_bb; | |
01dde9b0 | 10623 | loop->latch = cont_bb; |
74bf76ed JJ |
10624 | add_loop (loop, l1_bb->loop_father); |
10625 | if (safelen == NULL_TREE) | |
10626 | loop->safelen = INT_MAX; | |
10627 | else | |
10628 | { | |
10629 | safelen = OMP_CLAUSE_SAFELEN_EXPR (safelen); | |
b46ebd6c JJ |
10630 | if (TREE_CODE (safelen) != INTEGER_CST) |
10631 | loop->safelen = 0; | |
10632 | else if (!tree_fits_uhwi_p (safelen) | |
10633 | || tree_to_uhwi (safelen) > INT_MAX) | |
74bf76ed JJ |
10634 | loop->safelen = INT_MAX; |
10635 | else | |
ae7e9ddd | 10636 | loop->safelen = tree_to_uhwi (safelen); |
74bf76ed JJ |
10637 | if (loop->safelen == 1) |
10638 | loop->safelen = 0; | |
10639 | } | |
10640 | if (simduid) | |
10641 | { | |
d9a6bd32 JJ |
10642 | loop->simduid = OMP_CLAUSE__SIMDUID__DECL (simduid); |
10643 | cfun->has_simduid_loops = true; | |
10644 | } | |
10645 | /* If not -fno-tree-loop-vectorize, hint that we want to vectorize | |
10646 | the loop. */ | |
10647 | if ((flag_tree_loop_vectorize | |
10648 | || (!global_options_set.x_flag_tree_loop_vectorize | |
10649 | && !global_options_set.x_flag_tree_vectorize)) | |
10650 | && flag_tree_loop_optimize | |
10651 | && loop->safelen > 1) | |
10652 | { | |
10653 | loop->force_vectorize = true; | |
10654 | cfun->has_force_vectorize_loops = true; | |
10655 | } | |
10656 | } | |
10657 | else if (simduid) | |
10658 | cfun->has_simduid_loops = true; | |
10659 | } | |
10660 | ||
10661 | /* Taskloop construct is represented after gimplification with | |
10662 | two GIMPLE_OMP_FOR constructs with GIMPLE_OMP_TASK sandwiched | |
10663 | in between them. This routine expands the outer GIMPLE_OMP_FOR, | |
10664 | which should just compute all the needed loop temporaries | |
10665 | for GIMPLE_OMP_TASK. */ | |
10666 | ||
10667 | static void | |
10668 | expand_omp_taskloop_for_outer (struct omp_region *region, | |
10669 | struct omp_for_data *fd, | |
10670 | gimple *inner_stmt) | |
10671 | { | |
10672 | tree type, bias = NULL_TREE; | |
10673 | basic_block entry_bb, cont_bb, exit_bb; | |
10674 | gimple_stmt_iterator gsi; | |
10675 | gassign *assign_stmt; | |
10676 | tree *counts = NULL; | |
10677 | int i; | |
10678 | ||
10679 | gcc_assert (inner_stmt); | |
10680 | gcc_assert (region->cont); | |
10681 | gcc_assert (gimple_code (inner_stmt) == GIMPLE_OMP_TASK | |
10682 | && gimple_omp_task_taskloop_p (inner_stmt)); | |
10683 | type = TREE_TYPE (fd->loop.v); | |
10684 | ||
10685 | /* See if we need to bias by LLONG_MIN. */ | |
10686 | if (fd->iter_type == long_long_unsigned_type_node | |
10687 | && TREE_CODE (type) == INTEGER_TYPE | |
10688 | && !TYPE_UNSIGNED (type)) | |
10689 | { | |
10690 | tree n1, n2; | |
10691 | ||
10692 | if (fd->loop.cond_code == LT_EXPR) | |
10693 | { | |
10694 | n1 = fd->loop.n1; | |
10695 | n2 = fold_build2 (PLUS_EXPR, type, fd->loop.n2, fd->loop.step); | |
10696 | } | |
10697 | else | |
10698 | { | |
10699 | n1 = fold_build2 (MINUS_EXPR, type, fd->loop.n2, fd->loop.step); | |
10700 | n2 = fd->loop.n1; | |
10701 | } | |
10702 | if (TREE_CODE (n1) != INTEGER_CST | |
10703 | || TREE_CODE (n2) != INTEGER_CST | |
10704 | || ((tree_int_cst_sgn (n1) < 0) ^ (tree_int_cst_sgn (n2) < 0))) | |
10705 | bias = fold_convert (fd->iter_type, TYPE_MIN_VALUE (type)); | |
10706 | } | |
10707 | ||
10708 | entry_bb = region->entry; | |
10709 | cont_bb = region->cont; | |
10710 | gcc_assert (EDGE_COUNT (entry_bb->succs) == 2); | |
10711 | gcc_assert (BRANCH_EDGE (entry_bb)->dest == FALLTHRU_EDGE (cont_bb)->dest); | |
10712 | exit_bb = region->exit; | |
10713 | ||
10714 | gsi = gsi_last_bb (entry_bb); | |
10715 | gimple *for_stmt = gsi_stmt (gsi); | |
10716 | gcc_assert (gimple_code (for_stmt) == GIMPLE_OMP_FOR); | |
10717 | if (fd->collapse > 1) | |
10718 | { | |
10719 | int first_zero_iter = -1, dummy = -1; | |
10720 | basic_block zero_iter_bb = NULL, dummy_bb = NULL, l2_dom_bb = NULL; | |
10721 | ||
10722 | counts = XALLOCAVEC (tree, fd->collapse); | |
10723 | expand_omp_for_init_counts (fd, &gsi, entry_bb, counts, | |
10724 | zero_iter_bb, first_zero_iter, | |
10725 | dummy_bb, dummy, l2_dom_bb); | |
10726 | ||
10727 | if (zero_iter_bb) | |
10728 | { | |
10729 | /* Some counts[i] vars might be uninitialized if | |
10730 | some loop has zero iterations. But the body shouldn't | |
10731 | be executed in that case, so just avoid uninit warnings. */ | |
10732 | for (i = first_zero_iter; i < fd->collapse; i++) | |
10733 | if (SSA_VAR_P (counts[i])) | |
10734 | TREE_NO_WARNING (counts[i]) = 1; | |
10735 | gsi_prev (&gsi); | |
10736 | edge e = split_block (entry_bb, gsi_stmt (gsi)); | |
10737 | entry_bb = e->dest; | |
10738 | make_edge (zero_iter_bb, entry_bb, EDGE_FALLTHRU); | |
10739 | gsi = gsi_last_bb (entry_bb); | |
10740 | set_immediate_dominator (CDI_DOMINATORS, entry_bb, | |
10741 | get_immediate_dominator (CDI_DOMINATORS, | |
10742 | zero_iter_bb)); | |
10743 | } | |
10744 | } | |
10745 | ||
10746 | tree t0, t1; | |
10747 | t1 = fd->loop.n2; | |
10748 | t0 = fd->loop.n1; | |
10749 | if (POINTER_TYPE_P (TREE_TYPE (t0)) | |
10750 | && TYPE_PRECISION (TREE_TYPE (t0)) | |
10751 | != TYPE_PRECISION (fd->iter_type)) | |
10752 | { | |
10753 | /* Avoid casting pointers to integer of a different size. */ | |
10754 | tree itype = signed_type_for (type); | |
10755 | t1 = fold_convert (fd->iter_type, fold_convert (itype, t1)); | |
10756 | t0 = fold_convert (fd->iter_type, fold_convert (itype, t0)); | |
10757 | } | |
10758 | else | |
10759 | { | |
10760 | t1 = fold_convert (fd->iter_type, t1); | |
10761 | t0 = fold_convert (fd->iter_type, t0); | |
10762 | } | |
10763 | if (bias) | |
10764 | { | |
10765 | t1 = fold_build2 (PLUS_EXPR, fd->iter_type, t1, bias); | |
10766 | t0 = fold_build2 (PLUS_EXPR, fd->iter_type, t0, bias); | |
10767 | } | |
10768 | ||
10769 | tree innerc = find_omp_clause (gimple_omp_task_clauses (inner_stmt), | |
10770 | OMP_CLAUSE__LOOPTEMP_); | |
10771 | gcc_assert (innerc); | |
10772 | tree startvar = OMP_CLAUSE_DECL (innerc); | |
10773 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), OMP_CLAUSE__LOOPTEMP_); | |
10774 | gcc_assert (innerc); | |
10775 | tree endvar = OMP_CLAUSE_DECL (innerc); | |
10776 | if (fd->collapse > 1 && TREE_CODE (fd->loop.n2) != INTEGER_CST) | |
10777 | { | |
10778 | gcc_assert (innerc); | |
10779 | for (i = 1; i < fd->collapse; i++) | |
10780 | { | |
10781 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
10782 | OMP_CLAUSE__LOOPTEMP_); | |
10783 | gcc_assert (innerc); | |
10784 | } | |
10785 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
10786 | OMP_CLAUSE__LOOPTEMP_); | |
10787 | if (innerc) | |
10788 | { | |
10789 | /* If needed (inner taskloop has lastprivate clause), propagate | |
10790 | down the total number of iterations. */ | |
10791 | tree t = force_gimple_operand_gsi (&gsi, fd->loop.n2, false, | |
10792 | NULL_TREE, false, | |
10793 | GSI_CONTINUE_LINKING); | |
10794 | assign_stmt = gimple_build_assign (OMP_CLAUSE_DECL (innerc), t); | |
10795 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
10796 | } | |
10797 | } | |
10798 | ||
10799 | t0 = force_gimple_operand_gsi (&gsi, t0, false, NULL_TREE, false, | |
10800 | GSI_CONTINUE_LINKING); | |
10801 | assign_stmt = gimple_build_assign (startvar, t0); | |
10802 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
10803 | ||
10804 | t1 = force_gimple_operand_gsi (&gsi, t1, false, NULL_TREE, false, | |
10805 | GSI_CONTINUE_LINKING); | |
10806 | assign_stmt = gimple_build_assign (endvar, t1); | |
10807 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
10808 | if (fd->collapse > 1) | |
10809 | expand_omp_for_init_vars (fd, &gsi, counts, inner_stmt, startvar); | |
10810 | ||
10811 | /* Remove the GIMPLE_OMP_FOR statement. */ | |
10812 | gsi = gsi_for_stmt (for_stmt); | |
10813 | gsi_remove (&gsi, true); | |
10814 | ||
10815 | gsi = gsi_last_bb (cont_bb); | |
10816 | gsi_remove (&gsi, true); | |
10817 | ||
10818 | gsi = gsi_last_bb (exit_bb); | |
10819 | gsi_remove (&gsi, true); | |
10820 | ||
10821 | FALLTHRU_EDGE (entry_bb)->probability = REG_BR_PROB_BASE; | |
10822 | remove_edge (BRANCH_EDGE (entry_bb)); | |
10823 | FALLTHRU_EDGE (cont_bb)->probability = REG_BR_PROB_BASE; | |
10824 | remove_edge (BRANCH_EDGE (cont_bb)); | |
10825 | set_immediate_dominator (CDI_DOMINATORS, exit_bb, cont_bb); | |
10826 | set_immediate_dominator (CDI_DOMINATORS, region->entry, | |
10827 | recompute_dominator (CDI_DOMINATORS, region->entry)); | |
10828 | } | |
10829 | ||
10830 | /* Taskloop construct is represented after gimplification with | |
10831 | two GIMPLE_OMP_FOR constructs with GIMPLE_OMP_TASK sandwiched | |
10832 | in between them. This routine expands the inner GIMPLE_OMP_FOR. | |
10833 | GOMP_taskloop{,_ull} function arranges for each task to be given just | |
10834 | a single range of iterations. */ | |
10835 | ||
10836 | static void | |
10837 | expand_omp_taskloop_for_inner (struct omp_region *region, | |
10838 | struct omp_for_data *fd, | |
10839 | gimple *inner_stmt) | |
10840 | { | |
10841 | tree e, t, type, itype, vmain, vback, bias = NULL_TREE; | |
10842 | basic_block entry_bb, exit_bb, body_bb, cont_bb, collapse_bb = NULL; | |
10843 | basic_block fin_bb; | |
10844 | gimple_stmt_iterator gsi; | |
10845 | edge ep; | |
10846 | bool broken_loop = region->cont == NULL; | |
10847 | tree *counts = NULL; | |
10848 | tree n1, n2, step; | |
10849 | ||
10850 | itype = type = TREE_TYPE (fd->loop.v); | |
10851 | if (POINTER_TYPE_P (type)) | |
10852 | itype = signed_type_for (type); | |
10853 | ||
10854 | /* See if we need to bias by LLONG_MIN. */ | |
10855 | if (fd->iter_type == long_long_unsigned_type_node | |
10856 | && TREE_CODE (type) == INTEGER_TYPE | |
10857 | && !TYPE_UNSIGNED (type)) | |
10858 | { | |
10859 | tree n1, n2; | |
10860 | ||
10861 | if (fd->loop.cond_code == LT_EXPR) | |
10862 | { | |
10863 | n1 = fd->loop.n1; | |
10864 | n2 = fold_build2 (PLUS_EXPR, type, fd->loop.n2, fd->loop.step); | |
10865 | } | |
10866 | else | |
10867 | { | |
10868 | n1 = fold_build2 (MINUS_EXPR, type, fd->loop.n2, fd->loop.step); | |
10869 | n2 = fd->loop.n1; | |
10870 | } | |
10871 | if (TREE_CODE (n1) != INTEGER_CST | |
10872 | || TREE_CODE (n2) != INTEGER_CST | |
10873 | || ((tree_int_cst_sgn (n1) < 0) ^ (tree_int_cst_sgn (n2) < 0))) | |
10874 | bias = fold_convert (fd->iter_type, TYPE_MIN_VALUE (type)); | |
10875 | } | |
10876 | ||
10877 | entry_bb = region->entry; | |
10878 | cont_bb = region->cont; | |
10879 | gcc_assert (EDGE_COUNT (entry_bb->succs) == 2); | |
10880 | fin_bb = BRANCH_EDGE (entry_bb)->dest; | |
10881 | gcc_assert (broken_loop | |
10882 | || (fin_bb == FALLTHRU_EDGE (cont_bb)->dest)); | |
10883 | body_bb = FALLTHRU_EDGE (entry_bb)->dest; | |
10884 | if (!broken_loop) | |
10885 | { | |
10886 | gcc_assert (BRANCH_EDGE (cont_bb)->dest == body_bb); | |
10887 | gcc_assert (EDGE_COUNT (cont_bb->succs) == 2); | |
10888 | } | |
10889 | exit_bb = region->exit; | |
10890 | ||
10891 | /* Iteration space partitioning goes in ENTRY_BB. */ | |
10892 | gsi = gsi_last_bb (entry_bb); | |
10893 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_FOR); | |
10894 | ||
10895 | if (fd->collapse > 1) | |
10896 | { | |
10897 | int first_zero_iter = -1, dummy = -1; | |
10898 | basic_block l2_dom_bb = NULL, dummy_bb = NULL; | |
10899 | ||
10900 | counts = XALLOCAVEC (tree, fd->collapse); | |
10901 | expand_omp_for_init_counts (fd, &gsi, entry_bb, counts, | |
10902 | fin_bb, first_zero_iter, | |
10903 | dummy_bb, dummy, l2_dom_bb); | |
10904 | t = NULL_TREE; | |
10905 | } | |
10906 | else | |
10907 | t = integer_one_node; | |
10908 | ||
10909 | step = fd->loop.step; | |
10910 | tree innerc = find_omp_clause (gimple_omp_for_clauses (fd->for_stmt), | |
10911 | OMP_CLAUSE__LOOPTEMP_); | |
10912 | gcc_assert (innerc); | |
10913 | n1 = OMP_CLAUSE_DECL (innerc); | |
10914 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), OMP_CLAUSE__LOOPTEMP_); | |
10915 | gcc_assert (innerc); | |
10916 | n2 = OMP_CLAUSE_DECL (innerc); | |
10917 | if (bias) | |
10918 | { | |
10919 | n1 = fold_build2 (PLUS_EXPR, fd->iter_type, n1, bias); | |
10920 | n2 = fold_build2 (PLUS_EXPR, fd->iter_type, n2, bias); | |
10921 | } | |
10922 | n1 = force_gimple_operand_gsi (&gsi, fold_convert (type, n1), | |
10923 | true, NULL_TREE, true, GSI_SAME_STMT); | |
10924 | n2 = force_gimple_operand_gsi (&gsi, fold_convert (itype, n2), | |
10925 | true, NULL_TREE, true, GSI_SAME_STMT); | |
10926 | step = force_gimple_operand_gsi (&gsi, fold_convert (itype, step), | |
10927 | true, NULL_TREE, true, GSI_SAME_STMT); | |
10928 | ||
10929 | tree startvar = fd->loop.v; | |
10930 | tree endvar = NULL_TREE; | |
10931 | ||
10932 | if (gimple_omp_for_combined_p (fd->for_stmt)) | |
10933 | { | |
10934 | tree clauses = gimple_omp_for_clauses (inner_stmt); | |
10935 | tree innerc = find_omp_clause (clauses, OMP_CLAUSE__LOOPTEMP_); | |
10936 | gcc_assert (innerc); | |
10937 | startvar = OMP_CLAUSE_DECL (innerc); | |
10938 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
10939 | OMP_CLAUSE__LOOPTEMP_); | |
10940 | gcc_assert (innerc); | |
10941 | endvar = OMP_CLAUSE_DECL (innerc); | |
10942 | } | |
10943 | t = fold_convert (TREE_TYPE (startvar), n1); | |
10944 | t = force_gimple_operand_gsi (&gsi, t, | |
10945 | DECL_P (startvar) | |
10946 | && TREE_ADDRESSABLE (startvar), | |
10947 | NULL_TREE, false, GSI_CONTINUE_LINKING); | |
10948 | gimple *assign_stmt = gimple_build_assign (startvar, t); | |
10949 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
10950 | ||
10951 | t = fold_convert (TREE_TYPE (startvar), n2); | |
10952 | e = force_gimple_operand_gsi (&gsi, t, true, NULL_TREE, | |
10953 | false, GSI_CONTINUE_LINKING); | |
10954 | if (endvar) | |
10955 | { | |
10956 | assign_stmt = gimple_build_assign (endvar, e); | |
10957 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
10958 | if (useless_type_conversion_p (TREE_TYPE (fd->loop.v), TREE_TYPE (e))) | |
10959 | assign_stmt = gimple_build_assign (fd->loop.v, e); | |
10960 | else | |
10961 | assign_stmt = gimple_build_assign (fd->loop.v, NOP_EXPR, e); | |
10962 | gsi_insert_after (&gsi, assign_stmt, GSI_CONTINUE_LINKING); | |
10963 | } | |
10964 | if (fd->collapse > 1) | |
10965 | expand_omp_for_init_vars (fd, &gsi, counts, inner_stmt, startvar); | |
10966 | ||
10967 | if (!broken_loop) | |
10968 | { | |
10969 | /* The code controlling the sequential loop replaces the | |
10970 | GIMPLE_OMP_CONTINUE. */ | |
10971 | gsi = gsi_last_bb (cont_bb); | |
10972 | gomp_continue *cont_stmt = as_a <gomp_continue *> (gsi_stmt (gsi)); | |
10973 | gcc_assert (gimple_code (cont_stmt) == GIMPLE_OMP_CONTINUE); | |
10974 | vmain = gimple_omp_continue_control_use (cont_stmt); | |
10975 | vback = gimple_omp_continue_control_def (cont_stmt); | |
10976 | ||
10977 | if (!gimple_omp_for_combined_p (fd->for_stmt)) | |
10978 | { | |
10979 | if (POINTER_TYPE_P (type)) | |
10980 | t = fold_build_pointer_plus (vmain, step); | |
10981 | else | |
10982 | t = fold_build2 (PLUS_EXPR, type, vmain, step); | |
10983 | t = force_gimple_operand_gsi (&gsi, t, | |
10984 | DECL_P (vback) | |
10985 | && TREE_ADDRESSABLE (vback), | |
10986 | NULL_TREE, true, GSI_SAME_STMT); | |
10987 | assign_stmt = gimple_build_assign (vback, t); | |
10988 | gsi_insert_before (&gsi, assign_stmt, GSI_SAME_STMT); | |
10989 | ||
10990 | t = build2 (fd->loop.cond_code, boolean_type_node, | |
10991 | DECL_P (vback) && TREE_ADDRESSABLE (vback) | |
10992 | ? t : vback, e); | |
10993 | gsi_insert_before (&gsi, gimple_build_cond_empty (t), GSI_SAME_STMT); | |
10994 | } | |
10995 | ||
10996 | /* Remove the GIMPLE_OMP_CONTINUE statement. */ | |
10997 | gsi_remove (&gsi, true); | |
10998 | ||
10999 | if (fd->collapse > 1 && !gimple_omp_for_combined_p (fd->for_stmt)) | |
11000 | collapse_bb = extract_omp_for_update_vars (fd, cont_bb, body_bb); | |
11001 | } | |
11002 | ||
11003 | /* Remove the GIMPLE_OMP_FOR statement. */ | |
11004 | gsi = gsi_for_stmt (fd->for_stmt); | |
11005 | gsi_remove (&gsi, true); | |
11006 | ||
11007 | /* Remove the GIMPLE_OMP_RETURN statement. */ | |
11008 | gsi = gsi_last_bb (exit_bb); | |
11009 | gsi_remove (&gsi, true); | |
11010 | ||
11011 | FALLTHRU_EDGE (entry_bb)->probability = REG_BR_PROB_BASE; | |
11012 | if (!broken_loop) | |
11013 | remove_edge (BRANCH_EDGE (entry_bb)); | |
11014 | else | |
11015 | { | |
11016 | remove_edge_and_dominated_blocks (BRANCH_EDGE (entry_bb)); | |
11017 | region->outer->cont = NULL; | |
11018 | } | |
11019 | ||
11020 | /* Connect all the blocks. */ | |
11021 | if (!broken_loop) | |
11022 | { | |
11023 | ep = find_edge (cont_bb, body_bb); | |
11024 | if (gimple_omp_for_combined_p (fd->for_stmt)) | |
11025 | { | |
11026 | remove_edge (ep); | |
11027 | ep = NULL; | |
74bf76ed | 11028 | } |
d9a6bd32 | 11029 | else if (fd->collapse > 1) |
74bf76ed | 11030 | { |
d9a6bd32 JJ |
11031 | remove_edge (ep); |
11032 | ep = make_edge (cont_bb, collapse_bb, EDGE_TRUE_VALUE); | |
74bf76ed | 11033 | } |
d9a6bd32 JJ |
11034 | else |
11035 | ep->flags = EDGE_TRUE_VALUE; | |
11036 | find_edge (cont_bb, fin_bb)->flags | |
11037 | = ep ? EDGE_FALSE_VALUE : EDGE_FALLTHRU; | |
74bf76ed | 11038 | } |
74bf76ed | 11039 | |
d9a6bd32 JJ |
11040 | set_immediate_dominator (CDI_DOMINATORS, body_bb, |
11041 | recompute_dominator (CDI_DOMINATORS, body_bb)); | |
11042 | if (!broken_loop) | |
11043 | set_immediate_dominator (CDI_DOMINATORS, fin_bb, | |
11044 | recompute_dominator (CDI_DOMINATORS, fin_bb)); | |
11045 | ||
11046 | if (!broken_loop && !gimple_omp_for_combined_p (fd->for_stmt)) | |
11047 | { | |
11048 | struct loop *loop = alloc_loop (); | |
11049 | loop->header = body_bb; | |
11050 | if (collapse_bb == NULL) | |
11051 | loop->latch = cont_bb; | |
11052 | add_loop (loop, body_bb->loop_father); | |
11053 | } | |
11054 | } | |
953ff289 | 11055 | |
e4834818 NS |
11056 | /* A subroutine of expand_omp_for. Generate code for an OpenACC |
11057 | partitioned loop. The lowering here is abstracted, in that the | |
11058 | loop parameters are passed through internal functions, which are | |
11059 | further lowered by oacc_device_lower, once we get to the target | |
11060 | compiler. The loop is of the form: | |
11061 | ||
11062 | for (V = B; V LTGT E; V += S) {BODY} | |
11063 | ||
11064 | where LTGT is < or >. We may have a specified chunking size, CHUNKING | |
11065 | (constant 0 for no chunking) and we will have a GWV partitioning | |
11066 | mask, specifying dimensions over which the loop is to be | |
11067 | partitioned (see note below). We generate code that looks like: | |
11068 | ||
11069 | <entry_bb> [incoming FALL->body, BRANCH->exit] | |
11070 | typedef signedintify (typeof (V)) T; // underlying signed integral type | |
11071 | T range = E - B; | |
11072 | T chunk_no = 0; | |
11073 | T DIR = LTGT == '<' ? +1 : -1; | |
11074 | T chunk_max = GOACC_LOOP_CHUNK (dir, range, S, CHUNK_SIZE, GWV); | |
11075 | T step = GOACC_LOOP_STEP (dir, range, S, CHUNK_SIZE, GWV); | |
11076 | ||
11077 | <head_bb> [created by splitting end of entry_bb] | |
11078 | T offset = GOACC_LOOP_OFFSET (dir, range, S, CHUNK_SIZE, GWV, chunk_no); | |
11079 | T bound = GOACC_LOOP_BOUND (dir, range, S, CHUNK_SIZE, GWV, offset); | |
11080 | if (!(offset LTGT bound)) goto bottom_bb; | |
11081 | ||
11082 | <body_bb> [incoming] | |
11083 | V = B + offset; | |
11084 | {BODY} | |
11085 | ||
11086 | <cont_bb> [incoming, may == body_bb FALL->exit_bb, BRANCH->body_bb] | |
11087 | offset += step; | |
11088 | if (offset LTGT bound) goto body_bb; [*] | |
11089 | ||
11090 | <bottom_bb> [created by splitting start of exit_bb] insert BRANCH->head_bb | |
11091 | chunk_no++; | |
11092 | if (chunk < chunk_max) goto head_bb; | |
11093 | ||
11094 | <exit_bb> [incoming] | |
11095 | V = B + ((range -/+ 1) / S +/- 1) * S [*] | |
11096 | ||
11097 | [*] Needed if V live at end of loop | |
11098 | ||
11099 | Note: CHUNKING & GWV mask are specified explicitly here. This is a | |
11100 | transition, and will be specified by a more general mechanism shortly. | |
11101 | */ | |
11102 | ||
11103 | static void | |
11104 | expand_oacc_for (struct omp_region *region, struct omp_for_data *fd) | |
11105 | { | |
11106 | tree v = fd->loop.v; | |
11107 | enum tree_code cond_code = fd->loop.cond_code; | |
11108 | enum tree_code plus_code = PLUS_EXPR; | |
11109 | ||
11110 | tree chunk_size = integer_minus_one_node; | |
11111 | tree gwv = integer_zero_node; | |
11112 | tree iter_type = TREE_TYPE (v); | |
11113 | tree diff_type = iter_type; | |
11114 | tree plus_type = iter_type; | |
11115 | struct oacc_collapse *counts = NULL; | |
11116 | ||
11117 | gcc_checking_assert (gimple_omp_for_kind (fd->for_stmt) | |
11118 | == GF_OMP_FOR_KIND_OACC_LOOP); | |
11119 | gcc_assert (!gimple_omp_for_combined_into_p (fd->for_stmt)); | |
11120 | gcc_assert (cond_code == LT_EXPR || cond_code == GT_EXPR); | |
11121 | ||
11122 | if (POINTER_TYPE_P (iter_type)) | |
11123 | { | |
11124 | plus_code = POINTER_PLUS_EXPR; | |
11125 | plus_type = sizetype; | |
11126 | } | |
11127 | if (POINTER_TYPE_P (diff_type) || TYPE_UNSIGNED (diff_type)) | |
11128 | diff_type = signed_type_for (diff_type); | |
11129 | ||
11130 | basic_block entry_bb = region->entry; /* BB ending in OMP_FOR */ | |
11131 | basic_block exit_bb = region->exit; /* BB ending in OMP_RETURN */ | |
11132 | basic_block cont_bb = region->cont; /* BB ending in OMP_CONTINUE */ | |
11133 | basic_block bottom_bb = NULL; | |
11134 | ||
11135 | /* entry_bb has two sucessors; the branch edge is to the exit | |
11136 | block, fallthrough edge to body. */ | |
11137 | gcc_assert (EDGE_COUNT (entry_bb->succs) == 2 | |
11138 | && BRANCH_EDGE (entry_bb)->dest == exit_bb); | |
11139 | ||
11140 | /* If cont_bb non-NULL, it has 2 successors. The branch successor is | |
11141 | body_bb, or to a block whose only successor is the body_bb. Its | |
11142 | fallthrough successor is the final block (same as the branch | |
11143 | successor of the entry_bb). */ | |
11144 | if (cont_bb) | |
11145 | { | |
11146 | basic_block body_bb = FALLTHRU_EDGE (entry_bb)->dest; | |
11147 | basic_block bed = BRANCH_EDGE (cont_bb)->dest; | |
11148 | ||
11149 | gcc_assert (FALLTHRU_EDGE (cont_bb)->dest == exit_bb); | |
11150 | gcc_assert (bed == body_bb || single_succ_edge (bed)->dest == body_bb); | |
11151 | } | |
11152 | else | |
11153 | gcc_assert (!gimple_in_ssa_p (cfun)); | |
11154 | ||
11155 | /* The exit block only has entry_bb and cont_bb as predecessors. */ | |
11156 | gcc_assert (EDGE_COUNT (exit_bb->preds) == 1 + (cont_bb != NULL)); | |
11157 | ||
11158 | tree chunk_no; | |
11159 | tree chunk_max = NULL_TREE; | |
11160 | tree bound, offset; | |
11161 | tree step = create_tmp_var (diff_type, ".step"); | |
11162 | bool up = cond_code == LT_EXPR; | |
11163 | tree dir = build_int_cst (diff_type, up ? +1 : -1); | |
11164 | bool chunking = !gimple_in_ssa_p (cfun);; | |
11165 | bool negating; | |
11166 | ||
11167 | /* SSA instances. */ | |
11168 | tree offset_incr = NULL_TREE; | |
11169 | tree offset_init = NULL_TREE; | |
11170 | ||
11171 | gimple_stmt_iterator gsi; | |
11172 | gassign *ass; | |
11173 | gcall *call; | |
11174 | gimple *stmt; | |
11175 | tree expr; | |
11176 | location_t loc; | |
11177 | edge split, be, fte; | |
11178 | ||
11179 | /* Split the end of entry_bb to create head_bb. */ | |
11180 | split = split_block (entry_bb, last_stmt (entry_bb)); | |
11181 | basic_block head_bb = split->dest; | |
11182 | entry_bb = split->src; | |
11183 | ||
11184 | /* Chunk setup goes at end of entry_bb, replacing the omp_for. */ | |
11185 | gsi = gsi_last_bb (entry_bb); | |
11186 | gomp_for *for_stmt = as_a <gomp_for *> (gsi_stmt (gsi)); | |
11187 | loc = gimple_location (for_stmt); | |
11188 | ||
11189 | if (gimple_in_ssa_p (cfun)) | |
11190 | { | |
11191 | offset_init = gimple_omp_for_index (for_stmt, 0); | |
11192 | gcc_assert (integer_zerop (fd->loop.n1)); | |
11193 | /* The SSA parallelizer does gang parallelism. */ | |
11194 | gwv = build_int_cst (integer_type_node, GOMP_DIM_MASK (GOMP_DIM_GANG)); | |
11195 | } | |
11196 | ||
11197 | if (fd->collapse > 1) | |
11198 | { | |
11199 | counts = XALLOCAVEC (struct oacc_collapse, fd->collapse); | |
11200 | tree total = expand_oacc_collapse_init (fd, &gsi, counts, | |
11201 | TREE_TYPE (fd->loop.n2)); | |
11202 | ||
11203 | if (SSA_VAR_P (fd->loop.n2)) | |
11204 | { | |
11205 | total = force_gimple_operand_gsi (&gsi, total, false, NULL_TREE, | |
11206 | true, GSI_SAME_STMT); | |
11207 | ass = gimple_build_assign (fd->loop.n2, total); | |
11208 | gsi_insert_before (&gsi, ass, GSI_SAME_STMT); | |
11209 | } | |
11210 | ||
11211 | } | |
11212 | ||
11213 | tree b = fd->loop.n1; | |
11214 | tree e = fd->loop.n2; | |
11215 | tree s = fd->loop.step; | |
11216 | ||
11217 | b = force_gimple_operand_gsi (&gsi, b, true, NULL_TREE, true, GSI_SAME_STMT); | |
11218 | e = force_gimple_operand_gsi (&gsi, e, true, NULL_TREE, true, GSI_SAME_STMT); | |
11219 | ||
11220 | /* Convert the step, avoiding possible unsigned->signed overflow. */ | |
11221 | negating = !up && TYPE_UNSIGNED (TREE_TYPE (s)); | |
11222 | if (negating) | |
11223 | s = fold_build1 (NEGATE_EXPR, TREE_TYPE (s), s); | |
11224 | s = fold_convert (diff_type, s); | |
11225 | if (negating) | |
11226 | s = fold_build1 (NEGATE_EXPR, diff_type, s); | |
11227 | s = force_gimple_operand_gsi (&gsi, s, true, NULL_TREE, true, GSI_SAME_STMT); | |
11228 | ||
11229 | if (!chunking) | |
11230 | chunk_size = integer_zero_node; | |
11231 | expr = fold_convert (diff_type, chunk_size); | |
11232 | chunk_size = force_gimple_operand_gsi (&gsi, expr, true, | |
11233 | NULL_TREE, true, GSI_SAME_STMT); | |
11234 | /* Determine the range, avoiding possible unsigned->signed overflow. */ | |
11235 | negating = !up && TYPE_UNSIGNED (iter_type); | |
11236 | expr = fold_build2 (MINUS_EXPR, plus_type, | |
11237 | fold_convert (plus_type, negating ? b : e), | |
11238 | fold_convert (plus_type, negating ? e : b)); | |
11239 | expr = fold_convert (diff_type, expr); | |
11240 | if (negating) | |
11241 | expr = fold_build1 (NEGATE_EXPR, diff_type, expr); | |
11242 | tree range = force_gimple_operand_gsi (&gsi, expr, true, | |
11243 | NULL_TREE, true, GSI_SAME_STMT); | |
11244 | ||
11245 | chunk_no = build_int_cst (diff_type, 0); | |
11246 | if (chunking) | |
11247 | { | |
11248 | gcc_assert (!gimple_in_ssa_p (cfun)); | |
11249 | ||
11250 | expr = chunk_no; | |
11251 | chunk_max = create_tmp_var (diff_type, ".chunk_max"); | |
11252 | chunk_no = create_tmp_var (diff_type, ".chunk_no"); | |
11253 | ||
11254 | ass = gimple_build_assign (chunk_no, expr); | |
11255 | gsi_insert_before (&gsi, ass, GSI_SAME_STMT); | |
11256 | ||
11257 | call = gimple_build_call_internal (IFN_GOACC_LOOP, 6, | |
11258 | build_int_cst (integer_type_node, | |
11259 | IFN_GOACC_LOOP_CHUNKS), | |
11260 | dir, range, s, chunk_size, gwv); | |
11261 | gimple_call_set_lhs (call, chunk_max); | |
11262 | gimple_set_location (call, loc); | |
11263 | gsi_insert_before (&gsi, call, GSI_SAME_STMT); | |
11264 | } | |
11265 | else | |
11266 | chunk_size = chunk_no; | |
11267 | ||
11268 | call = gimple_build_call_internal (IFN_GOACC_LOOP, 6, | |
11269 | build_int_cst (integer_type_node, | |
11270 | IFN_GOACC_LOOP_STEP), | |
11271 | dir, range, s, chunk_size, gwv); | |
11272 | gimple_call_set_lhs (call, step); | |
11273 | gimple_set_location (call, loc); | |
11274 | gsi_insert_before (&gsi, call, GSI_SAME_STMT); | |
11275 | ||
11276 | /* Remove the GIMPLE_OMP_FOR. */ | |
11277 | gsi_remove (&gsi, true); | |
11278 | ||
11279 | /* Fixup edges from head_bb */ | |
11280 | be = BRANCH_EDGE (head_bb); | |
11281 | fte = FALLTHRU_EDGE (head_bb); | |
11282 | be->flags |= EDGE_FALSE_VALUE; | |
11283 | fte->flags ^= EDGE_FALLTHRU | EDGE_TRUE_VALUE; | |
11284 | ||
11285 | basic_block body_bb = fte->dest; | |
11286 | ||
11287 | if (gimple_in_ssa_p (cfun)) | |
11288 | { | |
11289 | gsi = gsi_last_bb (cont_bb); | |
11290 | gomp_continue *cont_stmt = as_a <gomp_continue *> (gsi_stmt (gsi)); | |
11291 | ||
11292 | offset = gimple_omp_continue_control_use (cont_stmt); | |
11293 | offset_incr = gimple_omp_continue_control_def (cont_stmt); | |
11294 | } | |
11295 | else | |
11296 | { | |
11297 | offset = create_tmp_var (diff_type, ".offset"); | |
11298 | offset_init = offset_incr = offset; | |
11299 | } | |
11300 | bound = create_tmp_var (TREE_TYPE (offset), ".bound"); | |
11301 | ||
11302 | /* Loop offset & bound go into head_bb. */ | |
11303 | gsi = gsi_start_bb (head_bb); | |
11304 | ||
11305 | call = gimple_build_call_internal (IFN_GOACC_LOOP, 7, | |
11306 | build_int_cst (integer_type_node, | |
11307 | IFN_GOACC_LOOP_OFFSET), | |
11308 | dir, range, s, | |
11309 | chunk_size, gwv, chunk_no); | |
11310 | gimple_call_set_lhs (call, offset_init); | |
11311 | gimple_set_location (call, loc); | |
11312 | gsi_insert_after (&gsi, call, GSI_CONTINUE_LINKING); | |
11313 | ||
11314 | call = gimple_build_call_internal (IFN_GOACC_LOOP, 7, | |
11315 | build_int_cst (integer_type_node, | |
11316 | IFN_GOACC_LOOP_BOUND), | |
11317 | dir, range, s, | |
11318 | chunk_size, gwv, offset_init); | |
11319 | gimple_call_set_lhs (call, bound); | |
11320 | gimple_set_location (call, loc); | |
11321 | gsi_insert_after (&gsi, call, GSI_CONTINUE_LINKING); | |
11322 | ||
11323 | expr = build2 (cond_code, boolean_type_node, offset_init, bound); | |
11324 | gsi_insert_after (&gsi, gimple_build_cond_empty (expr), | |
11325 | GSI_CONTINUE_LINKING); | |
11326 | ||
11327 | /* V assignment goes into body_bb. */ | |
11328 | if (!gimple_in_ssa_p (cfun)) | |
11329 | { | |
11330 | gsi = gsi_start_bb (body_bb); | |
11331 | ||
11332 | expr = build2 (plus_code, iter_type, b, | |
11333 | fold_convert (plus_type, offset)); | |
11334 | expr = force_gimple_operand_gsi (&gsi, expr, false, NULL_TREE, | |
11335 | true, GSI_SAME_STMT); | |
11336 | ass = gimple_build_assign (v, expr); | |
11337 | gsi_insert_before (&gsi, ass, GSI_SAME_STMT); | |
11338 | if (fd->collapse > 1) | |
11339 | expand_oacc_collapse_vars (fd, &gsi, counts, v); | |
11340 | } | |
11341 | ||
11342 | /* Loop increment goes into cont_bb. If this is not a loop, we | |
11343 | will have spawned threads as if it was, and each one will | |
11344 | execute one iteration. The specification is not explicit about | |
11345 | whether such constructs are ill-formed or not, and they can | |
11346 | occur, especially when noreturn routines are involved. */ | |
11347 | if (cont_bb) | |
11348 | { | |
11349 | gsi = gsi_last_bb (cont_bb); | |
11350 | gomp_continue *cont_stmt = as_a <gomp_continue *> (gsi_stmt (gsi)); | |
11351 | loc = gimple_location (cont_stmt); | |
11352 | ||
11353 | /* Increment offset. */ | |
11354 | if (gimple_in_ssa_p (cfun)) | |
11355 | expr= build2 (plus_code, iter_type, offset, | |
11356 | fold_convert (plus_type, step)); | |
11357 | else | |
11358 | expr = build2 (PLUS_EXPR, diff_type, offset, step); | |
11359 | expr = force_gimple_operand_gsi (&gsi, expr, false, NULL_TREE, | |
11360 | true, GSI_SAME_STMT); | |
11361 | ass = gimple_build_assign (offset_incr, expr); | |
11362 | gsi_insert_before (&gsi, ass, GSI_SAME_STMT); | |
11363 | expr = build2 (cond_code, boolean_type_node, offset_incr, bound); | |
11364 | gsi_insert_before (&gsi, gimple_build_cond_empty (expr), GSI_SAME_STMT); | |
11365 | ||
11366 | /* Remove the GIMPLE_OMP_CONTINUE. */ | |
11367 | gsi_remove (&gsi, true); | |
11368 | ||
11369 | /* Fixup edges from cont_bb */ | |
11370 | be = BRANCH_EDGE (cont_bb); | |
11371 | fte = FALLTHRU_EDGE (cont_bb); | |
11372 | be->flags |= EDGE_TRUE_VALUE; | |
11373 | fte->flags ^= EDGE_FALLTHRU | EDGE_FALSE_VALUE; | |
11374 | ||
11375 | if (chunking) | |
11376 | { | |
11377 | /* Split the beginning of exit_bb to make bottom_bb. We | |
11378 | need to insert a nop at the start, because splitting is | |
11379 | after a stmt, not before. */ | |
11380 | gsi = gsi_start_bb (exit_bb); | |
11381 | stmt = gimple_build_nop (); | |
11382 | gsi_insert_before (&gsi, stmt, GSI_SAME_STMT); | |
11383 | split = split_block (exit_bb, stmt); | |
11384 | bottom_bb = split->src; | |
11385 | exit_bb = split->dest; | |
11386 | gsi = gsi_last_bb (bottom_bb); | |
11387 | ||
11388 | /* Chunk increment and test goes into bottom_bb. */ | |
11389 | expr = build2 (PLUS_EXPR, diff_type, chunk_no, | |
11390 | build_int_cst (diff_type, 1)); | |
11391 | ass = gimple_build_assign (chunk_no, expr); | |
11392 | gsi_insert_after (&gsi, ass, GSI_CONTINUE_LINKING); | |
11393 | ||
11394 | /* Chunk test at end of bottom_bb. */ | |
11395 | expr = build2 (LT_EXPR, boolean_type_node, chunk_no, chunk_max); | |
11396 | gsi_insert_after (&gsi, gimple_build_cond_empty (expr), | |
11397 | GSI_CONTINUE_LINKING); | |
11398 | ||
11399 | /* Fixup edges from bottom_bb. */ | |
11400 | split->flags ^= EDGE_FALLTHRU | EDGE_FALSE_VALUE; | |
11401 | make_edge (bottom_bb, head_bb, EDGE_TRUE_VALUE); | |
11402 | } | |
11403 | } | |
11404 | ||
11405 | gsi = gsi_last_bb (exit_bb); | |
11406 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_RETURN); | |
11407 | loc = gimple_location (gsi_stmt (gsi)); | |
11408 | ||
11409 | if (!gimple_in_ssa_p (cfun)) | |
11410 | { | |
11411 | /* Insert the final value of V, in case it is live. This is the | |
11412 | value for the only thread that survives past the join. */ | |
11413 | expr = fold_build2 (MINUS_EXPR, diff_type, range, dir); | |
11414 | expr = fold_build2 (PLUS_EXPR, diff_type, expr, s); | |
11415 | expr = fold_build2 (TRUNC_DIV_EXPR, diff_type, expr, s); | |
11416 | expr = fold_build2 (MULT_EXPR, diff_type, expr, s); | |
11417 | expr = build2 (plus_code, iter_type, b, fold_convert (plus_type, expr)); | |
11418 | expr = force_gimple_operand_gsi (&gsi, expr, false, NULL_TREE, | |
11419 | true, GSI_SAME_STMT); | |
11420 | ass = gimple_build_assign (v, expr); | |
11421 | gsi_insert_before (&gsi, ass, GSI_SAME_STMT); | |
11422 | } | |
11423 | ||
11424 | /* Remove the OMP_RETURN. */ | |
11425 | gsi_remove (&gsi, true); | |
11426 | ||
11427 | if (cont_bb) | |
11428 | { | |
11429 | /* We now have one or two nested loops. Update the loop | |
11430 | structures. */ | |
11431 | struct loop *parent = entry_bb->loop_father; | |
11432 | struct loop *body = body_bb->loop_father; | |
11433 | ||
11434 | if (chunking) | |
11435 | { | |
11436 | struct loop *chunk_loop = alloc_loop (); | |
11437 | chunk_loop->header = head_bb; | |
11438 | chunk_loop->latch = bottom_bb; | |
11439 | add_loop (chunk_loop, parent); | |
11440 | parent = chunk_loop; | |
11441 | } | |
11442 | else if (parent != body) | |
11443 | { | |
11444 | gcc_assert (body->header == body_bb); | |
11445 | gcc_assert (body->latch == cont_bb | |
11446 | || single_pred (body->latch) == cont_bb); | |
11447 | parent = NULL; | |
11448 | } | |
11449 | ||
11450 | if (parent) | |
11451 | { | |
11452 | struct loop *body_loop = alloc_loop (); | |
11453 | body_loop->header = body_bb; | |
11454 | body_loop->latch = cont_bb; | |
11455 | add_loop (body_loop, parent); | |
11456 | } | |
11457 | } | |
11458 | } | |
11459 | ||
41dbbb37 | 11460 | /* Expand the OMP loop defined by REGION. */ |
953ff289 | 11461 | |
50674e96 | 11462 | static void |
355fe088 | 11463 | expand_omp_for (struct omp_region *region, gimple *inner_stmt) |
50674e96 DN |
11464 | { |
11465 | struct omp_for_data fd; | |
a68ab351 | 11466 | struct omp_for_data_loop *loops; |
953ff289 | 11467 | |
a68ab351 JJ |
11468 | loops |
11469 | = (struct omp_for_data_loop *) | |
726a989a | 11470 | alloca (gimple_omp_for_collapse (last_stmt (region->entry)) |
a68ab351 | 11471 | * sizeof (struct omp_for_data_loop)); |
538dd0b7 DM |
11472 | extract_omp_for_data (as_a <gomp_for *> (last_stmt (region->entry)), |
11473 | &fd, loops); | |
21a66e91 | 11474 | region->sched_kind = fd.sched_kind; |
e01d41e5 | 11475 | region->sched_modifiers = fd.sched_modifiers; |
953ff289 | 11476 | |
135a171d JJ |
11477 | gcc_assert (EDGE_COUNT (region->entry->succs) == 2); |
11478 | BRANCH_EDGE (region->entry)->flags &= ~EDGE_ABNORMAL; | |
11479 | FALLTHRU_EDGE (region->entry)->flags &= ~EDGE_ABNORMAL; | |
11480 | if (region->cont) | |
11481 | { | |
11482 | gcc_assert (EDGE_COUNT (region->cont->succs) == 2); | |
11483 | BRANCH_EDGE (region->cont)->flags &= ~EDGE_ABNORMAL; | |
11484 | FALLTHRU_EDGE (region->cont)->flags &= ~EDGE_ABNORMAL; | |
11485 | } | |
6093bc06 | 11486 | else |
1aa95df7 | 11487 | /* If there isn't a continue then this is a degerate case where |
6093bc06 RB |
11488 | the introduction of abnormal edges during lowering will prevent |
11489 | original loops from being detected. Fix that up. */ | |
11490 | loops_state_set (LOOPS_NEED_FIXUP); | |
135a171d | 11491 | |
0aadce73 | 11492 | if (gimple_omp_for_kind (fd.for_stmt) & GF_OMP_FOR_SIMD) |
74bf76ed | 11493 | expand_omp_simd (region, &fd); |
9a771876 JJ |
11494 | else if (gimple_omp_for_kind (fd.for_stmt) == GF_OMP_FOR_KIND_CILKFOR) |
11495 | expand_cilk_for (region, &fd); | |
e4834818 NS |
11496 | else if (gimple_omp_for_kind (fd.for_stmt) == GF_OMP_FOR_KIND_OACC_LOOP) |
11497 | { | |
11498 | gcc_assert (!inner_stmt); | |
11499 | expand_oacc_for (region, &fd); | |
11500 | } | |
d9a6bd32 JJ |
11501 | else if (gimple_omp_for_kind (fd.for_stmt) == GF_OMP_FOR_KIND_TASKLOOP) |
11502 | { | |
11503 | if (gimple_omp_for_combined_into_p (fd.for_stmt)) | |
11504 | expand_omp_taskloop_for_inner (region, &fd, inner_stmt); | |
11505 | else | |
11506 | expand_omp_taskloop_for_outer (region, &fd, inner_stmt); | |
11507 | } | |
74bf76ed | 11508 | else if (fd.sched_kind == OMP_CLAUSE_SCHEDULE_STATIC |
acf0174b | 11509 | && !fd.have_ordered) |
953ff289 DN |
11510 | { |
11511 | if (fd.chunk_size == NULL) | |
acf0174b | 11512 | expand_omp_for_static_nochunk (region, &fd, inner_stmt); |
953ff289 | 11513 | else |
acf0174b | 11514 | expand_omp_for_static_chunk (region, &fd, inner_stmt); |
953ff289 DN |
11515 | } |
11516 | else | |
11517 | { | |
a68ab351 JJ |
11518 | int fn_index, start_ix, next_ix; |
11519 | ||
74bf76ed JJ |
11520 | gcc_assert (gimple_omp_for_kind (fd.for_stmt) |
11521 | == GF_OMP_FOR_KIND_FOR); | |
9abd5ed9 JJ |
11522 | if (fd.chunk_size == NULL |
11523 | && fd.sched_kind == OMP_CLAUSE_SCHEDULE_STATIC) | |
11524 | fd.chunk_size = integer_zero_node; | |
a68ab351 | 11525 | gcc_assert (fd.sched_kind != OMP_CLAUSE_SCHEDULE_AUTO); |
e01d41e5 JJ |
11526 | switch (fd.sched_kind) |
11527 | { | |
11528 | case OMP_CLAUSE_SCHEDULE_RUNTIME: | |
11529 | fn_index = 3; | |
11530 | break; | |
11531 | case OMP_CLAUSE_SCHEDULE_DYNAMIC: | |
11532 | case OMP_CLAUSE_SCHEDULE_GUIDED: | |
11533 | if ((fd.sched_modifiers & OMP_CLAUSE_SCHEDULE_NONMONOTONIC) | |
11534 | && !fd.ordered | |
11535 | && !fd.have_ordered) | |
11536 | { | |
11537 | fn_index = 3 + fd.sched_kind; | |
11538 | break; | |
11539 | } | |
11540 | /* FALLTHRU */ | |
11541 | default: | |
11542 | fn_index = fd.sched_kind; | |
11543 | break; | |
11544 | } | |
d9a6bd32 | 11545 | if (!fd.ordered) |
e01d41e5 | 11546 | fn_index += fd.have_ordered * 6; |
d9a6bd32 JJ |
11547 | if (fd.ordered) |
11548 | start_ix = ((int)BUILT_IN_GOMP_LOOP_DOACROSS_STATIC_START) + fn_index; | |
11549 | else | |
11550 | start_ix = ((int)BUILT_IN_GOMP_LOOP_STATIC_START) + fn_index; | |
e79983f4 | 11551 | next_ix = ((int)BUILT_IN_GOMP_LOOP_STATIC_NEXT) + fn_index; |
a68ab351 JJ |
11552 | if (fd.iter_type == long_long_unsigned_type_node) |
11553 | { | |
e79983f4 MM |
11554 | start_ix += ((int)BUILT_IN_GOMP_LOOP_ULL_STATIC_START |
11555 | - (int)BUILT_IN_GOMP_LOOP_STATIC_START); | |
11556 | next_ix += ((int)BUILT_IN_GOMP_LOOP_ULL_STATIC_NEXT | |
11557 | - (int)BUILT_IN_GOMP_LOOP_STATIC_NEXT); | |
a68ab351 | 11558 | } |
bbbbb16a | 11559 | expand_omp_for_generic (region, &fd, (enum built_in_function) start_ix, |
acf0174b | 11560 | (enum built_in_function) next_ix, inner_stmt); |
953ff289 | 11561 | } |
5f40b3cb | 11562 | |
a5efada7 RG |
11563 | if (gimple_in_ssa_p (cfun)) |
11564 | update_ssa (TODO_update_ssa_only_virtuals); | |
953ff289 DN |
11565 | } |
11566 | ||
953ff289 DN |
11567 | |
11568 | /* Expand code for an OpenMP sections directive. In pseudo code, we generate | |
11569 | ||
953ff289 DN |
11570 | v = GOMP_sections_start (n); |
11571 | L0: | |
11572 | switch (v) | |
11573 | { | |
11574 | case 0: | |
11575 | goto L2; | |
11576 | case 1: | |
11577 | section 1; | |
11578 | goto L1; | |
11579 | case 2: | |
11580 | ... | |
11581 | case n: | |
11582 | ... | |
953ff289 DN |
11583 | default: |
11584 | abort (); | |
11585 | } | |
11586 | L1: | |
11587 | v = GOMP_sections_next (); | |
11588 | goto L0; | |
11589 | L2: | |
11590 | reduction; | |
11591 | ||
50674e96 | 11592 | If this is a combined parallel sections, replace the call to |
917948d3 | 11593 | GOMP_sections_start with call to GOMP_sections_next. */ |
953ff289 DN |
11594 | |
11595 | static void | |
50674e96 | 11596 | expand_omp_sections (struct omp_region *region) |
953ff289 | 11597 | { |
0f900dfa | 11598 | tree t, u, vin = NULL, vmain, vnext, l2; |
726a989a | 11599 | unsigned len; |
e5c95afe | 11600 | basic_block entry_bb, l0_bb, l1_bb, l2_bb, default_bb; |
726a989a | 11601 | gimple_stmt_iterator si, switch_si; |
538dd0b7 | 11602 | gomp_sections *sections_stmt; |
355fe088 | 11603 | gimple *stmt; |
538dd0b7 | 11604 | gomp_continue *cont; |
c34938a8 JJ |
11605 | edge_iterator ei; |
11606 | edge e; | |
777f7f9a | 11607 | struct omp_region *inner; |
726a989a | 11608 | unsigned i, casei; |
e5c95afe | 11609 | bool exit_reachable = region->cont != NULL; |
953ff289 | 11610 | |
65e7bfe3 | 11611 | gcc_assert (region->exit != NULL); |
777f7f9a | 11612 | entry_bb = region->entry; |
e5c95afe | 11613 | l0_bb = single_succ (entry_bb); |
777f7f9a | 11614 | l1_bb = region->cont; |
e5c95afe | 11615 | l2_bb = region->exit; |
65e7bfe3 JJ |
11616 | if (single_pred_p (l2_bb) && single_pred (l2_bb) == l0_bb) |
11617 | l2 = gimple_block_label (l2_bb); | |
11618 | else | |
d3c673c7 | 11619 | { |
65e7bfe3 JJ |
11620 | /* This can happen if there are reductions. */ |
11621 | len = EDGE_COUNT (l0_bb->succs); | |
11622 | gcc_assert (len > 0); | |
11623 | e = EDGE_SUCC (l0_bb, len - 1); | |
11624 | si = gsi_last_bb (e->dest); | |
11625 | l2 = NULL_TREE; | |
11626 | if (gsi_end_p (si) | |
11627 | || gimple_code (gsi_stmt (si)) != GIMPLE_OMP_SECTION) | |
11628 | l2 = gimple_block_label (e->dest); | |
c34938a8 | 11629 | else |
65e7bfe3 JJ |
11630 | FOR_EACH_EDGE (e, ei, l0_bb->succs) |
11631 | { | |
11632 | si = gsi_last_bb (e->dest); | |
11633 | if (gsi_end_p (si) | |
11634 | || gimple_code (gsi_stmt (si)) != GIMPLE_OMP_SECTION) | |
c34938a8 | 11635 | { |
65e7bfe3 JJ |
11636 | l2 = gimple_block_label (e->dest); |
11637 | break; | |
c34938a8 | 11638 | } |
65e7bfe3 | 11639 | } |
d3c673c7 | 11640 | } |
65e7bfe3 JJ |
11641 | if (exit_reachable) |
11642 | default_bb = create_empty_bb (l1_bb->prev_bb); | |
d3c673c7 | 11643 | else |
65e7bfe3 | 11644 | default_bb = create_empty_bb (l0_bb); |
50674e96 DN |
11645 | |
11646 | /* We will build a switch() with enough cases for all the | |
726a989a | 11647 | GIMPLE_OMP_SECTION regions, a '0' case to handle the end of more work |
50674e96 | 11648 | and a default case to abort if something goes wrong. */ |
e5c95afe | 11649 | len = EDGE_COUNT (l0_bb->succs); |
726a989a | 11650 | |
9771b263 | 11651 | /* Use vec::quick_push on label_vec throughout, since we know the size |
726a989a | 11652 | in advance. */ |
ef062b13 | 11653 | auto_vec<tree> label_vec (len); |
953ff289 | 11654 | |
777f7f9a | 11655 | /* The call to GOMP_sections_start goes in ENTRY_BB, replacing the |
726a989a RB |
11656 | GIMPLE_OMP_SECTIONS statement. */ |
11657 | si = gsi_last_bb (entry_bb); | |
538dd0b7 | 11658 | sections_stmt = as_a <gomp_sections *> (gsi_stmt (si)); |
726a989a RB |
11659 | gcc_assert (gimple_code (sections_stmt) == GIMPLE_OMP_SECTIONS); |
11660 | vin = gimple_omp_sections_control (sections_stmt); | |
50674e96 | 11661 | if (!is_combined_parallel (region)) |
953ff289 | 11662 | { |
50674e96 DN |
11663 | /* If we are not inside a combined parallel+sections region, |
11664 | call GOMP_sections_start. */ | |
4befd127 | 11665 | t = build_int_cst (unsigned_type_node, len - 1); |
e79983f4 | 11666 | u = builtin_decl_explicit (BUILT_IN_GOMP_SECTIONS_START); |
726a989a | 11667 | stmt = gimple_build_call (u, 1, t); |
953ff289 | 11668 | } |
917948d3 ZD |
11669 | else |
11670 | { | |
11671 | /* Otherwise, call GOMP_sections_next. */ | |
e79983f4 | 11672 | u = builtin_decl_explicit (BUILT_IN_GOMP_SECTIONS_NEXT); |
726a989a | 11673 | stmt = gimple_build_call (u, 0); |
917948d3 | 11674 | } |
726a989a RB |
11675 | gimple_call_set_lhs (stmt, vin); |
11676 | gsi_insert_after (&si, stmt, GSI_SAME_STMT); | |
11677 | gsi_remove (&si, true); | |
11678 | ||
11679 | /* The switch() statement replacing GIMPLE_OMP_SECTIONS_SWITCH goes in | |
11680 | L0_BB. */ | |
11681 | switch_si = gsi_last_bb (l0_bb); | |
11682 | gcc_assert (gimple_code (gsi_stmt (switch_si)) == GIMPLE_OMP_SECTIONS_SWITCH); | |
917948d3 ZD |
11683 | if (exit_reachable) |
11684 | { | |
538dd0b7 | 11685 | cont = as_a <gomp_continue *> (last_stmt (l1_bb)); |
726a989a RB |
11686 | gcc_assert (gimple_code (cont) == GIMPLE_OMP_CONTINUE); |
11687 | vmain = gimple_omp_continue_control_use (cont); | |
11688 | vnext = gimple_omp_continue_control_def (cont); | |
917948d3 ZD |
11689 | } |
11690 | else | |
11691 | { | |
11692 | vmain = vin; | |
11693 | vnext = NULL_TREE; | |
11694 | } | |
953ff289 | 11695 | |
65e7bfe3 | 11696 | t = build_case_label (build_int_cst (unsigned_type_node, 0), NULL, l2); |
9771b263 | 11697 | label_vec.quick_push (t); |
65e7bfe3 | 11698 | i = 1; |
d3c673c7 | 11699 | |
726a989a | 11700 | /* Convert each GIMPLE_OMP_SECTION into a CASE_LABEL_EXPR. */ |
e5c95afe ZD |
11701 | for (inner = region->inner, casei = 1; |
11702 | inner; | |
11703 | inner = inner->next, i++, casei++) | |
953ff289 | 11704 | { |
50674e96 DN |
11705 | basic_block s_entry_bb, s_exit_bb; |
11706 | ||
c34938a8 | 11707 | /* Skip optional reduction region. */ |
726a989a | 11708 | if (inner->type == GIMPLE_OMP_ATOMIC_LOAD) |
c34938a8 JJ |
11709 | { |
11710 | --i; | |
11711 | --casei; | |
11712 | continue; | |
11713 | } | |
11714 | ||
777f7f9a RH |
11715 | s_entry_bb = inner->entry; |
11716 | s_exit_bb = inner->exit; | |
953ff289 | 11717 | |
726a989a | 11718 | t = gimple_block_label (s_entry_bb); |
e5c95afe | 11719 | u = build_int_cst (unsigned_type_node, casei); |
3d528853 | 11720 | u = build_case_label (u, NULL, t); |
9771b263 | 11721 | label_vec.quick_push (u); |
777f7f9a | 11722 | |
726a989a RB |
11723 | si = gsi_last_bb (s_entry_bb); |
11724 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_SECTION); | |
11725 | gcc_assert (i < len || gimple_omp_section_last_p (gsi_stmt (si))); | |
11726 | gsi_remove (&si, true); | |
777f7f9a | 11727 | single_succ_edge (s_entry_bb)->flags = EDGE_FALLTHRU; |
d3c673c7 JJ |
11728 | |
11729 | if (s_exit_bb == NULL) | |
11730 | continue; | |
11731 | ||
726a989a RB |
11732 | si = gsi_last_bb (s_exit_bb); |
11733 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_RETURN); | |
11734 | gsi_remove (&si, true); | |
d3c673c7 | 11735 | |
50674e96 | 11736 | single_succ_edge (s_exit_bb)->flags = EDGE_FALLTHRU; |
953ff289 DN |
11737 | } |
11738 | ||
50674e96 | 11739 | /* Error handling code goes in DEFAULT_BB. */ |
726a989a | 11740 | t = gimple_block_label (default_bb); |
3d528853 | 11741 | u = build_case_label (NULL, NULL, t); |
777f7f9a | 11742 | make_edge (l0_bb, default_bb, 0); |
726338f4 | 11743 | add_bb_to_loop (default_bb, current_loops->tree_root); |
953ff289 | 11744 | |
fd8d363e | 11745 | stmt = gimple_build_switch (vmain, u, label_vec); |
726a989a RB |
11746 | gsi_insert_after (&switch_si, stmt, GSI_SAME_STMT); |
11747 | gsi_remove (&switch_si, true); | |
726a989a RB |
11748 | |
11749 | si = gsi_start_bb (default_bb); | |
e79983f4 | 11750 | stmt = gimple_build_call (builtin_decl_explicit (BUILT_IN_TRAP), 0); |
726a989a | 11751 | gsi_insert_after (&si, stmt, GSI_CONTINUE_LINKING); |
50674e96 | 11752 | |
e5c95afe | 11753 | if (exit_reachable) |
d3c673c7 | 11754 | { |
e79983f4 MM |
11755 | tree bfn_decl; |
11756 | ||
e5c95afe | 11757 | /* Code to get the next section goes in L1_BB. */ |
726a989a RB |
11758 | si = gsi_last_bb (l1_bb); |
11759 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_CONTINUE); | |
953ff289 | 11760 | |
e79983f4 MM |
11761 | bfn_decl = builtin_decl_explicit (BUILT_IN_GOMP_SECTIONS_NEXT); |
11762 | stmt = gimple_build_call (bfn_decl, 0); | |
726a989a RB |
11763 | gimple_call_set_lhs (stmt, vnext); |
11764 | gsi_insert_after (&si, stmt, GSI_SAME_STMT); | |
11765 | gsi_remove (&si, true); | |
50674e96 | 11766 | |
e5c95afe | 11767 | single_succ_edge (l1_bb)->flags = EDGE_FALLTHRU; |
d3c673c7 | 11768 | } |
50674e96 | 11769 | |
65e7bfe3 JJ |
11770 | /* Cleanup function replaces GIMPLE_OMP_RETURN in EXIT_BB. */ |
11771 | si = gsi_last_bb (l2_bb); | |
11772 | if (gimple_omp_return_nowait_p (gsi_stmt (si))) | |
11773 | t = builtin_decl_explicit (BUILT_IN_GOMP_SECTIONS_END_NOWAIT); | |
acf0174b JJ |
11774 | else if (gimple_omp_return_lhs (gsi_stmt (si))) |
11775 | t = builtin_decl_explicit (BUILT_IN_GOMP_SECTIONS_END_CANCEL); | |
65e7bfe3 JJ |
11776 | else |
11777 | t = builtin_decl_explicit (BUILT_IN_GOMP_SECTIONS_END); | |
11778 | stmt = gimple_build_call (t, 0); | |
acf0174b JJ |
11779 | if (gimple_omp_return_lhs (gsi_stmt (si))) |
11780 | gimple_call_set_lhs (stmt, gimple_omp_return_lhs (gsi_stmt (si))); | |
65e7bfe3 JJ |
11781 | gsi_insert_after (&si, stmt, GSI_SAME_STMT); |
11782 | gsi_remove (&si, true); | |
11783 | ||
917948d3 | 11784 | set_immediate_dominator (CDI_DOMINATORS, default_bb, l0_bb); |
50674e96 | 11785 | } |
953ff289 | 11786 | |
953ff289 | 11787 | |
777f7f9a RH |
11788 | /* Expand code for an OpenMP single directive. We've already expanded |
11789 | much of the code, here we simply place the GOMP_barrier call. */ | |
11790 | ||
11791 | static void | |
11792 | expand_omp_single (struct omp_region *region) | |
11793 | { | |
11794 | basic_block entry_bb, exit_bb; | |
726a989a | 11795 | gimple_stmt_iterator si; |
777f7f9a RH |
11796 | |
11797 | entry_bb = region->entry; | |
11798 | exit_bb = region->exit; | |
11799 | ||
726a989a | 11800 | si = gsi_last_bb (entry_bb); |
726a989a RB |
11801 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_SINGLE); |
11802 | gsi_remove (&si, true); | |
777f7f9a RH |
11803 | single_succ_edge (entry_bb)->flags = EDGE_FALLTHRU; |
11804 | ||
726a989a | 11805 | si = gsi_last_bb (exit_bb); |
acf0174b JJ |
11806 | if (!gimple_omp_return_nowait_p (gsi_stmt (si))) |
11807 | { | |
11808 | tree t = gimple_omp_return_lhs (gsi_stmt (si)); | |
11809 | gsi_insert_after (&si, build_omp_barrier (t), GSI_SAME_STMT); | |
11810 | } | |
726a989a | 11811 | gsi_remove (&si, true); |
777f7f9a RH |
11812 | single_succ_edge (exit_bb)->flags = EDGE_FALLTHRU; |
11813 | } | |
11814 | ||
11815 | ||
11816 | /* Generic expansion for OpenMP synchronization directives: master, | |
11817 | ordered and critical. All we need to do here is remove the entry | |
11818 | and exit markers for REGION. */ | |
50674e96 DN |
11819 | |
11820 | static void | |
11821 | expand_omp_synch (struct omp_region *region) | |
11822 | { | |
11823 | basic_block entry_bb, exit_bb; | |
726a989a | 11824 | gimple_stmt_iterator si; |
50674e96 | 11825 | |
777f7f9a RH |
11826 | entry_bb = region->entry; |
11827 | exit_bb = region->exit; | |
50674e96 | 11828 | |
726a989a RB |
11829 | si = gsi_last_bb (entry_bb); |
11830 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_SINGLE | |
11831 | || gimple_code (gsi_stmt (si)) == GIMPLE_OMP_MASTER | |
acf0174b | 11832 | || gimple_code (gsi_stmt (si)) == GIMPLE_OMP_TASKGROUP |
726a989a | 11833 | || gimple_code (gsi_stmt (si)) == GIMPLE_OMP_ORDERED |
acf0174b JJ |
11834 | || gimple_code (gsi_stmt (si)) == GIMPLE_OMP_CRITICAL |
11835 | || gimple_code (gsi_stmt (si)) == GIMPLE_OMP_TEAMS); | |
726a989a | 11836 | gsi_remove (&si, true); |
50674e96 DN |
11837 | single_succ_edge (entry_bb)->flags = EDGE_FALLTHRU; |
11838 | ||
d3c673c7 JJ |
11839 | if (exit_bb) |
11840 | { | |
726a989a RB |
11841 | si = gsi_last_bb (exit_bb); |
11842 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_RETURN); | |
11843 | gsi_remove (&si, true); | |
d3c673c7 JJ |
11844 | single_succ_edge (exit_bb)->flags = EDGE_FALLTHRU; |
11845 | } | |
50674e96 | 11846 | } |
953ff289 | 11847 | |
20906c66 JJ |
11848 | /* A subroutine of expand_omp_atomic. Attempt to implement the atomic |
11849 | operation as a normal volatile load. */ | |
11850 | ||
11851 | static bool | |
05409788 RH |
11852 | expand_omp_atomic_load (basic_block load_bb, tree addr, |
11853 | tree loaded_val, int index) | |
20906c66 | 11854 | { |
05409788 RH |
11855 | enum built_in_function tmpbase; |
11856 | gimple_stmt_iterator gsi; | |
11857 | basic_block store_bb; | |
11858 | location_t loc; | |
355fe088 | 11859 | gimple *stmt; |
05409788 RH |
11860 | tree decl, call, type, itype; |
11861 | ||
11862 | gsi = gsi_last_bb (load_bb); | |
11863 | stmt = gsi_stmt (gsi); | |
11864 | gcc_assert (gimple_code (stmt) == GIMPLE_OMP_ATOMIC_LOAD); | |
11865 | loc = gimple_location (stmt); | |
11866 | ||
11867 | /* ??? If the target does not implement atomic_load_optab[mode], and mode | |
11868 | is smaller than word size, then expand_atomic_load assumes that the load | |
11869 | is atomic. We could avoid the builtin entirely in this case. */ | |
11870 | ||
11871 | tmpbase = (enum built_in_function) (BUILT_IN_ATOMIC_LOAD_N + index + 1); | |
11872 | decl = builtin_decl_explicit (tmpbase); | |
11873 | if (decl == NULL_TREE) | |
11874 | return false; | |
11875 | ||
11876 | type = TREE_TYPE (loaded_val); | |
11877 | itype = TREE_TYPE (TREE_TYPE (decl)); | |
11878 | ||
11879 | call = build_call_expr_loc (loc, decl, 2, addr, | |
acf0174b JJ |
11880 | build_int_cst (NULL, |
11881 | gimple_omp_atomic_seq_cst_p (stmt) | |
11882 | ? MEMMODEL_SEQ_CST | |
11883 | : MEMMODEL_RELAXED)); | |
05409788 RH |
11884 | if (!useless_type_conversion_p (type, itype)) |
11885 | call = fold_build1_loc (loc, VIEW_CONVERT_EXPR, type, call); | |
11886 | call = build2_loc (loc, MODIFY_EXPR, void_type_node, loaded_val, call); | |
11887 | ||
11888 | force_gimple_operand_gsi (&gsi, call, true, NULL_TREE, true, GSI_SAME_STMT); | |
11889 | gsi_remove (&gsi, true); | |
11890 | ||
11891 | store_bb = single_succ (load_bb); | |
11892 | gsi = gsi_last_bb (store_bb); | |
11893 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_ATOMIC_STORE); | |
11894 | gsi_remove (&gsi, true); | |
11895 | ||
11896 | if (gimple_in_ssa_p (cfun)) | |
11897 | update_ssa (TODO_update_ssa_no_phi); | |
11898 | ||
11899 | return true; | |
20906c66 JJ |
11900 | } |
11901 | ||
11902 | /* A subroutine of expand_omp_atomic. Attempt to implement the atomic | |
11903 | operation as a normal volatile store. */ | |
11904 | ||
11905 | static bool | |
05409788 RH |
11906 | expand_omp_atomic_store (basic_block load_bb, tree addr, |
11907 | tree loaded_val, tree stored_val, int index) | |
20906c66 | 11908 | { |
05409788 RH |
11909 | enum built_in_function tmpbase; |
11910 | gimple_stmt_iterator gsi; | |
11911 | basic_block store_bb = single_succ (load_bb); | |
11912 | location_t loc; | |
355fe088 | 11913 | gimple *stmt; |
05409788 | 11914 | tree decl, call, type, itype; |
ef4bddc2 | 11915 | machine_mode imode; |
05409788 RH |
11916 | bool exchange; |
11917 | ||
11918 | gsi = gsi_last_bb (load_bb); | |
11919 | stmt = gsi_stmt (gsi); | |
11920 | gcc_assert (gimple_code (stmt) == GIMPLE_OMP_ATOMIC_LOAD); | |
11921 | ||
11922 | /* If the load value is needed, then this isn't a store but an exchange. */ | |
11923 | exchange = gimple_omp_atomic_need_value_p (stmt); | |
11924 | ||
11925 | gsi = gsi_last_bb (store_bb); | |
11926 | stmt = gsi_stmt (gsi); | |
11927 | gcc_assert (gimple_code (stmt) == GIMPLE_OMP_ATOMIC_STORE); | |
11928 | loc = gimple_location (stmt); | |
11929 | ||
11930 | /* ??? If the target does not implement atomic_store_optab[mode], and mode | |
11931 | is smaller than word size, then expand_atomic_store assumes that the store | |
11932 | is atomic. We could avoid the builtin entirely in this case. */ | |
11933 | ||
11934 | tmpbase = (exchange ? BUILT_IN_ATOMIC_EXCHANGE_N : BUILT_IN_ATOMIC_STORE_N); | |
11935 | tmpbase = (enum built_in_function) ((int) tmpbase + index + 1); | |
11936 | decl = builtin_decl_explicit (tmpbase); | |
11937 | if (decl == NULL_TREE) | |
11938 | return false; | |
11939 | ||
11940 | type = TREE_TYPE (stored_val); | |
11941 | ||
11942 | /* Dig out the type of the function's second argument. */ | |
11943 | itype = TREE_TYPE (decl); | |
11944 | itype = TYPE_ARG_TYPES (itype); | |
11945 | itype = TREE_CHAIN (itype); | |
11946 | itype = TREE_VALUE (itype); | |
11947 | imode = TYPE_MODE (itype); | |
11948 | ||
11949 | if (exchange && !can_atomic_exchange_p (imode, true)) | |
11950 | return false; | |
11951 | ||
11952 | if (!useless_type_conversion_p (itype, type)) | |
11953 | stored_val = fold_build1_loc (loc, VIEW_CONVERT_EXPR, itype, stored_val); | |
11954 | call = build_call_expr_loc (loc, decl, 3, addr, stored_val, | |
acf0174b JJ |
11955 | build_int_cst (NULL, |
11956 | gimple_omp_atomic_seq_cst_p (stmt) | |
11957 | ? MEMMODEL_SEQ_CST | |
11958 | : MEMMODEL_RELAXED)); | |
05409788 RH |
11959 | if (exchange) |
11960 | { | |
11961 | if (!useless_type_conversion_p (type, itype)) | |
11962 | call = build1_loc (loc, VIEW_CONVERT_EXPR, type, call); | |
11963 | call = build2_loc (loc, MODIFY_EXPR, void_type_node, loaded_val, call); | |
11964 | } | |
11965 | ||
11966 | force_gimple_operand_gsi (&gsi, call, true, NULL_TREE, true, GSI_SAME_STMT); | |
11967 | gsi_remove (&gsi, true); | |
11968 | ||
11969 | /* Remove the GIMPLE_OMP_ATOMIC_LOAD that we verified above. */ | |
11970 | gsi = gsi_last_bb (load_bb); | |
11971 | gsi_remove (&gsi, true); | |
11972 | ||
11973 | if (gimple_in_ssa_p (cfun)) | |
11974 | update_ssa (TODO_update_ssa_no_phi); | |
11975 | ||
11976 | return true; | |
20906c66 JJ |
11977 | } |
11978 | ||
a509ebb5 | 11979 | /* A subroutine of expand_omp_atomic. Attempt to implement the atomic |
86951993 | 11980 | operation as a __atomic_fetch_op builtin. INDEX is log2 of the |
a509ebb5 RL |
11981 | size of the data type, and thus usable to find the index of the builtin |
11982 | decl. Returns false if the expression is not of the proper form. */ | |
11983 | ||
11984 | static bool | |
11985 | expand_omp_atomic_fetch_op (basic_block load_bb, | |
11986 | tree addr, tree loaded_val, | |
11987 | tree stored_val, int index) | |
11988 | { | |
e79983f4 | 11989 | enum built_in_function oldbase, newbase, tmpbase; |
a509ebb5 | 11990 | tree decl, itype, call; |
20906c66 | 11991 | tree lhs, rhs; |
a509ebb5 | 11992 | basic_block store_bb = single_succ (load_bb); |
726a989a | 11993 | gimple_stmt_iterator gsi; |
355fe088 | 11994 | gimple *stmt; |
db3927fb | 11995 | location_t loc; |
86951993 | 11996 | enum tree_code code; |
20906c66 | 11997 | bool need_old, need_new; |
ef4bddc2 | 11998 | machine_mode imode; |
acf0174b | 11999 | bool seq_cst; |
a509ebb5 RL |
12000 | |
12001 | /* We expect to find the following sequences: | |
b8698a0f | 12002 | |
a509ebb5 | 12003 | load_bb: |
726a989a | 12004 | GIMPLE_OMP_ATOMIC_LOAD (tmp, mem) |
a509ebb5 RL |
12005 | |
12006 | store_bb: | |
12007 | val = tmp OP something; (or: something OP tmp) | |
b8698a0f | 12008 | GIMPLE_OMP_STORE (val) |
a509ebb5 | 12009 | |
b8698a0f | 12010 | ???FIXME: Allow a more flexible sequence. |
a509ebb5 | 12011 | Perhaps use data flow to pick the statements. |
b8698a0f | 12012 | |
a509ebb5 RL |
12013 | */ |
12014 | ||
726a989a RB |
12015 | gsi = gsi_after_labels (store_bb); |
12016 | stmt = gsi_stmt (gsi); | |
db3927fb | 12017 | loc = gimple_location (stmt); |
726a989a | 12018 | if (!is_gimple_assign (stmt)) |
a509ebb5 | 12019 | return false; |
726a989a RB |
12020 | gsi_next (&gsi); |
12021 | if (gimple_code (gsi_stmt (gsi)) != GIMPLE_OMP_ATOMIC_STORE) | |
a509ebb5 | 12022 | return false; |
20906c66 JJ |
12023 | need_new = gimple_omp_atomic_need_value_p (gsi_stmt (gsi)); |
12024 | need_old = gimple_omp_atomic_need_value_p (last_stmt (load_bb)); | |
acf0174b | 12025 | seq_cst = gimple_omp_atomic_seq_cst_p (last_stmt (load_bb)); |
20906c66 | 12026 | gcc_checking_assert (!need_old || !need_new); |
a509ebb5 | 12027 | |
726a989a | 12028 | if (!operand_equal_p (gimple_assign_lhs (stmt), stored_val, 0)) |
a509ebb5 RL |
12029 | return false; |
12030 | ||
a509ebb5 | 12031 | /* Check for one of the supported fetch-op operations. */ |
86951993 AM |
12032 | code = gimple_assign_rhs_code (stmt); |
12033 | switch (code) | |
a509ebb5 RL |
12034 | { |
12035 | case PLUS_EXPR: | |
12036 | case POINTER_PLUS_EXPR: | |
86951993 AM |
12037 | oldbase = BUILT_IN_ATOMIC_FETCH_ADD_N; |
12038 | newbase = BUILT_IN_ATOMIC_ADD_FETCH_N; | |
a509ebb5 RL |
12039 | break; |
12040 | case MINUS_EXPR: | |
86951993 AM |
12041 | oldbase = BUILT_IN_ATOMIC_FETCH_SUB_N; |
12042 | newbase = BUILT_IN_ATOMIC_SUB_FETCH_N; | |
a509ebb5 RL |
12043 | break; |
12044 | case BIT_AND_EXPR: | |
86951993 AM |
12045 | oldbase = BUILT_IN_ATOMIC_FETCH_AND_N; |
12046 | newbase = BUILT_IN_ATOMIC_AND_FETCH_N; | |
a509ebb5 RL |
12047 | break; |
12048 | case BIT_IOR_EXPR: | |
86951993 AM |
12049 | oldbase = BUILT_IN_ATOMIC_FETCH_OR_N; |
12050 | newbase = BUILT_IN_ATOMIC_OR_FETCH_N; | |
a509ebb5 RL |
12051 | break; |
12052 | case BIT_XOR_EXPR: | |
86951993 AM |
12053 | oldbase = BUILT_IN_ATOMIC_FETCH_XOR_N; |
12054 | newbase = BUILT_IN_ATOMIC_XOR_FETCH_N; | |
a509ebb5 RL |
12055 | break; |
12056 | default: | |
12057 | return false; | |
12058 | } | |
86951993 | 12059 | |
a509ebb5 | 12060 | /* Make sure the expression is of the proper form. */ |
726a989a RB |
12061 | if (operand_equal_p (gimple_assign_rhs1 (stmt), loaded_val, 0)) |
12062 | rhs = gimple_assign_rhs2 (stmt); | |
12063 | else if (commutative_tree_code (gimple_assign_rhs_code (stmt)) | |
12064 | && operand_equal_p (gimple_assign_rhs2 (stmt), loaded_val, 0)) | |
12065 | rhs = gimple_assign_rhs1 (stmt); | |
a509ebb5 RL |
12066 | else |
12067 | return false; | |
12068 | ||
e79983f4 MM |
12069 | tmpbase = ((enum built_in_function) |
12070 | ((need_new ? newbase : oldbase) + index + 1)); | |
12071 | decl = builtin_decl_explicit (tmpbase); | |
20790697 JJ |
12072 | if (decl == NULL_TREE) |
12073 | return false; | |
a509ebb5 | 12074 | itype = TREE_TYPE (TREE_TYPE (decl)); |
86951993 | 12075 | imode = TYPE_MODE (itype); |
a509ebb5 | 12076 | |
86951993 AM |
12077 | /* We could test all of the various optabs involved, but the fact of the |
12078 | matter is that (with the exception of i486 vs i586 and xadd) all targets | |
12079 | that support any atomic operaton optab also implements compare-and-swap. | |
12080 | Let optabs.c take care of expanding any compare-and-swap loop. */ | |
cedb4a1a | 12081 | if (!can_compare_and_swap_p (imode, true)) |
a509ebb5 RL |
12082 | return false; |
12083 | ||
726a989a RB |
12084 | gsi = gsi_last_bb (load_bb); |
12085 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_ATOMIC_LOAD); | |
86951993 AM |
12086 | |
12087 | /* OpenMP does not imply any barrier-like semantics on its atomic ops. | |
12088 | It only requires that the operation happen atomically. Thus we can | |
12089 | use the RELAXED memory model. */ | |
12090 | call = build_call_expr_loc (loc, decl, 3, addr, | |
12091 | fold_convert_loc (loc, itype, rhs), | |
acf0174b JJ |
12092 | build_int_cst (NULL, |
12093 | seq_cst ? MEMMODEL_SEQ_CST | |
12094 | : MEMMODEL_RELAXED)); | |
86951993 | 12095 | |
20906c66 JJ |
12096 | if (need_old || need_new) |
12097 | { | |
12098 | lhs = need_old ? loaded_val : stored_val; | |
12099 | call = fold_convert_loc (loc, TREE_TYPE (lhs), call); | |
12100 | call = build2_loc (loc, MODIFY_EXPR, void_type_node, lhs, call); | |
12101 | } | |
12102 | else | |
12103 | call = fold_convert_loc (loc, void_type_node, call); | |
726a989a RB |
12104 | force_gimple_operand_gsi (&gsi, call, true, NULL_TREE, true, GSI_SAME_STMT); |
12105 | gsi_remove (&gsi, true); | |
a509ebb5 | 12106 | |
726a989a RB |
12107 | gsi = gsi_last_bb (store_bb); |
12108 | gcc_assert (gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_ATOMIC_STORE); | |
12109 | gsi_remove (&gsi, true); | |
12110 | gsi = gsi_last_bb (store_bb); | |
0b0521ba | 12111 | stmt = gsi_stmt (gsi); |
726a989a | 12112 | gsi_remove (&gsi, true); |
a509ebb5 RL |
12113 | |
12114 | if (gimple_in_ssa_p (cfun)) | |
0b0521ba TV |
12115 | { |
12116 | release_defs (stmt); | |
12117 | update_ssa (TODO_update_ssa_no_phi); | |
12118 | } | |
a509ebb5 RL |
12119 | |
12120 | return true; | |
12121 | } | |
12122 | ||
12123 | /* A subroutine of expand_omp_atomic. Implement the atomic operation as: | |
12124 | ||
12125 | oldval = *addr; | |
12126 | repeat: | |
12127 | newval = rhs; // with oldval replacing *addr in rhs | |
12128 | oldval = __sync_val_compare_and_swap (addr, oldval, newval); | |
12129 | if (oldval != newval) | |
12130 | goto repeat; | |
12131 | ||
12132 | INDEX is log2 of the size of the data type, and thus usable to find the | |
12133 | index of the builtin decl. */ | |
12134 | ||
12135 | static bool | |
12136 | expand_omp_atomic_pipeline (basic_block load_bb, basic_block store_bb, | |
12137 | tree addr, tree loaded_val, tree stored_val, | |
12138 | int index) | |
12139 | { | |
c18c98c0 | 12140 | tree loadedi, storedi, initial, new_storedi, old_vali; |
a509ebb5 | 12141 | tree type, itype, cmpxchg, iaddr; |
726a989a | 12142 | gimple_stmt_iterator si; |
a509ebb5 | 12143 | basic_block loop_header = single_succ (load_bb); |
355fe088 | 12144 | gimple *phi, *stmt; |
a509ebb5 | 12145 | edge e; |
e79983f4 | 12146 | enum built_in_function fncode; |
a509ebb5 | 12147 | |
86951993 AM |
12148 | /* ??? We need a non-pointer interface to __atomic_compare_exchange in |
12149 | order to use the RELAXED memory model effectively. */ | |
e79983f4 MM |
12150 | fncode = (enum built_in_function)((int)BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N |
12151 | + index + 1); | |
12152 | cmpxchg = builtin_decl_explicit (fncode); | |
20790697 JJ |
12153 | if (cmpxchg == NULL_TREE) |
12154 | return false; | |
a509ebb5 RL |
12155 | type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr))); |
12156 | itype = TREE_TYPE (TREE_TYPE (cmpxchg)); | |
12157 | ||
cedb4a1a | 12158 | if (!can_compare_and_swap_p (TYPE_MODE (itype), true)) |
a509ebb5 RL |
12159 | return false; |
12160 | ||
726a989a RB |
12161 | /* Load the initial value, replacing the GIMPLE_OMP_ATOMIC_LOAD. */ |
12162 | si = gsi_last_bb (load_bb); | |
12163 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_ATOMIC_LOAD); | |
12164 | ||
c18c98c0 JJ |
12165 | /* For floating-point values, we'll need to view-convert them to integers |
12166 | so that we can perform the atomic compare and swap. Simplify the | |
12167 | following code by always setting up the "i"ntegral variables. */ | |
12168 | if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type)) | |
12169 | { | |
726a989a RB |
12170 | tree iaddr_val; |
12171 | ||
7cc434a3 | 12172 | iaddr = create_tmp_reg (build_pointer_type_for_mode (itype, ptr_mode, |
b731b390 | 12173 | true)); |
726a989a RB |
12174 | iaddr_val |
12175 | = force_gimple_operand_gsi (&si, | |
12176 | fold_convert (TREE_TYPE (iaddr), addr), | |
12177 | false, NULL_TREE, true, GSI_SAME_STMT); | |
12178 | stmt = gimple_build_assign (iaddr, iaddr_val); | |
12179 | gsi_insert_before (&si, stmt, GSI_SAME_STMT); | |
b731b390 | 12180 | loadedi = create_tmp_var (itype); |
c18c98c0 | 12181 | if (gimple_in_ssa_p (cfun)) |
b731b390 | 12182 | loadedi = make_ssa_name (loadedi); |
c18c98c0 JJ |
12183 | } |
12184 | else | |
12185 | { | |
12186 | iaddr = addr; | |
12187 | loadedi = loaded_val; | |
12188 | } | |
726a989a | 12189 | |
8175be9a JJ |
12190 | fncode = (enum built_in_function) (BUILT_IN_ATOMIC_LOAD_N + index + 1); |
12191 | tree loaddecl = builtin_decl_explicit (fncode); | |
12192 | if (loaddecl) | |
12193 | initial | |
12194 | = fold_convert (TREE_TYPE (TREE_TYPE (iaddr)), | |
12195 | build_call_expr (loaddecl, 2, iaddr, | |
12196 | build_int_cst (NULL_TREE, | |
12197 | MEMMODEL_RELAXED))); | |
12198 | else | |
12199 | initial = build2 (MEM_REF, TREE_TYPE (TREE_TYPE (iaddr)), iaddr, | |
12200 | build_int_cst (TREE_TYPE (iaddr), 0)); | |
12201 | ||
70f34814 | 12202 | initial |
8175be9a JJ |
12203 | = force_gimple_operand_gsi (&si, initial, true, NULL_TREE, true, |
12204 | GSI_SAME_STMT); | |
c18c98c0 JJ |
12205 | |
12206 | /* Move the value to the LOADEDI temporary. */ | |
a509ebb5 RL |
12207 | if (gimple_in_ssa_p (cfun)) |
12208 | { | |
726a989a | 12209 | gcc_assert (gimple_seq_empty_p (phi_nodes (loop_header))); |
c18c98c0 | 12210 | phi = create_phi_node (loadedi, loop_header); |
a509ebb5 RL |
12211 | SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, single_succ_edge (load_bb)), |
12212 | initial); | |
12213 | } | |
12214 | else | |
726a989a RB |
12215 | gsi_insert_before (&si, |
12216 | gimple_build_assign (loadedi, initial), | |
12217 | GSI_SAME_STMT); | |
c18c98c0 JJ |
12218 | if (loadedi != loaded_val) |
12219 | { | |
726a989a RB |
12220 | gimple_stmt_iterator gsi2; |
12221 | tree x; | |
c18c98c0 JJ |
12222 | |
12223 | x = build1 (VIEW_CONVERT_EXPR, type, loadedi); | |
726a989a | 12224 | gsi2 = gsi_start_bb (loop_header); |
c18c98c0 JJ |
12225 | if (gimple_in_ssa_p (cfun)) |
12226 | { | |
538dd0b7 | 12227 | gassign *stmt; |
726a989a RB |
12228 | x = force_gimple_operand_gsi (&gsi2, x, true, NULL_TREE, |
12229 | true, GSI_SAME_STMT); | |
12230 | stmt = gimple_build_assign (loaded_val, x); | |
12231 | gsi_insert_before (&gsi2, stmt, GSI_SAME_STMT); | |
c18c98c0 JJ |
12232 | } |
12233 | else | |
12234 | { | |
726a989a RB |
12235 | x = build2 (MODIFY_EXPR, TREE_TYPE (loaded_val), loaded_val, x); |
12236 | force_gimple_operand_gsi (&gsi2, x, true, NULL_TREE, | |
12237 | true, GSI_SAME_STMT); | |
c18c98c0 JJ |
12238 | } |
12239 | } | |
726a989a | 12240 | gsi_remove (&si, true); |
a509ebb5 | 12241 | |
726a989a RB |
12242 | si = gsi_last_bb (store_bb); |
12243 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_ATOMIC_STORE); | |
a509ebb5 | 12244 | |
c18c98c0 JJ |
12245 | if (iaddr == addr) |
12246 | storedi = stored_val; | |
a509ebb5 | 12247 | else |
c18c98c0 | 12248 | storedi = |
726a989a | 12249 | force_gimple_operand_gsi (&si, |
c18c98c0 JJ |
12250 | build1 (VIEW_CONVERT_EXPR, itype, |
12251 | stored_val), true, NULL_TREE, true, | |
726a989a | 12252 | GSI_SAME_STMT); |
a509ebb5 RL |
12253 | |
12254 | /* Build the compare&swap statement. */ | |
12255 | new_storedi = build_call_expr (cmpxchg, 3, iaddr, loadedi, storedi); | |
726a989a | 12256 | new_storedi = force_gimple_operand_gsi (&si, |
587aa063 RG |
12257 | fold_convert (TREE_TYPE (loadedi), |
12258 | new_storedi), | |
a509ebb5 | 12259 | true, NULL_TREE, |
726a989a | 12260 | true, GSI_SAME_STMT); |
a509ebb5 RL |
12261 | |
12262 | if (gimple_in_ssa_p (cfun)) | |
12263 | old_vali = loadedi; | |
12264 | else | |
12265 | { | |
b731b390 | 12266 | old_vali = create_tmp_var (TREE_TYPE (loadedi)); |
726a989a RB |
12267 | stmt = gimple_build_assign (old_vali, loadedi); |
12268 | gsi_insert_before (&si, stmt, GSI_SAME_STMT); | |
a509ebb5 | 12269 | |
726a989a RB |
12270 | stmt = gimple_build_assign (loadedi, new_storedi); |
12271 | gsi_insert_before (&si, stmt, GSI_SAME_STMT); | |
a509ebb5 RL |
12272 | } |
12273 | ||
12274 | /* Note that we always perform the comparison as an integer, even for | |
b8698a0f | 12275 | floating point. This allows the atomic operation to properly |
a509ebb5 | 12276 | succeed even with NaNs and -0.0. */ |
726a989a RB |
12277 | stmt = gimple_build_cond_empty |
12278 | (build2 (NE_EXPR, boolean_type_node, | |
12279 | new_storedi, old_vali)); | |
12280 | gsi_insert_before (&si, stmt, GSI_SAME_STMT); | |
a509ebb5 RL |
12281 | |
12282 | /* Update cfg. */ | |
12283 | e = single_succ_edge (store_bb); | |
12284 | e->flags &= ~EDGE_FALLTHRU; | |
12285 | e->flags |= EDGE_FALSE_VALUE; | |
12286 | ||
12287 | e = make_edge (store_bb, loop_header, EDGE_TRUE_VALUE); | |
12288 | ||
c18c98c0 | 12289 | /* Copy the new value to loadedi (we already did that before the condition |
a509ebb5 RL |
12290 | if we are not in SSA). */ |
12291 | if (gimple_in_ssa_p (cfun)) | |
12292 | { | |
726a989a | 12293 | phi = gimple_seq_first_stmt (phi_nodes (loop_header)); |
c18c98c0 | 12294 | SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e), new_storedi); |
a509ebb5 RL |
12295 | } |
12296 | ||
726a989a RB |
12297 | /* Remove GIMPLE_OMP_ATOMIC_STORE. */ |
12298 | gsi_remove (&si, true); | |
a509ebb5 | 12299 | |
6093bc06 RB |
12300 | struct loop *loop = alloc_loop (); |
12301 | loop->header = loop_header; | |
a1756c0a | 12302 | loop->latch = store_bb; |
6093bc06 RB |
12303 | add_loop (loop, loop_header->loop_father); |
12304 | ||
a509ebb5 RL |
12305 | if (gimple_in_ssa_p (cfun)) |
12306 | update_ssa (TODO_update_ssa_no_phi); | |
12307 | ||
12308 | return true; | |
12309 | } | |
12310 | ||
12311 | /* A subroutine of expand_omp_atomic. Implement the atomic operation as: | |
12312 | ||
12313 | GOMP_atomic_start (); | |
12314 | *addr = rhs; | |
12315 | GOMP_atomic_end (); | |
12316 | ||
12317 | The result is not globally atomic, but works so long as all parallel | |
12318 | references are within #pragma omp atomic directives. According to | |
12319 | responses received from omp@openmp.org, appears to be within spec. | |
12320 | Which makes sense, since that's how several other compilers handle | |
b8698a0f | 12321 | this situation as well. |
726a989a RB |
12322 | LOADED_VAL and ADDR are the operands of GIMPLE_OMP_ATOMIC_LOAD we're |
12323 | expanding. STORED_VAL is the operand of the matching | |
12324 | GIMPLE_OMP_ATOMIC_STORE. | |
a509ebb5 | 12325 | |
b8698a0f L |
12326 | We replace |
12327 | GIMPLE_OMP_ATOMIC_LOAD (loaded_val, addr) with | |
a509ebb5 RL |
12328 | loaded_val = *addr; |
12329 | ||
12330 | and replace | |
05409788 | 12331 | GIMPLE_OMP_ATOMIC_STORE (stored_val) with |
b8698a0f | 12332 | *addr = stored_val; |
a509ebb5 RL |
12333 | */ |
12334 | ||
12335 | static bool | |
12336 | expand_omp_atomic_mutex (basic_block load_bb, basic_block store_bb, | |
12337 | tree addr, tree loaded_val, tree stored_val) | |
12338 | { | |
726a989a | 12339 | gimple_stmt_iterator si; |
538dd0b7 | 12340 | gassign *stmt; |
a509ebb5 RL |
12341 | tree t; |
12342 | ||
726a989a RB |
12343 | si = gsi_last_bb (load_bb); |
12344 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_ATOMIC_LOAD); | |
a509ebb5 | 12345 | |
e79983f4 | 12346 | t = builtin_decl_explicit (BUILT_IN_GOMP_ATOMIC_START); |
3bb06db4 | 12347 | t = build_call_expr (t, 0); |
726a989a | 12348 | force_gimple_operand_gsi (&si, t, true, NULL_TREE, true, GSI_SAME_STMT); |
a509ebb5 | 12349 | |
70f34814 | 12350 | stmt = gimple_build_assign (loaded_val, build_simple_mem_ref (addr)); |
726a989a RB |
12351 | gsi_insert_before (&si, stmt, GSI_SAME_STMT); |
12352 | gsi_remove (&si, true); | |
a509ebb5 | 12353 | |
726a989a RB |
12354 | si = gsi_last_bb (store_bb); |
12355 | gcc_assert (gimple_code (gsi_stmt (si)) == GIMPLE_OMP_ATOMIC_STORE); | |
a509ebb5 | 12356 | |
70f34814 RG |
12357 | stmt = gimple_build_assign (build_simple_mem_ref (unshare_expr (addr)), |
12358 | stored_val); | |
726a989a | 12359 | gsi_insert_before (&si, stmt, GSI_SAME_STMT); |
a509ebb5 | 12360 | |
e79983f4 | 12361 | t = builtin_decl_explicit (BUILT_IN_GOMP_ATOMIC_END); |
3bb06db4 | 12362 | t = build_call_expr (t, 0); |
726a989a RB |
12363 | force_gimple_operand_gsi (&si, t, true, NULL_TREE, true, GSI_SAME_STMT); |
12364 | gsi_remove (&si, true); | |
a509ebb5 RL |
12365 | |
12366 | if (gimple_in_ssa_p (cfun)) | |
12367 | update_ssa (TODO_update_ssa_no_phi); | |
12368 | return true; | |
12369 | } | |
12370 | ||
b8698a0f L |
12371 | /* Expand an GIMPLE_OMP_ATOMIC statement. We try to expand |
12372 | using expand_omp_atomic_fetch_op. If it failed, we try to | |
a509ebb5 RL |
12373 | call expand_omp_atomic_pipeline, and if it fails too, the |
12374 | ultimate fallback is wrapping the operation in a mutex | |
b8698a0f L |
12375 | (expand_omp_atomic_mutex). REGION is the atomic region built |
12376 | by build_omp_regions_1(). */ | |
a509ebb5 RL |
12377 | |
12378 | static void | |
12379 | expand_omp_atomic (struct omp_region *region) | |
12380 | { | |
12381 | basic_block load_bb = region->entry, store_bb = region->exit; | |
538dd0b7 DM |
12382 | gomp_atomic_load *load = as_a <gomp_atomic_load *> (last_stmt (load_bb)); |
12383 | gomp_atomic_store *store = as_a <gomp_atomic_store *> (last_stmt (store_bb)); | |
726a989a RB |
12384 | tree loaded_val = gimple_omp_atomic_load_lhs (load); |
12385 | tree addr = gimple_omp_atomic_load_rhs (load); | |
12386 | tree stored_val = gimple_omp_atomic_store_val (store); | |
a509ebb5 RL |
12387 | tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr))); |
12388 | HOST_WIDE_INT index; | |
12389 | ||
12390 | /* Make sure the type is one of the supported sizes. */ | |
ae7e9ddd | 12391 | index = tree_to_uhwi (TYPE_SIZE_UNIT (type)); |
a509ebb5 RL |
12392 | index = exact_log2 (index); |
12393 | if (index >= 0 && index <= 4) | |
12394 | { | |
12395 | unsigned int align = TYPE_ALIGN_UNIT (type); | |
12396 | ||
12397 | /* __sync builtins require strict data alignment. */ | |
4999c62c | 12398 | if (exact_log2 (align) >= index) |
a509ebb5 | 12399 | { |
05409788 | 12400 | /* Atomic load. */ |
20906c66 JJ |
12401 | if (loaded_val == stored_val |
12402 | && (GET_MODE_CLASS (TYPE_MODE (type)) == MODE_INT | |
12403 | || GET_MODE_CLASS (TYPE_MODE (type)) == MODE_FLOAT) | |
12404 | && GET_MODE_BITSIZE (TYPE_MODE (type)) <= BITS_PER_WORD | |
05409788 | 12405 | && expand_omp_atomic_load (load_bb, addr, loaded_val, index)) |
20906c66 JJ |
12406 | return; |
12407 | ||
05409788 | 12408 | /* Atomic store. */ |
20906c66 JJ |
12409 | if ((GET_MODE_CLASS (TYPE_MODE (type)) == MODE_INT |
12410 | || GET_MODE_CLASS (TYPE_MODE (type)) == MODE_FLOAT) | |
12411 | && GET_MODE_BITSIZE (TYPE_MODE (type)) <= BITS_PER_WORD | |
12412 | && store_bb == single_succ (load_bb) | |
12413 | && first_stmt (store_bb) == store | |
05409788 RH |
12414 | && expand_omp_atomic_store (load_bb, addr, loaded_val, |
12415 | stored_val, index)) | |
20906c66 JJ |
12416 | return; |
12417 | ||
a509ebb5 RL |
12418 | /* When possible, use specialized atomic update functions. */ |
12419 | if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type)) | |
05409788 RH |
12420 | && store_bb == single_succ (load_bb) |
12421 | && expand_omp_atomic_fetch_op (load_bb, addr, | |
12422 | loaded_val, stored_val, index)) | |
12423 | return; | |
a509ebb5 RL |
12424 | |
12425 | /* If we don't have specialized __sync builtins, try and implement | |
12426 | as a compare and swap loop. */ | |
12427 | if (expand_omp_atomic_pipeline (load_bb, store_bb, addr, | |
12428 | loaded_val, stored_val, index)) | |
12429 | return; | |
12430 | } | |
12431 | } | |
12432 | ||
12433 | /* The ultimate fallback is wrapping the operation in a mutex. */ | |
12434 | expand_omp_atomic_mutex (load_bb, store_bb, addr, loaded_val, stored_val); | |
12435 | } | |
12436 | ||
953ff289 | 12437 | |
374d0225 | 12438 | /* Encode an oacc launch argument. This matches the GOMP_LAUNCH_PACK |
3e32ee19 NS |
12439 | macro on gomp-constants.h. We do not check for overflow. */ |
12440 | ||
12441 | static tree | |
12442 | oacc_launch_pack (unsigned code, tree device, unsigned op) | |
12443 | { | |
12444 | tree res; | |
12445 | ||
12446 | res = build_int_cst (unsigned_type_node, GOMP_LAUNCH_PACK (code, 0, op)); | |
12447 | if (device) | |
12448 | { | |
12449 | device = fold_build2 (LSHIFT_EXPR, unsigned_type_node, | |
12450 | device, build_int_cst (unsigned_type_node, | |
12451 | GOMP_LAUNCH_DEVICE_SHIFT)); | |
12452 | res = fold_build2 (BIT_IOR_EXPR, unsigned_type_node, res, device); | |
12453 | } | |
12454 | return res; | |
12455 | } | |
12456 | ||
12457 | /* Look for compute grid dimension clauses and convert to an attribute | |
12458 | attached to FN. This permits the target-side code to (a) massage | |
12459 | the dimensions, (b) emit that data and (c) optimize. Non-constant | |
12460 | dimensions are pushed onto ARGS. | |
12461 | ||
12462 | The attribute value is a TREE_LIST. A set of dimensions is | |
12463 | represented as a list of INTEGER_CST. Those that are runtime | |
374d0225 | 12464 | exprs are represented as an INTEGER_CST of zero. |
3e32ee19 NS |
12465 | |
12466 | TOOO. Normally the attribute will just contain a single such list. If | |
12467 | however it contains a list of lists, this will represent the use of | |
12468 | device_type. Each member of the outer list is an assoc list of | |
12469 | dimensions, keyed by the device type. The first entry will be the | |
12470 | default. Well, that's the plan. */ | |
12471 | ||
12472 | #define OACC_FN_ATTRIB "oacc function" | |
12473 | ||
12474 | /* Replace any existing oacc fn attribute with updated dimensions. */ | |
12475 | ||
12476 | void | |
12477 | replace_oacc_fn_attrib (tree fn, tree dims) | |
12478 | { | |
12479 | tree ident = get_identifier (OACC_FN_ATTRIB); | |
12480 | tree attribs = DECL_ATTRIBUTES (fn); | |
12481 | ||
12482 | /* If we happen to be present as the first attrib, drop it. */ | |
12483 | if (attribs && TREE_PURPOSE (attribs) == ident) | |
12484 | attribs = TREE_CHAIN (attribs); | |
12485 | DECL_ATTRIBUTES (fn) = tree_cons (ident, dims, attribs); | |
12486 | } | |
12487 | ||
12488 | /* Scan CLAUSES for launch dimensions and attach them to the oacc | |
12489 | function attribute. Push any that are non-constant onto the ARGS | |
12490 | list, along with an appropriate GOMP_LAUNCH_DIM tag. */ | |
12491 | ||
61d9c527 | 12492 | void |
3e32ee19 NS |
12493 | set_oacc_fn_attrib (tree fn, tree clauses, vec<tree> *args) |
12494 | { | |
12495 | /* Must match GOMP_DIM ordering. */ | |
12496 | static const omp_clause_code ids[] | |
12497 | = { OMP_CLAUSE_NUM_GANGS, OMP_CLAUSE_NUM_WORKERS, | |
12498 | OMP_CLAUSE_VECTOR_LENGTH }; | |
12499 | unsigned ix; | |
12500 | tree dims[GOMP_DIM_MAX]; | |
12501 | tree attr = NULL_TREE; | |
12502 | unsigned non_const = 0; | |
12503 | ||
12504 | for (ix = GOMP_DIM_MAX; ix--;) | |
12505 | { | |
12506 | tree clause = find_omp_clause (clauses, ids[ix]); | |
12507 | tree dim = NULL_TREE; | |
12508 | ||
12509 | if (clause) | |
12510 | dim = OMP_CLAUSE_EXPR (clause, ids[ix]); | |
12511 | dims[ix] = dim; | |
12512 | if (dim && TREE_CODE (dim) != INTEGER_CST) | |
12513 | { | |
12514 | dim = integer_zero_node; | |
12515 | non_const |= GOMP_DIM_MASK (ix); | |
12516 | } | |
12517 | attr = tree_cons (NULL_TREE, dim, attr); | |
12518 | } | |
12519 | ||
12520 | replace_oacc_fn_attrib (fn, attr); | |
12521 | ||
12522 | if (non_const) | |
12523 | { | |
12524 | /* Push a dynamic argument set. */ | |
12525 | args->safe_push (oacc_launch_pack (GOMP_LAUNCH_DIM, | |
12526 | NULL_TREE, non_const)); | |
12527 | for (unsigned ix = 0; ix != GOMP_DIM_MAX; ix++) | |
12528 | if (non_const & GOMP_DIM_MASK (ix)) | |
12529 | args->safe_push (dims[ix]); | |
12530 | } | |
12531 | } | |
12532 | ||
3a40d81d NS |
12533 | /* Process the routine's dimension clauess to generate an attribute |
12534 | value. Issue diagnostics as appropriate. We default to SEQ | |
12535 | (OpenACC 2.5 clarifies this). All dimensions have a size of zero | |
12536 | (dynamic). TREE_PURPOSE is set to indicate whether that dimension | |
12537 | can have a loop partitioned on it. non-zero indicates | |
12538 | yes, zero indicates no. By construction once a non-zero has been | |
12539 | reached, further inner dimensions must also be non-zero. We set | |
12540 | TREE_VALUE to zero for the dimensions that may be partitioned and | |
12541 | 1 for the other ones -- if a loop is (erroneously) spawned at | |
12542 | an outer level, we don't want to try and partition it. */ | |
12543 | ||
12544 | tree | |
12545 | build_oacc_routine_dims (tree clauses) | |
12546 | { | |
12547 | /* Must match GOMP_DIM ordering. */ | |
12548 | static const omp_clause_code ids[] = | |
12549 | {OMP_CLAUSE_GANG, OMP_CLAUSE_WORKER, OMP_CLAUSE_VECTOR, OMP_CLAUSE_SEQ}; | |
12550 | int ix; | |
12551 | int level = -1; | |
12552 | ||
12553 | for (; clauses; clauses = OMP_CLAUSE_CHAIN (clauses)) | |
12554 | for (ix = GOMP_DIM_MAX + 1; ix--;) | |
12555 | if (OMP_CLAUSE_CODE (clauses) == ids[ix]) | |
12556 | { | |
12557 | if (level >= 0) | |
12558 | error_at (OMP_CLAUSE_LOCATION (clauses), | |
12559 | "multiple loop axes specified for routine"); | |
12560 | level = ix; | |
12561 | break; | |
12562 | } | |
12563 | ||
12564 | /* Default to SEQ. */ | |
12565 | if (level < 0) | |
12566 | level = GOMP_DIM_MAX; | |
12567 | ||
12568 | tree dims = NULL_TREE; | |
12569 | ||
12570 | for (ix = GOMP_DIM_MAX; ix--;) | |
12571 | dims = tree_cons (build_int_cst (boolean_type_node, ix >= level), | |
12572 | build_int_cst (integer_type_node, ix < level), dims); | |
12573 | ||
12574 | return dims; | |
12575 | } | |
12576 | ||
3e32ee19 NS |
12577 | /* Retrieve the oacc function attrib and return it. Non-oacc |
12578 | functions will return NULL. */ | |
12579 | ||
12580 | tree | |
12581 | get_oacc_fn_attrib (tree fn) | |
12582 | { | |
12583 | return lookup_attribute (OACC_FN_ATTRIB, DECL_ATTRIBUTES (fn)); | |
12584 | } | |
12585 | ||
bd751975 NS |
12586 | /* Extract an oacc execution dimension from FN. FN must be an |
12587 | offloaded function or routine that has already had its execution | |
12588 | dimensions lowered to the target-specific values. */ | |
12589 | ||
12590 | int | |
12591 | get_oacc_fn_dim_size (tree fn, int axis) | |
12592 | { | |
12593 | tree attrs = get_oacc_fn_attrib (fn); | |
12594 | ||
12595 | gcc_assert (axis < GOMP_DIM_MAX); | |
12596 | ||
12597 | tree dims = TREE_VALUE (attrs); | |
12598 | while (axis--) | |
12599 | dims = TREE_CHAIN (dims); | |
12600 | ||
12601 | int size = TREE_INT_CST_LOW (TREE_VALUE (dims)); | |
12602 | ||
12603 | return size; | |
12604 | } | |
12605 | ||
12606 | /* Extract the dimension axis from an IFN_GOACC_DIM_POS or | |
12607 | IFN_GOACC_DIM_SIZE call. */ | |
12608 | ||
12609 | int | |
12610 | get_oacc_ifn_dim_arg (const gimple *stmt) | |
12611 | { | |
12612 | gcc_checking_assert (gimple_call_internal_fn (stmt) == IFN_GOACC_DIM_SIZE | |
12613 | || gimple_call_internal_fn (stmt) == IFN_GOACC_DIM_POS); | |
12614 | tree arg = gimple_call_arg (stmt, 0); | |
12615 | HOST_WIDE_INT axis = TREE_INT_CST_LOW (arg); | |
12616 | ||
12617 | gcc_checking_assert (axis >= 0 && axis < GOMP_DIM_MAX); | |
12618 | return (int) axis; | |
12619 | } | |
12620 | ||
886c388d TV |
12621 | /* Mark the loops inside the kernels region starting at REGION_ENTRY and ending |
12622 | at REGION_EXIT. */ | |
12623 | ||
12624 | static void | |
12625 | mark_loops_in_oacc_kernels_region (basic_block region_entry, | |
12626 | basic_block region_exit) | |
12627 | { | |
12628 | struct loop *outer = region_entry->loop_father; | |
12629 | gcc_assert (region_exit == NULL || outer == region_exit->loop_father); | |
12630 | ||
12631 | /* Don't parallelize the kernels region if it contains more than one outer | |
12632 | loop. */ | |
12633 | unsigned int nr_outer_loops = 0; | |
3f217497 | 12634 | struct loop *single_outer = NULL; |
886c388d TV |
12635 | for (struct loop *loop = outer->inner; loop != NULL; loop = loop->next) |
12636 | { | |
12637 | gcc_assert (loop_outer (loop) == outer); | |
12638 | ||
12639 | if (!dominated_by_p (CDI_DOMINATORS, loop->header, region_entry)) | |
12640 | continue; | |
12641 | ||
12642 | if (region_exit != NULL | |
12643 | && dominated_by_p (CDI_DOMINATORS, loop->header, region_exit)) | |
12644 | continue; | |
12645 | ||
12646 | nr_outer_loops++; | |
12647 | single_outer = loop; | |
12648 | } | |
12649 | if (nr_outer_loops != 1) | |
12650 | return; | |
12651 | ||
12652 | for (struct loop *loop = single_outer->inner; loop != NULL; loop = loop->inner) | |
12653 | if (loop->next) | |
12654 | return; | |
12655 | ||
12656 | /* Mark the loops in the region. */ | |
12657 | for (struct loop *loop = single_outer; loop != NULL; loop = loop->inner) | |
12658 | loop->in_oacc_kernels_region = true; | |
12659 | } | |
12660 | ||
b2b40051 MJ |
12661 | /* Types used to pass grid and wortkgroup sizes to kernel invocation. */ |
12662 | ||
12663 | struct GTY(()) grid_launch_attributes_trees | |
12664 | { | |
12665 | tree kernel_dim_array_type; | |
12666 | tree kernel_lattrs_dimnum_decl; | |
12667 | tree kernel_lattrs_grid_decl; | |
12668 | tree kernel_lattrs_group_decl; | |
12669 | tree kernel_launch_attributes_type; | |
12670 | }; | |
12671 | ||
12672 | static GTY(()) struct grid_launch_attributes_trees *grid_attr_trees; | |
12673 | ||
12674 | /* Create types used to pass kernel launch attributes to target. */ | |
12675 | ||
12676 | static void | |
12677 | grid_create_kernel_launch_attr_types (void) | |
12678 | { | |
12679 | if (grid_attr_trees) | |
12680 | return; | |
12681 | grid_attr_trees = ggc_alloc <grid_launch_attributes_trees> (); | |
12682 | ||
12683 | tree dim_arr_index_type | |
12684 | = build_index_type (build_int_cst (integer_type_node, 2)); | |
12685 | grid_attr_trees->kernel_dim_array_type | |
12686 | = build_array_type (uint32_type_node, dim_arr_index_type); | |
12687 | ||
12688 | grid_attr_trees->kernel_launch_attributes_type = make_node (RECORD_TYPE); | |
12689 | grid_attr_trees->kernel_lattrs_dimnum_decl | |
12690 | = build_decl (BUILTINS_LOCATION, FIELD_DECL, get_identifier ("ndim"), | |
12691 | uint32_type_node); | |
12692 | DECL_CHAIN (grid_attr_trees->kernel_lattrs_dimnum_decl) = NULL_TREE; | |
12693 | ||
12694 | grid_attr_trees->kernel_lattrs_grid_decl | |
12695 | = build_decl (BUILTINS_LOCATION, FIELD_DECL, get_identifier ("grid_size"), | |
12696 | grid_attr_trees->kernel_dim_array_type); | |
12697 | DECL_CHAIN (grid_attr_trees->kernel_lattrs_grid_decl) | |
12698 | = grid_attr_trees->kernel_lattrs_dimnum_decl; | |
12699 | grid_attr_trees->kernel_lattrs_group_decl | |
12700 | = build_decl (BUILTINS_LOCATION, FIELD_DECL, get_identifier ("group_size"), | |
12701 | grid_attr_trees->kernel_dim_array_type); | |
12702 | DECL_CHAIN (grid_attr_trees->kernel_lattrs_group_decl) | |
12703 | = grid_attr_trees->kernel_lattrs_grid_decl; | |
12704 | finish_builtin_struct (grid_attr_trees->kernel_launch_attributes_type, | |
12705 | "__gomp_kernel_launch_attributes", | |
12706 | grid_attr_trees->kernel_lattrs_group_decl, NULL_TREE); | |
12707 | } | |
12708 | ||
12709 | /* Insert before the current statement in GSI a store of VALUE to INDEX of | |
12710 | array (of type kernel_dim_array_type) FLD_DECL of RANGE_VAR. VALUE must be | |
12711 | of type uint32_type_node. */ | |
12712 | ||
12713 | static void | |
12714 | grid_insert_store_range_dim (gimple_stmt_iterator *gsi, tree range_var, | |
12715 | tree fld_decl, int index, tree value) | |
12716 | { | |
12717 | tree ref = build4 (ARRAY_REF, uint32_type_node, | |
12718 | build3 (COMPONENT_REF, | |
12719 | grid_attr_trees->kernel_dim_array_type, | |
12720 | range_var, fld_decl, NULL_TREE), | |
12721 | build_int_cst (integer_type_node, index), | |
12722 | NULL_TREE, NULL_TREE); | |
12723 | gsi_insert_before (gsi, gimple_build_assign (ref, value), GSI_SAME_STMT); | |
12724 | } | |
12725 | ||
12726 | /* Return a tree representation of a pointer to a structure with grid and | |
12727 | work-group size information. Statements filling that information will be | |
12728 | inserted before GSI, TGT_STMT is the target statement which has the | |
12729 | necessary information in it. */ | |
12730 | ||
12731 | static tree | |
12732 | grid_get_kernel_launch_attributes (gimple_stmt_iterator *gsi, | |
12733 | gomp_target *tgt_stmt) | |
12734 | { | |
12735 | grid_create_kernel_launch_attr_types (); | |
12736 | tree u32_one = build_one_cst (uint32_type_node); | |
12737 | tree lattrs = create_tmp_var (grid_attr_trees->kernel_launch_attributes_type, | |
12738 | "__kernel_launch_attrs"); | |
12739 | ||
12740 | unsigned max_dim = 0; | |
12741 | for (tree clause = gimple_omp_target_clauses (tgt_stmt); | |
12742 | clause; | |
12743 | clause = OMP_CLAUSE_CHAIN (clause)) | |
12744 | { | |
12745 | if (OMP_CLAUSE_CODE (clause) != OMP_CLAUSE__GRIDDIM_) | |
12746 | continue; | |
12747 | ||
12748 | unsigned dim = OMP_CLAUSE__GRIDDIM__DIMENSION (clause); | |
12749 | max_dim = MAX (dim, max_dim); | |
12750 | ||
12751 | grid_insert_store_range_dim (gsi, lattrs, | |
12752 | grid_attr_trees->kernel_lattrs_grid_decl, | |
12753 | dim, OMP_CLAUSE__GRIDDIM__SIZE (clause)); | |
12754 | grid_insert_store_range_dim (gsi, lattrs, | |
12755 | grid_attr_trees->kernel_lattrs_group_decl, | |
12756 | dim, OMP_CLAUSE__GRIDDIM__GROUP (clause)); | |
12757 | } | |
12758 | ||
12759 | tree dimref = build3 (COMPONENT_REF, uint32_type_node, lattrs, | |
12760 | grid_attr_trees->kernel_lattrs_dimnum_decl, NULL_TREE); | |
12761 | /* At this moment we cannot gridify a loop with a collapse clause. */ | |
12762 | /* TODO: Adjust when we support bigger collapse. */ | |
12763 | gcc_assert (max_dim == 0); | |
12764 | gsi_insert_before (gsi, gimple_build_assign (dimref, u32_one), GSI_SAME_STMT); | |
12765 | TREE_ADDRESSABLE (lattrs) = 1; | |
12766 | return build_fold_addr_expr (lattrs); | |
12767 | } | |
12768 | ||
12769 | /* Build target argument identifier from the DEVICE identifier, value | |
12770 | identifier ID and whether the element also has a SUBSEQUENT_PARAM. */ | |
12771 | ||
12772 | static tree | |
12773 | get_target_argument_identifier_1 (int device, bool subseqent_param, int id) | |
12774 | { | |
12775 | tree t = build_int_cst (integer_type_node, device); | |
12776 | if (subseqent_param) | |
12777 | t = fold_build2 (BIT_IOR_EXPR, integer_type_node, t, | |
12778 | build_int_cst (integer_type_node, | |
12779 | GOMP_TARGET_ARG_SUBSEQUENT_PARAM)); | |
12780 | t = fold_build2 (BIT_IOR_EXPR, integer_type_node, t, | |
12781 | build_int_cst (integer_type_node, id)); | |
12782 | return t; | |
12783 | } | |
12784 | ||
12785 | /* Like above but return it in type that can be directly stored as an element | |
12786 | of the argument array. */ | |
12787 | ||
12788 | static tree | |
12789 | get_target_argument_identifier (int device, bool subseqent_param, int id) | |
12790 | { | |
12791 | tree t = get_target_argument_identifier_1 (device, subseqent_param, id); | |
12792 | return fold_convert (ptr_type_node, t); | |
12793 | } | |
12794 | ||
12795 | /* Return a target argument consisting of DEVICE identifier, value identifier | |
12796 | ID, and the actual VALUE. */ | |
12797 | ||
12798 | static tree | |
12799 | get_target_argument_value (gimple_stmt_iterator *gsi, int device, int id, | |
12800 | tree value) | |
12801 | { | |
12802 | tree t = fold_build2 (LSHIFT_EXPR, integer_type_node, | |
12803 | fold_convert (integer_type_node, value), | |
12804 | build_int_cst (unsigned_type_node, | |
12805 | GOMP_TARGET_ARG_VALUE_SHIFT)); | |
12806 | t = fold_build2 (BIT_IOR_EXPR, integer_type_node, t, | |
12807 | get_target_argument_identifier_1 (device, false, id)); | |
12808 | t = fold_convert (ptr_type_node, t); | |
12809 | return force_gimple_operand_gsi (gsi, t, true, NULL, true, GSI_SAME_STMT); | |
12810 | } | |
12811 | ||
12812 | /* If VALUE is an integer constant greater than -2^15 and smaller than 2^15, | |
12813 | push one argument to ARGS with both the DEVICE, ID and VALUE embedded in it, | |
12814 | otherwise push an identifier (with DEVICE and ID) and the VALUE in two | |
12815 | arguments. */ | |
12816 | ||
12817 | static void | |
12818 | push_target_argument_according_to_value (gimple_stmt_iterator *gsi, int device, | |
12819 | int id, tree value, vec <tree> *args) | |
12820 | { | |
12821 | if (tree_fits_shwi_p (value) | |
12822 | && tree_to_shwi (value) > -(1 << 15) | |
12823 | && tree_to_shwi (value) < (1 << 15)) | |
12824 | args->quick_push (get_target_argument_value (gsi, device, id, value)); | |
12825 | else | |
12826 | { | |
12827 | args->quick_push (get_target_argument_identifier (device, true, id)); | |
12828 | value = fold_convert (ptr_type_node, value); | |
12829 | value = force_gimple_operand_gsi (gsi, value, true, NULL, true, | |
12830 | GSI_SAME_STMT); | |
12831 | args->quick_push (value); | |
12832 | } | |
12833 | } | |
12834 | ||
12835 | /* Create an array of arguments that is then passed to GOMP_target. */ | |
12836 | ||
12837 | static tree | |
12838 | get_target_arguments (gimple_stmt_iterator *gsi, gomp_target *tgt_stmt) | |
12839 | { | |
12840 | auto_vec <tree, 6> args; | |
12841 | tree clauses = gimple_omp_target_clauses (tgt_stmt); | |
12842 | tree t, c = find_omp_clause (clauses, OMP_CLAUSE_NUM_TEAMS); | |
12843 | if (c) | |
12844 | t = OMP_CLAUSE_NUM_TEAMS_EXPR (c); | |
12845 | else | |
12846 | t = integer_minus_one_node; | |
12847 | push_target_argument_according_to_value (gsi, GOMP_TARGET_ARG_DEVICE_ALL, | |
12848 | GOMP_TARGET_ARG_NUM_TEAMS, t, &args); | |
12849 | ||
12850 | c = find_omp_clause (clauses, OMP_CLAUSE_THREAD_LIMIT); | |
12851 | if (c) | |
12852 | t = OMP_CLAUSE_THREAD_LIMIT_EXPR (c); | |
12853 | else | |
12854 | t = integer_minus_one_node; | |
12855 | push_target_argument_according_to_value (gsi, GOMP_TARGET_ARG_DEVICE_ALL, | |
12856 | GOMP_TARGET_ARG_THREAD_LIMIT, t, | |
12857 | &args); | |
12858 | ||
12859 | /* Add HSA-specific grid sizes, if available. */ | |
12860 | if (find_omp_clause (gimple_omp_target_clauses (tgt_stmt), | |
12861 | OMP_CLAUSE__GRIDDIM_)) | |
12862 | { | |
12863 | t = get_target_argument_identifier (GOMP_DEVICE_HSA, true, | |
12864 | GOMP_TARGET_ARG_HSA_KERNEL_ATTRIBUTES); | |
12865 | args.quick_push (t); | |
12866 | args.quick_push (grid_get_kernel_launch_attributes (gsi, tgt_stmt)); | |
12867 | } | |
12868 | ||
12869 | /* Produce more, perhaps device specific, arguments here. */ | |
12870 | ||
12871 | tree argarray = create_tmp_var (build_array_type_nelts (ptr_type_node, | |
12872 | args.length () + 1), | |
12873 | ".omp_target_args"); | |
12874 | for (unsigned i = 0; i < args.length (); i++) | |
12875 | { | |
12876 | tree ref = build4 (ARRAY_REF, ptr_type_node, argarray, | |
12877 | build_int_cst (integer_type_node, i), | |
12878 | NULL_TREE, NULL_TREE); | |
12879 | gsi_insert_before (gsi, gimple_build_assign (ref, args[i]), | |
12880 | GSI_SAME_STMT); | |
12881 | } | |
12882 | tree ref = build4 (ARRAY_REF, ptr_type_node, argarray, | |
12883 | build_int_cst (integer_type_node, args.length ()), | |
12884 | NULL_TREE, NULL_TREE); | |
12885 | gsi_insert_before (gsi, gimple_build_assign (ref, null_pointer_node), | |
12886 | GSI_SAME_STMT); | |
12887 | TREE_ADDRESSABLE (argarray) = 1; | |
12888 | return build_fold_addr_expr (argarray); | |
12889 | } | |
12890 | ||
41dbbb37 | 12891 | /* Expand the GIMPLE_OMP_TARGET starting at REGION. */ |
acf0174b JJ |
12892 | |
12893 | static void | |
12894 | expand_omp_target (struct omp_region *region) | |
12895 | { | |
12896 | basic_block entry_bb, exit_bb, new_bb; | |
41dbbb37 TS |
12897 | struct function *child_cfun; |
12898 | tree child_fn, block, t; | |
acf0174b | 12899 | gimple_stmt_iterator gsi; |
538dd0b7 | 12900 | gomp_target *entry_stmt; |
355fe088 | 12901 | gimple *stmt; |
acf0174b | 12902 | edge e; |
41dbbb37 | 12903 | bool offloaded, data_region; |
acf0174b | 12904 | |
538dd0b7 | 12905 | entry_stmt = as_a <gomp_target *> (last_stmt (region->entry)); |
acf0174b | 12906 | new_bb = region->entry; |
41dbbb37 TS |
12907 | |
12908 | offloaded = is_gimple_omp_offloaded (entry_stmt); | |
12909 | switch (gimple_omp_target_kind (entry_stmt)) | |
12910 | { | |
3e32ee19 NS |
12911 | case GF_OMP_TARGET_KIND_REGION: |
12912 | case GF_OMP_TARGET_KIND_UPDATE: | |
d9a6bd32 JJ |
12913 | case GF_OMP_TARGET_KIND_ENTER_DATA: |
12914 | case GF_OMP_TARGET_KIND_EXIT_DATA: | |
12915 | case GF_OMP_TARGET_KIND_OACC_PARALLEL: | |
12916 | case GF_OMP_TARGET_KIND_OACC_KERNELS: | |
41dbbb37 TS |
12917 | case GF_OMP_TARGET_KIND_OACC_UPDATE: |
12918 | case GF_OMP_TARGET_KIND_OACC_ENTER_EXIT_DATA: | |
6e232ba4 | 12919 | case GF_OMP_TARGET_KIND_OACC_DECLARE: |
41dbbb37 TS |
12920 | data_region = false; |
12921 | break; | |
12922 | case GF_OMP_TARGET_KIND_DATA: | |
12923 | case GF_OMP_TARGET_KIND_OACC_DATA: | |
37d5ad46 | 12924 | case GF_OMP_TARGET_KIND_OACC_HOST_DATA: |
41dbbb37 TS |
12925 | data_region = true; |
12926 | break; | |
12927 | default: | |
12928 | gcc_unreachable (); | |
12929 | } | |
12930 | ||
12931 | child_fn = NULL_TREE; | |
12932 | child_cfun = NULL; | |
12933 | if (offloaded) | |
acf0174b JJ |
12934 | { |
12935 | child_fn = gimple_omp_target_child_fn (entry_stmt); | |
12936 | child_cfun = DECL_STRUCT_FUNCTION (child_fn); | |
12937 | } | |
12938 | ||
41dbbb37 TS |
12939 | /* Supported by expand_omp_taskreg, but not here. */ |
12940 | if (child_cfun != NULL) | |
12941 | gcc_checking_assert (!child_cfun->cfg); | |
12942 | gcc_checking_assert (!gimple_in_ssa_p (cfun)); | |
12943 | ||
acf0174b JJ |
12944 | entry_bb = region->entry; |
12945 | exit_bb = region->exit; | |
12946 | ||
886c388d TV |
12947 | if (gimple_omp_target_kind (entry_stmt) == GF_OMP_TARGET_KIND_OACC_KERNELS) |
12948 | mark_loops_in_oacc_kernels_region (region->entry, region->exit); | |
12949 | ||
41dbbb37 | 12950 | if (offloaded) |
acf0174b JJ |
12951 | { |
12952 | unsigned srcidx, dstidx, num; | |
12953 | ||
41dbbb37 | 12954 | /* If the offloading region needs data sent from the parent |
acf0174b | 12955 | function, then the very first statement (except possible |
41dbbb37 | 12956 | tree profile counter updates) of the offloading body |
acf0174b JJ |
12957 | is a copy assignment .OMP_DATA_I = &.OMP_DATA_O. Since |
12958 | &.OMP_DATA_O is passed as an argument to the child function, | |
12959 | we need to replace it with the argument as seen by the child | |
12960 | function. | |
12961 | ||
12962 | In most cases, this will end up being the identity assignment | |
41dbbb37 | 12963 | .OMP_DATA_I = .OMP_DATA_I. However, if the offloading body had |
acf0174b JJ |
12964 | a function call that has been inlined, the original PARM_DECL |
12965 | .OMP_DATA_I may have been converted into a different local | |
12966 | variable. In which case, we need to keep the assignment. */ | |
41dbbb37 TS |
12967 | tree data_arg = gimple_omp_target_data_arg (entry_stmt); |
12968 | if (data_arg) | |
acf0174b JJ |
12969 | { |
12970 | basic_block entry_succ_bb = single_succ (entry_bb); | |
12971 | gimple_stmt_iterator gsi; | |
12972 | tree arg; | |
355fe088 | 12973 | gimple *tgtcopy_stmt = NULL; |
41dbbb37 | 12974 | tree sender = TREE_VEC_ELT (data_arg, 0); |
acf0174b JJ |
12975 | |
12976 | for (gsi = gsi_start_bb (entry_succ_bb); ; gsi_next (&gsi)) | |
12977 | { | |
12978 | gcc_assert (!gsi_end_p (gsi)); | |
12979 | stmt = gsi_stmt (gsi); | |
12980 | if (gimple_code (stmt) != GIMPLE_ASSIGN) | |
12981 | continue; | |
12982 | ||
12983 | if (gimple_num_ops (stmt) == 2) | |
12984 | { | |
12985 | tree arg = gimple_assign_rhs1 (stmt); | |
12986 | ||
12987 | /* We're ignoring the subcode because we're | |
12988 | effectively doing a STRIP_NOPS. */ | |
12989 | ||
12990 | if (TREE_CODE (arg) == ADDR_EXPR | |
12991 | && TREE_OPERAND (arg, 0) == sender) | |
12992 | { | |
12993 | tgtcopy_stmt = stmt; | |
12994 | break; | |
12995 | } | |
12996 | } | |
12997 | } | |
12998 | ||
12999 | gcc_assert (tgtcopy_stmt != NULL); | |
13000 | arg = DECL_ARGUMENTS (child_fn); | |
13001 | ||
13002 | gcc_assert (gimple_assign_lhs (tgtcopy_stmt) == arg); | |
13003 | gsi_remove (&gsi, true); | |
13004 | } | |
13005 | ||
13006 | /* Declare local variables needed in CHILD_CFUN. */ | |
13007 | block = DECL_INITIAL (child_fn); | |
13008 | BLOCK_VARS (block) = vec2chain (child_cfun->local_decls); | |
41dbbb37 | 13009 | /* The gimplifier could record temporaries in the offloading block |
acf0174b JJ |
13010 | rather than in containing function's local_decls chain, |
13011 | which would mean cgraph missed finalizing them. Do it now. */ | |
13012 | for (t = BLOCK_VARS (block); t; t = DECL_CHAIN (t)) | |
13013 | if (TREE_CODE (t) == VAR_DECL | |
13014 | && TREE_STATIC (t) | |
13015 | && !DECL_EXTERNAL (t)) | |
9041d2e6 | 13016 | varpool_node::finalize_decl (t); |
acf0174b JJ |
13017 | DECL_SAVED_TREE (child_fn) = NULL; |
13018 | /* We'll create a CFG for child_fn, so no gimple body is needed. */ | |
13019 | gimple_set_body (child_fn, NULL); | |
13020 | TREE_USED (block) = 1; | |
13021 | ||
13022 | /* Reset DECL_CONTEXT on function arguments. */ | |
13023 | for (t = DECL_ARGUMENTS (child_fn); t; t = DECL_CHAIN (t)) | |
13024 | DECL_CONTEXT (t) = child_fn; | |
13025 | ||
41dbbb37 | 13026 | /* Split ENTRY_BB at GIMPLE_*, |
acf0174b JJ |
13027 | so that it can be moved to the child function. */ |
13028 | gsi = gsi_last_bb (entry_bb); | |
13029 | stmt = gsi_stmt (gsi); | |
41dbbb37 TS |
13030 | gcc_assert (stmt |
13031 | && gimple_code (stmt) == gimple_code (entry_stmt)); | |
acf0174b | 13032 | e = split_block (entry_bb, stmt); |
b13c907a | 13033 | gsi_remove (&gsi, true); |
acf0174b JJ |
13034 | entry_bb = e->dest; |
13035 | single_succ_edge (entry_bb)->flags = EDGE_FALLTHRU; | |
13036 | ||
13037 | /* Convert GIMPLE_OMP_RETURN into a RETURN_EXPR. */ | |
13038 | if (exit_bb) | |
13039 | { | |
13040 | gsi = gsi_last_bb (exit_bb); | |
13041 | gcc_assert (!gsi_end_p (gsi) | |
13042 | && gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_RETURN); | |
13043 | stmt = gimple_build_return (NULL); | |
13044 | gsi_insert_after (&gsi, stmt, GSI_SAME_STMT); | |
13045 | gsi_remove (&gsi, true); | |
13046 | } | |
13047 | ||
41dbbb37 | 13048 | /* Move the offloading region into CHILD_CFUN. */ |
acf0174b JJ |
13049 | |
13050 | block = gimple_block (entry_stmt); | |
13051 | ||
13052 | new_bb = move_sese_region_to_fn (child_cfun, entry_bb, exit_bb, block); | |
13053 | if (exit_bb) | |
13054 | single_succ_edge (new_bb)->flags = EDGE_FALLTHRU; | |
13055 | /* When the OMP expansion process cannot guarantee an up-to-date | |
13056 | loop tree arrange for the child function to fixup loops. */ | |
13057 | if (loops_state_satisfies_p (LOOPS_NEED_FIXUP)) | |
13058 | child_cfun->x_current_loops->state |= LOOPS_NEED_FIXUP; | |
13059 | ||
13060 | /* Remove non-local VAR_DECLs from child_cfun->local_decls list. */ | |
13061 | num = vec_safe_length (child_cfun->local_decls); | |
13062 | for (srcidx = 0, dstidx = 0; srcidx < num; srcidx++) | |
13063 | { | |
13064 | t = (*child_cfun->local_decls)[srcidx]; | |
13065 | if (DECL_CONTEXT (t) == cfun->decl) | |
13066 | continue; | |
13067 | if (srcidx != dstidx) | |
13068 | (*child_cfun->local_decls)[dstidx] = t; | |
13069 | dstidx++; | |
13070 | } | |
13071 | if (dstidx != num) | |
13072 | vec_safe_truncate (child_cfun->local_decls, dstidx); | |
13073 | ||
13074 | /* Inform the callgraph about the new function. */ | |
a1ceb604 JJ |
13075 | child_cfun->curr_properties = cfun->curr_properties; |
13076 | child_cfun->has_simduid_loops |= cfun->has_simduid_loops; | |
13077 | child_cfun->has_force_vectorize_loops |= cfun->has_force_vectorize_loops; | |
c2f57691 TV |
13078 | cgraph_node *node = cgraph_node::get_create (child_fn); |
13079 | node->parallelized_function = 1; | |
d52f5295 | 13080 | cgraph_node::add_new_function (child_fn, true); |
acf0174b | 13081 | |
ec6fe917 | 13082 | /* Add the new function to the offload table. */ |
1d899da2 TS |
13083 | if (ENABLE_OFFLOADING) |
13084 | vec_safe_push (offload_funcs, child_fn); | |
ec6fe917 | 13085 | |
e01d41e5 JJ |
13086 | bool need_asm = DECL_ASSEMBLER_NAME_SET_P (current_function_decl) |
13087 | && !DECL_ASSEMBLER_NAME_SET_P (child_fn); | |
13088 | ||
acf0174b JJ |
13089 | /* Fix the callgraph edges for child_cfun. Those for cfun will be |
13090 | fixed in a following pass. */ | |
13091 | push_cfun (child_cfun); | |
e01d41e5 JJ |
13092 | if (need_asm) |
13093 | assign_assembler_name_if_neeeded (child_fn); | |
3dafb85c | 13094 | cgraph_edge::rebuild_edges (); |
acf0174b JJ |
13095 | |
13096 | /* Some EH regions might become dead, see PR34608. If | |
13097 | pass_cleanup_cfg isn't the first pass to happen with the | |
13098 | new child, these dead EH edges might cause problems. | |
13099 | Clean them up now. */ | |
13100 | if (flag_exceptions) | |
13101 | { | |
13102 | basic_block bb; | |
13103 | bool changed = false; | |
13104 | ||
11cd3bed | 13105 | FOR_EACH_BB_FN (bb, cfun) |
acf0174b JJ |
13106 | changed |= gimple_purge_dead_eh_edges (bb); |
13107 | if (changed) | |
13108 | cleanup_tree_cfg (); | |
13109 | } | |
b2b29377 | 13110 | if (flag_checking && !loops_state_satisfies_p (LOOPS_NEED_FIXUP)) |
e67d7a1e | 13111 | verify_loop_structure (); |
acf0174b | 13112 | pop_cfun (); |
e01d41e5 JJ |
13113 | |
13114 | if (dump_file && !gimple_in_ssa_p (cfun)) | |
13115 | { | |
13116 | omp_any_child_fn_dumped = true; | |
13117 | dump_function_header (dump_file, child_fn, dump_flags); | |
13118 | dump_function_to_file (child_fn, dump_file, dump_flags); | |
13119 | } | |
acf0174b JJ |
13120 | } |
13121 | ||
41dbbb37 | 13122 | /* Emit a library call to launch the offloading region, or do data |
acf0174b | 13123 | transfers. */ |
d9a6bd32 | 13124 | tree t1, t2, t3, t4, device, cond, depend, c, clauses; |
acf0174b JJ |
13125 | enum built_in_function start_ix; |
13126 | location_t clause_loc; | |
d9a6bd32 | 13127 | unsigned int flags_i = 0; |
acf0174b | 13128 | |
41dbbb37 TS |
13129 | switch (gimple_omp_target_kind (entry_stmt)) |
13130 | { | |
13131 | case GF_OMP_TARGET_KIND_REGION: | |
13132 | start_ix = BUILT_IN_GOMP_TARGET; | |
13133 | break; | |
13134 | case GF_OMP_TARGET_KIND_DATA: | |
13135 | start_ix = BUILT_IN_GOMP_TARGET_DATA; | |
13136 | break; | |
13137 | case GF_OMP_TARGET_KIND_UPDATE: | |
13138 | start_ix = BUILT_IN_GOMP_TARGET_UPDATE; | |
13139 | break; | |
d9a6bd32 JJ |
13140 | case GF_OMP_TARGET_KIND_ENTER_DATA: |
13141 | start_ix = BUILT_IN_GOMP_TARGET_ENTER_EXIT_DATA; | |
13142 | break; | |
13143 | case GF_OMP_TARGET_KIND_EXIT_DATA: | |
13144 | start_ix = BUILT_IN_GOMP_TARGET_ENTER_EXIT_DATA; | |
13145 | flags_i |= GOMP_TARGET_FLAG_EXIT_DATA; | |
13146 | break; | |
41dbbb37 TS |
13147 | case GF_OMP_TARGET_KIND_OACC_PARALLEL: |
13148 | case GF_OMP_TARGET_KIND_OACC_KERNELS: | |
13149 | start_ix = BUILT_IN_GOACC_PARALLEL; | |
13150 | break; | |
13151 | case GF_OMP_TARGET_KIND_OACC_DATA: | |
13152 | start_ix = BUILT_IN_GOACC_DATA_START; | |
13153 | break; | |
13154 | case GF_OMP_TARGET_KIND_OACC_UPDATE: | |
13155 | start_ix = BUILT_IN_GOACC_UPDATE; | |
13156 | break; | |
13157 | case GF_OMP_TARGET_KIND_OACC_ENTER_EXIT_DATA: | |
13158 | start_ix = BUILT_IN_GOACC_ENTER_EXIT_DATA; | |
13159 | break; | |
6e232ba4 JN |
13160 | case GF_OMP_TARGET_KIND_OACC_DECLARE: |
13161 | start_ix = BUILT_IN_GOACC_DECLARE; | |
13162 | break; | |
37d5ad46 JB |
13163 | case GF_OMP_TARGET_KIND_OACC_HOST_DATA: |
13164 | start_ix = BUILT_IN_GOACC_HOST_DATA; | |
13165 | break; | |
41dbbb37 TS |
13166 | default: |
13167 | gcc_unreachable (); | |
13168 | } | |
acf0174b | 13169 | |
41dbbb37 | 13170 | clauses = gimple_omp_target_clauses (entry_stmt); |
acf0174b | 13171 | |
41dbbb37 TS |
13172 | /* By default, the value of DEVICE is GOMP_DEVICE_ICV (let runtime |
13173 | library choose) and there is no conditional. */ | |
acf0174b | 13174 | cond = NULL_TREE; |
41dbbb37 | 13175 | device = build_int_cst (integer_type_node, GOMP_DEVICE_ICV); |
acf0174b JJ |
13176 | |
13177 | c = find_omp_clause (clauses, OMP_CLAUSE_IF); | |
13178 | if (c) | |
13179 | cond = OMP_CLAUSE_IF_EXPR (c); | |
13180 | ||
13181 | c = find_omp_clause (clauses, OMP_CLAUSE_DEVICE); | |
13182 | if (c) | |
13183 | { | |
41dbbb37 TS |
13184 | /* Even if we pass it to all library function calls, it is currently only |
13185 | defined/used for the OpenMP target ones. */ | |
13186 | gcc_checking_assert (start_ix == BUILT_IN_GOMP_TARGET | |
13187 | || start_ix == BUILT_IN_GOMP_TARGET_DATA | |
d9a6bd32 JJ |
13188 | || start_ix == BUILT_IN_GOMP_TARGET_UPDATE |
13189 | || start_ix == BUILT_IN_GOMP_TARGET_ENTER_EXIT_DATA); | |
41dbbb37 | 13190 | |
acf0174b JJ |
13191 | device = OMP_CLAUSE_DEVICE_ID (c); |
13192 | clause_loc = OMP_CLAUSE_LOCATION (c); | |
13193 | } | |
13194 | else | |
13195 | clause_loc = gimple_location (entry_stmt); | |
13196 | ||
d9a6bd32 JJ |
13197 | c = find_omp_clause (clauses, OMP_CLAUSE_NOWAIT); |
13198 | if (c) | |
13199 | flags_i |= GOMP_TARGET_FLAG_NOWAIT; | |
13200 | ||
acf0174b JJ |
13201 | /* Ensure 'device' is of the correct type. */ |
13202 | device = fold_convert_loc (clause_loc, integer_type_node, device); | |
13203 | ||
13204 | /* If we found the clause 'if (cond)', build | |
41dbbb37 | 13205 | (cond ? device : GOMP_DEVICE_HOST_FALLBACK). */ |
acf0174b JJ |
13206 | if (cond) |
13207 | { | |
13208 | cond = gimple_boolify (cond); | |
13209 | ||
13210 | basic_block cond_bb, then_bb, else_bb; | |
13211 | edge e; | |
13212 | tree tmp_var; | |
13213 | ||
b731b390 | 13214 | tmp_var = create_tmp_var (TREE_TYPE (device)); |
41dbbb37 | 13215 | if (offloaded) |
c4d281b2 | 13216 | e = split_block_after_labels (new_bb); |
41dbbb37 | 13217 | else |
acf0174b JJ |
13218 | { |
13219 | gsi = gsi_last_bb (new_bb); | |
13220 | gsi_prev (&gsi); | |
13221 | e = split_block (new_bb, gsi_stmt (gsi)); | |
13222 | } | |
acf0174b JJ |
13223 | cond_bb = e->src; |
13224 | new_bb = e->dest; | |
13225 | remove_edge (e); | |
13226 | ||
13227 | then_bb = create_empty_bb (cond_bb); | |
13228 | else_bb = create_empty_bb (then_bb); | |
13229 | set_immediate_dominator (CDI_DOMINATORS, then_bb, cond_bb); | |
13230 | set_immediate_dominator (CDI_DOMINATORS, else_bb, cond_bb); | |
13231 | ||
13232 | stmt = gimple_build_cond_empty (cond); | |
13233 | gsi = gsi_last_bb (cond_bb); | |
13234 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
13235 | ||
13236 | gsi = gsi_start_bb (then_bb); | |
13237 | stmt = gimple_build_assign (tmp_var, device); | |
13238 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
13239 | ||
13240 | gsi = gsi_start_bb (else_bb); | |
13241 | stmt = gimple_build_assign (tmp_var, | |
41dbbb37 TS |
13242 | build_int_cst (integer_type_node, |
13243 | GOMP_DEVICE_HOST_FALLBACK)); | |
acf0174b JJ |
13244 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); |
13245 | ||
13246 | make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE); | |
13247 | make_edge (cond_bb, else_bb, EDGE_FALSE_VALUE); | |
726338f4 RB |
13248 | add_bb_to_loop (then_bb, cond_bb->loop_father); |
13249 | add_bb_to_loop (else_bb, cond_bb->loop_father); | |
acf0174b JJ |
13250 | make_edge (then_bb, new_bb, EDGE_FALLTHRU); |
13251 | make_edge (else_bb, new_bb, EDGE_FALLTHRU); | |
13252 | ||
13253 | device = tmp_var; | |
13254 | } | |
13255 | ||
13256 | gsi = gsi_last_bb (new_bb); | |
13257 | t = gimple_omp_target_data_arg (entry_stmt); | |
13258 | if (t == NULL) | |
13259 | { | |
13260 | t1 = size_zero_node; | |
13261 | t2 = build_zero_cst (ptr_type_node); | |
13262 | t3 = t2; | |
13263 | t4 = t2; | |
13264 | } | |
13265 | else | |
13266 | { | |
13267 | t1 = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (TREE_VEC_ELT (t, 1)))); | |
13268 | t1 = size_binop (PLUS_EXPR, t1, size_int (1)); | |
13269 | t2 = build_fold_addr_expr (TREE_VEC_ELT (t, 0)); | |
13270 | t3 = build_fold_addr_expr (TREE_VEC_ELT (t, 1)); | |
13271 | t4 = build_fold_addr_expr (TREE_VEC_ELT (t, 2)); | |
13272 | } | |
13273 | ||
355fe088 | 13274 | gimple *g; |
3e32ee19 | 13275 | bool tagging = false; |
41dbbb37 | 13276 | /* The maximum number used by any start_ix, without varargs. */ |
9410d9b2 JJ |
13277 | auto_vec<tree, 11> args; |
13278 | args.quick_push (device); | |
41dbbb37 | 13279 | if (offloaded) |
9410d9b2 | 13280 | args.quick_push (build_fold_addr_expr (child_fn)); |
9410d9b2 JJ |
13281 | args.quick_push (t1); |
13282 | args.quick_push (t2); | |
13283 | args.quick_push (t3); | |
13284 | args.quick_push (t4); | |
41dbbb37 TS |
13285 | switch (start_ix) |
13286 | { | |
13287 | case BUILT_IN_GOACC_DATA_START: | |
6e232ba4 | 13288 | case BUILT_IN_GOACC_DECLARE: |
41dbbb37 | 13289 | case BUILT_IN_GOMP_TARGET_DATA: |
37d5ad46 | 13290 | case BUILT_IN_GOACC_HOST_DATA: |
d9a6bd32 JJ |
13291 | break; |
13292 | case BUILT_IN_GOMP_TARGET: | |
41dbbb37 | 13293 | case BUILT_IN_GOMP_TARGET_UPDATE: |
d9a6bd32 JJ |
13294 | case BUILT_IN_GOMP_TARGET_ENTER_EXIT_DATA: |
13295 | args.quick_push (build_int_cst (unsigned_type_node, flags_i)); | |
13296 | c = find_omp_clause (clauses, OMP_CLAUSE_DEPEND); | |
13297 | if (c) | |
13298 | depend = OMP_CLAUSE_DECL (c); | |
13299 | else | |
13300 | depend = build_int_cst (ptr_type_node, 0); | |
13301 | args.quick_push (depend); | |
e01d41e5 | 13302 | if (start_ix == BUILT_IN_GOMP_TARGET) |
b2b40051 | 13303 | args.quick_push (get_target_arguments (&gsi, entry_stmt)); |
41dbbb37 TS |
13304 | break; |
13305 | case BUILT_IN_GOACC_PARALLEL: | |
13306 | { | |
3e32ee19 NS |
13307 | set_oacc_fn_attrib (child_fn, clauses, &args); |
13308 | tagging = true; | |
41dbbb37 TS |
13309 | } |
13310 | /* FALLTHRU */ | |
13311 | case BUILT_IN_GOACC_ENTER_EXIT_DATA: | |
13312 | case BUILT_IN_GOACC_UPDATE: | |
13313 | { | |
3e32ee19 NS |
13314 | tree t_async = NULL_TREE; |
13315 | ||
13316 | /* If present, use the value specified by the respective | |
41dbbb37 TS |
13317 | clause, making sure that is of the correct type. */ |
13318 | c = find_omp_clause (clauses, OMP_CLAUSE_ASYNC); | |
13319 | if (c) | |
13320 | t_async = fold_convert_loc (OMP_CLAUSE_LOCATION (c), | |
13321 | integer_type_node, | |
13322 | OMP_CLAUSE_ASYNC_EXPR (c)); | |
3e32ee19 NS |
13323 | else if (!tagging) |
13324 | /* Default values for t_async. */ | |
13325 | t_async = fold_convert_loc (gimple_location (entry_stmt), | |
13326 | integer_type_node, | |
13327 | build_int_cst (integer_type_node, | |
13328 | GOMP_ASYNC_SYNC)); | |
13329 | if (tagging && t_async) | |
41dbbb37 | 13330 | { |
3e32ee19 | 13331 | unsigned HOST_WIDE_INT i_async; |
41dbbb37 | 13332 | |
3e32ee19 | 13333 | if (TREE_CODE (t_async) == INTEGER_CST) |
41dbbb37 | 13334 | { |
3e32ee19 NS |
13335 | /* See if we can pack the async arg in to the tag's |
13336 | operand. */ | |
13337 | i_async = TREE_INT_CST_LOW (t_async); | |
13338 | ||
13339 | if (i_async < GOMP_LAUNCH_OP_MAX) | |
13340 | t_async = NULL_TREE; | |
41dbbb37 | 13341 | } |
3e32ee19 NS |
13342 | if (t_async) |
13343 | i_async = GOMP_LAUNCH_OP_MAX; | |
13344 | args.safe_push (oacc_launch_pack | |
13345 | (GOMP_LAUNCH_ASYNC, NULL_TREE, i_async)); | |
13346 | } | |
13347 | if (t_async) | |
13348 | args.safe_push (t_async); | |
41dbbb37 | 13349 | |
3e32ee19 NS |
13350 | /* Save the argument index, and ... */ |
13351 | unsigned t_wait_idx = args.length (); | |
13352 | unsigned num_waits = 0; | |
13353 | c = find_omp_clause (clauses, OMP_CLAUSE_WAIT); | |
13354 | if (!tagging || c) | |
13355 | /* ... push a placeholder. */ | |
13356 | args.safe_push (integer_zero_node); | |
13357 | ||
13358 | for (; c; c = OMP_CLAUSE_CHAIN (c)) | |
13359 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_WAIT) | |
13360 | { | |
13361 | args.safe_push (fold_convert_loc (OMP_CLAUSE_LOCATION (c), | |
13362 | integer_type_node, | |
13363 | OMP_CLAUSE_WAIT_EXPR (c))); | |
13364 | num_waits++; | |
13365 | } | |
13366 | ||
13367 | if (!tagging || num_waits) | |
13368 | { | |
13369 | tree len; | |
13370 | ||
13371 | /* Now that we know the number, update the placeholder. */ | |
13372 | if (tagging) | |
13373 | len = oacc_launch_pack (GOMP_LAUNCH_WAIT, NULL_TREE, num_waits); | |
13374 | else | |
13375 | len = build_int_cst (integer_type_node, num_waits); | |
13376 | len = fold_convert_loc (gimple_location (entry_stmt), | |
13377 | unsigned_type_node, len); | |
13378 | args[t_wait_idx] = len; | |
41dbbb37 TS |
13379 | } |
13380 | } | |
13381 | break; | |
13382 | default: | |
13383 | gcc_unreachable (); | |
acf0174b | 13384 | } |
3e32ee19 NS |
13385 | if (tagging) |
13386 | /* Push terminal marker - zero. */ | |
13387 | args.safe_push (oacc_launch_pack (0, NULL_TREE, 0)); | |
41dbbb37 | 13388 | |
9410d9b2 | 13389 | g = gimple_build_call_vec (builtin_decl_explicit (start_ix), args); |
acf0174b JJ |
13390 | gimple_set_location (g, gimple_location (entry_stmt)); |
13391 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
41dbbb37 | 13392 | if (!offloaded) |
acf0174b JJ |
13393 | { |
13394 | g = gsi_stmt (gsi); | |
13395 | gcc_assert (g && gimple_code (g) == GIMPLE_OMP_TARGET); | |
13396 | gsi_remove (&gsi, true); | |
13397 | } | |
d9a6bd32 | 13398 | if (data_region && region->exit) |
acf0174b JJ |
13399 | { |
13400 | gsi = gsi_last_bb (region->exit); | |
13401 | g = gsi_stmt (gsi); | |
13402 | gcc_assert (g && gimple_code (g) == GIMPLE_OMP_RETURN); | |
13403 | gsi_remove (&gsi, true); | |
13404 | } | |
13405 | } | |
13406 | ||
b2b40051 MJ |
13407 | /* Expand KFOR loop as a GPGPU kernel, i.e. as a body only with iteration |
13408 | variable derived from the thread number. */ | |
50674e96 DN |
13409 | |
13410 | static void | |
b2b40051 | 13411 | grid_expand_omp_for_loop (struct omp_region *kfor) |
50674e96 | 13412 | { |
b2b40051 MJ |
13413 | tree t, threadid; |
13414 | tree type, itype; | |
13415 | gimple_stmt_iterator gsi; | |
13416 | tree n1, step; | |
13417 | struct omp_for_data fd; | |
b357f682 | 13418 | |
b2b40051 MJ |
13419 | gomp_for *for_stmt = as_a <gomp_for *> (last_stmt (kfor->entry)); |
13420 | gcc_checking_assert (gimple_omp_for_kind (for_stmt) | |
13421 | == GF_OMP_FOR_KIND_GRID_LOOP); | |
13422 | basic_block body_bb = FALLTHRU_EDGE (kfor->entry)->dest; | |
068e1875 | 13423 | |
b2b40051 MJ |
13424 | gcc_assert (gimple_omp_for_collapse (for_stmt) == 1); |
13425 | gcc_assert (kfor->cont); | |
13426 | extract_omp_for_data (for_stmt, &fd, NULL); | |
acf0174b | 13427 | |
b2b40051 MJ |
13428 | itype = type = TREE_TYPE (fd.loop.v); |
13429 | if (POINTER_TYPE_P (type)) | |
13430 | itype = signed_type_for (type); | |
50674e96 | 13431 | |
b2b40051 | 13432 | gsi = gsi_start_bb (body_bb); |
b357f682 | 13433 | |
b2b40051 MJ |
13434 | n1 = fd.loop.n1; |
13435 | step = fd.loop.step; | |
13436 | n1 = force_gimple_operand_gsi (&gsi, fold_convert (type, n1), | |
13437 | true, NULL_TREE, true, GSI_SAME_STMT); | |
13438 | step = force_gimple_operand_gsi (&gsi, fold_convert (itype, step), | |
13439 | true, NULL_TREE, true, GSI_SAME_STMT); | |
13440 | threadid = build_call_expr (builtin_decl_explicit | |
13441 | (BUILT_IN_OMP_GET_THREAD_NUM), 0); | |
13442 | threadid = fold_convert (itype, threadid); | |
13443 | threadid = force_gimple_operand_gsi (&gsi, threadid, true, NULL_TREE, | |
13444 | true, GSI_SAME_STMT); | |
a68ab351 | 13445 | |
b2b40051 MJ |
13446 | tree startvar = fd.loop.v; |
13447 | t = fold_build2 (MULT_EXPR, itype, threadid, step); | |
13448 | if (POINTER_TYPE_P (type)) | |
13449 | t = fold_build_pointer_plus (n1, t); | |
13450 | else | |
13451 | t = fold_build2 (PLUS_EXPR, type, t, n1); | |
13452 | t = fold_convert (type, t); | |
13453 | t = force_gimple_operand_gsi (&gsi, t, | |
13454 | DECL_P (startvar) | |
13455 | && TREE_ADDRESSABLE (startvar), | |
13456 | NULL_TREE, true, GSI_SAME_STMT); | |
13457 | gassign *assign_stmt = gimple_build_assign (startvar, t); | |
13458 | gsi_insert_before (&gsi, assign_stmt, GSI_SAME_STMT); | |
50674e96 | 13459 | |
b2b40051 MJ |
13460 | /* Remove the omp for statement */ |
13461 | gsi = gsi_last_bb (kfor->entry); | |
13462 | gsi_remove (&gsi, true); | |
50674e96 | 13463 | |
b2b40051 MJ |
13464 | /* Remove the GIMPLE_OMP_CONTINUE statement. */ |
13465 | gsi = gsi_last_bb (kfor->cont); | |
13466 | gcc_assert (!gsi_end_p (gsi) | |
13467 | && gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_CONTINUE); | |
13468 | gsi_remove (&gsi, true); | |
50674e96 | 13469 | |
b2b40051 MJ |
13470 | /* Replace the GIMPLE_OMP_RETURN with a real return. */ |
13471 | gsi = gsi_last_bb (kfor->exit); | |
13472 | gcc_assert (!gsi_end_p (gsi) | |
13473 | && gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_RETURN); | |
13474 | gsi_remove (&gsi, true); | |
50674e96 | 13475 | |
b2b40051 MJ |
13476 | /* Fixup the much simpler CFG. */ |
13477 | remove_edge (find_edge (kfor->cont, body_bb)); | |
50674e96 | 13478 | |
b2b40051 MJ |
13479 | if (kfor->cont != body_bb) |
13480 | set_immediate_dominator (CDI_DOMINATORS, kfor->cont, body_bb); | |
13481 | set_immediate_dominator (CDI_DOMINATORS, kfor->exit, kfor->cont); | |
13482 | } | |
a509ebb5 | 13483 | |
b2b40051 MJ |
13484 | /* Structure passed to grid_remap_kernel_arg_accesses so that it can remap |
13485 | argument_decls. */ | |
13486 | ||
13487 | struct grid_arg_decl_map | |
13488 | { | |
13489 | tree old_arg; | |
13490 | tree new_arg; | |
13491 | }; | |
13492 | ||
13493 | /* Invoked through walk_gimple_op, will remap all PARM_DECLs to the ones | |
13494 | pertaining to kernel function. */ | |
13495 | ||
13496 | static tree | |
13497 | grid_remap_kernel_arg_accesses (tree *tp, int *walk_subtrees, void *data) | |
13498 | { | |
13499 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data; | |
13500 | struct grid_arg_decl_map *adm = (struct grid_arg_decl_map *) wi->info; | |
13501 | tree t = *tp; | |
13502 | ||
13503 | if (t == adm->old_arg) | |
13504 | *tp = adm->new_arg; | |
13505 | *walk_subtrees = !TYPE_P (t) && !DECL_P (t); | |
13506 | return NULL_TREE; | |
13507 | } | |
13508 | ||
13509 | static void expand_omp (struct omp_region *region); | |
13510 | ||
13511 | /* If TARGET region contains a kernel body for loop, remove its region from the | |
13512 | TARGET and expand it in GPGPU kernel fashion. */ | |
13513 | ||
13514 | static void | |
13515 | grid_expand_target_grid_body (struct omp_region *target) | |
13516 | { | |
13517 | if (!hsa_gen_requested_p ()) | |
13518 | return; | |
13519 | ||
13520 | gomp_target *tgt_stmt = as_a <gomp_target *> (last_stmt (target->entry)); | |
13521 | struct omp_region **pp; | |
13522 | ||
13523 | for (pp = &target->inner; *pp; pp = &(*pp)->next) | |
13524 | if ((*pp)->type == GIMPLE_OMP_GRID_BODY) | |
13525 | break; | |
13526 | ||
13527 | struct omp_region *gpukernel = *pp; | |
13528 | ||
13529 | tree orig_child_fndecl = gimple_omp_target_child_fn (tgt_stmt); | |
13530 | if (!gpukernel) | |
13531 | { | |
13532 | /* HSA cannot handle OACC stuff. */ | |
13533 | if (gimple_omp_target_kind (tgt_stmt) != GF_OMP_TARGET_KIND_REGION) | |
13534 | return; | |
13535 | gcc_checking_assert (orig_child_fndecl); | |
13536 | gcc_assert (!find_omp_clause (gimple_omp_target_clauses (tgt_stmt), | |
13537 | OMP_CLAUSE__GRIDDIM_)); | |
13538 | cgraph_node *n = cgraph_node::get (orig_child_fndecl); | |
13539 | ||
13540 | hsa_register_kernel (n); | |
13541 | return; | |
13542 | } | |
13543 | ||
13544 | gcc_assert (find_omp_clause (gimple_omp_target_clauses (tgt_stmt), | |
13545 | OMP_CLAUSE__GRIDDIM_)); | |
13546 | tree inside_block = gimple_block (first_stmt (single_succ (gpukernel->entry))); | |
13547 | *pp = gpukernel->next; | |
13548 | for (pp = &gpukernel->inner; *pp; pp = &(*pp)->next) | |
13549 | if ((*pp)->type == GIMPLE_OMP_FOR) | |
13550 | break; | |
13551 | ||
13552 | struct omp_region *kfor = *pp; | |
13553 | gcc_assert (kfor); | |
13554 | gcc_assert (gimple_omp_for_kind (last_stmt ((kfor)->entry)) | |
13555 | == GF_OMP_FOR_KIND_GRID_LOOP); | |
13556 | *pp = kfor->next; | |
13557 | if (kfor->inner) | |
13558 | expand_omp (kfor->inner); | |
13559 | if (gpukernel->inner) | |
13560 | expand_omp (gpukernel->inner); | |
13561 | ||
13562 | tree kern_fndecl = copy_node (orig_child_fndecl); | |
13563 | DECL_NAME (kern_fndecl) = clone_function_name (kern_fndecl, "kernel"); | |
13564 | SET_DECL_ASSEMBLER_NAME (kern_fndecl, DECL_NAME (kern_fndecl)); | |
13565 | tree tgtblock = gimple_block (tgt_stmt); | |
13566 | tree fniniblock = make_node (BLOCK); | |
13567 | BLOCK_ABSTRACT_ORIGIN (fniniblock) = tgtblock; | |
13568 | BLOCK_SOURCE_LOCATION (fniniblock) = BLOCK_SOURCE_LOCATION (tgtblock); | |
13569 | BLOCK_SOURCE_END_LOCATION (fniniblock) = BLOCK_SOURCE_END_LOCATION (tgtblock); | |
13570 | DECL_INITIAL (kern_fndecl) = fniniblock; | |
13571 | push_struct_function (kern_fndecl); | |
13572 | cfun->function_end_locus = gimple_location (tgt_stmt); | |
13573 | pop_cfun (); | |
13574 | ||
13575 | tree old_parm_decl = DECL_ARGUMENTS (kern_fndecl); | |
13576 | gcc_assert (!DECL_CHAIN (old_parm_decl)); | |
13577 | tree new_parm_decl = copy_node (DECL_ARGUMENTS (kern_fndecl)); | |
13578 | DECL_CONTEXT (new_parm_decl) = kern_fndecl; | |
13579 | DECL_ARGUMENTS (kern_fndecl) = new_parm_decl; | |
13580 | struct function *kern_cfun = DECL_STRUCT_FUNCTION (kern_fndecl); | |
13581 | kern_cfun->curr_properties = cfun->curr_properties; | |
13582 | ||
13583 | remove_edge (BRANCH_EDGE (kfor->entry)); | |
13584 | grid_expand_omp_for_loop (kfor); | |
13585 | ||
13586 | /* Remove the omp for statement */ | |
13587 | gimple_stmt_iterator gsi = gsi_last_bb (gpukernel->entry); | |
13588 | gsi_remove (&gsi, true); | |
13589 | /* Replace the GIMPLE_OMP_RETURN at the end of the kernel region with a real | |
13590 | return. */ | |
13591 | gsi = gsi_last_bb (gpukernel->exit); | |
13592 | gcc_assert (!gsi_end_p (gsi) | |
13593 | && gimple_code (gsi_stmt (gsi)) == GIMPLE_OMP_RETURN); | |
13594 | gimple *ret_stmt = gimple_build_return (NULL); | |
13595 | gsi_insert_after (&gsi, ret_stmt, GSI_SAME_STMT); | |
13596 | gsi_remove (&gsi, true); | |
13597 | ||
13598 | /* Statements in the first BB in the target construct have been produced by | |
13599 | target lowering and must be copied inside the GPUKERNEL, with the two | |
13600 | exceptions of the first OMP statement and the OMP_DATA assignment | |
13601 | statement. */ | |
13602 | gsi = gsi_start_bb (single_succ (gpukernel->entry)); | |
13603 | tree data_arg = gimple_omp_target_data_arg (tgt_stmt); | |
13604 | tree sender = data_arg ? TREE_VEC_ELT (data_arg, 0) : NULL; | |
13605 | for (gimple_stmt_iterator tsi = gsi_start_bb (single_succ (target->entry)); | |
13606 | !gsi_end_p (tsi); gsi_next (&tsi)) | |
13607 | { | |
13608 | gimple *stmt = gsi_stmt (tsi); | |
13609 | if (is_gimple_omp (stmt)) | |
13610 | break; | |
13611 | if (sender | |
13612 | && is_gimple_assign (stmt) | |
13613 | && TREE_CODE (gimple_assign_rhs1 (stmt)) == ADDR_EXPR | |
13614 | && TREE_OPERAND (gimple_assign_rhs1 (stmt), 0) == sender) | |
13615 | continue; | |
13616 | gimple *copy = gimple_copy (stmt); | |
13617 | gsi_insert_before (&gsi, copy, GSI_SAME_STMT); | |
13618 | gimple_set_block (copy, fniniblock); | |
13619 | } | |
13620 | ||
13621 | move_sese_region_to_fn (kern_cfun, single_succ (gpukernel->entry), | |
13622 | gpukernel->exit, inside_block); | |
13623 | ||
13624 | cgraph_node *kcn = cgraph_node::get_create (kern_fndecl); | |
13625 | kcn->mark_force_output (); | |
13626 | cgraph_node *orig_child = cgraph_node::get (orig_child_fndecl); | |
13627 | ||
13628 | hsa_register_kernel (kcn, orig_child); | |
13629 | ||
13630 | cgraph_node::add_new_function (kern_fndecl, true); | |
13631 | push_cfun (kern_cfun); | |
13632 | cgraph_edge::rebuild_edges (); | |
13633 | ||
13634 | /* Re-map any mention of the PARM_DECL of the original function to the | |
13635 | PARM_DECL of the new one. | |
13636 | ||
13637 | TODO: It would be great if lowering produced references into the GPU | |
13638 | kernel decl straight away and we did not have to do this. */ | |
13639 | struct grid_arg_decl_map adm; | |
13640 | adm.old_arg = old_parm_decl; | |
13641 | adm.new_arg = new_parm_decl; | |
13642 | basic_block bb; | |
13643 | FOR_EACH_BB_FN (bb, kern_cfun) | |
13644 | { | |
13645 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
13646 | { | |
13647 | gimple *stmt = gsi_stmt (gsi); | |
13648 | struct walk_stmt_info wi; | |
13649 | memset (&wi, 0, sizeof (wi)); | |
13650 | wi.info = &adm; | |
13651 | walk_gimple_op (stmt, grid_remap_kernel_arg_accesses, &wi); | |
13652 | } | |
13653 | } | |
13654 | pop_cfun (); | |
13655 | ||
13656 | return; | |
13657 | } | |
13658 | ||
13659 | /* Expand the parallel region tree rooted at REGION. Expansion | |
13660 | proceeds in depth-first order. Innermost regions are expanded | |
13661 | first. This way, parallel regions that require a new function to | |
13662 | be created (e.g., GIMPLE_OMP_PARALLEL) can be expanded without having any | |
13663 | internal dependencies in their body. */ | |
13664 | ||
13665 | static void | |
13666 | expand_omp (struct omp_region *region) | |
13667 | { | |
13668 | omp_any_child_fn_dumped = false; | |
13669 | while (region) | |
13670 | { | |
13671 | location_t saved_location; | |
13672 | gimple *inner_stmt = NULL; | |
13673 | ||
13674 | /* First, determine whether this is a combined parallel+workshare | |
13675 | region. */ | |
13676 | if (region->type == GIMPLE_OMP_PARALLEL) | |
13677 | determine_parallel_type (region); | |
13678 | else if (region->type == GIMPLE_OMP_TARGET) | |
13679 | grid_expand_target_grid_body (region); | |
13680 | ||
13681 | if (region->type == GIMPLE_OMP_FOR | |
13682 | && gimple_omp_for_combined_p (last_stmt (region->entry))) | |
13683 | inner_stmt = last_stmt (region->inner->entry); | |
13684 | ||
13685 | if (region->inner) | |
13686 | expand_omp (region->inner); | |
13687 | ||
13688 | saved_location = input_location; | |
13689 | if (gimple_has_location (last_stmt (region->entry))) | |
13690 | input_location = gimple_location (last_stmt (region->entry)); | |
13691 | ||
13692 | switch (region->type) | |
13693 | { | |
13694 | case GIMPLE_OMP_PARALLEL: | |
13695 | case GIMPLE_OMP_TASK: | |
13696 | expand_omp_taskreg (region); | |
13697 | break; | |
13698 | ||
13699 | case GIMPLE_OMP_FOR: | |
13700 | expand_omp_for (region, inner_stmt); | |
13701 | break; | |
13702 | ||
13703 | case GIMPLE_OMP_SECTIONS: | |
13704 | expand_omp_sections (region); | |
13705 | break; | |
13706 | ||
13707 | case GIMPLE_OMP_SECTION: | |
13708 | /* Individual omp sections are handled together with their | |
13709 | parent GIMPLE_OMP_SECTIONS region. */ | |
13710 | break; | |
13711 | ||
13712 | case GIMPLE_OMP_SINGLE: | |
13713 | expand_omp_single (region); | |
13714 | break; | |
13715 | ||
13716 | case GIMPLE_OMP_ORDERED: | |
13717 | { | |
13718 | gomp_ordered *ord_stmt | |
13719 | = as_a <gomp_ordered *> (last_stmt (region->entry)); | |
13720 | if (find_omp_clause (gimple_omp_ordered_clauses (ord_stmt), | |
13721 | OMP_CLAUSE_DEPEND)) | |
13722 | { | |
13723 | /* We'll expand these when expanding corresponding | |
13724 | worksharing region with ordered(n) clause. */ | |
13725 | gcc_assert (region->outer | |
13726 | && region->outer->type == GIMPLE_OMP_FOR); | |
13727 | region->ord_stmt = ord_stmt; | |
13728 | break; | |
13729 | } | |
13730 | } | |
13731 | /* FALLTHRU */ | |
13732 | case GIMPLE_OMP_MASTER: | |
13733 | case GIMPLE_OMP_TASKGROUP: | |
13734 | case GIMPLE_OMP_CRITICAL: | |
13735 | case GIMPLE_OMP_TEAMS: | |
13736 | expand_omp_synch (region); | |
13737 | break; | |
13738 | ||
13739 | case GIMPLE_OMP_ATOMIC_LOAD: | |
13740 | expand_omp_atomic (region); | |
13741 | break; | |
13742 | ||
13743 | case GIMPLE_OMP_TARGET: | |
acf0174b JJ |
13744 | expand_omp_target (region); |
13745 | break; | |
13746 | ||
777f7f9a RH |
13747 | default: |
13748 | gcc_unreachable (); | |
13749 | } | |
8d9c1aec | 13750 | |
b357f682 | 13751 | input_location = saved_location; |
50674e96 DN |
13752 | region = region->next; |
13753 | } | |
e01d41e5 JJ |
13754 | if (omp_any_child_fn_dumped) |
13755 | { | |
13756 | if (dump_file) | |
13757 | dump_function_header (dump_file, current_function_decl, dump_flags); | |
13758 | omp_any_child_fn_dumped = false; | |
13759 | } | |
50674e96 DN |
13760 | } |
13761 | ||
13762 | ||
13763 | /* Helper for build_omp_regions. Scan the dominator tree starting at | |
5f40b3cb ZD |
13764 | block BB. PARENT is the region that contains BB. If SINGLE_TREE is |
13765 | true, the function ends once a single tree is built (otherwise, whole | |
13766 | forest of OMP constructs may be built). */ | |
50674e96 DN |
13767 | |
13768 | static void | |
5f40b3cb ZD |
13769 | build_omp_regions_1 (basic_block bb, struct omp_region *parent, |
13770 | bool single_tree) | |
50674e96 | 13771 | { |
726a989a | 13772 | gimple_stmt_iterator gsi; |
355fe088 | 13773 | gimple *stmt; |
50674e96 DN |
13774 | basic_block son; |
13775 | ||
726a989a RB |
13776 | gsi = gsi_last_bb (bb); |
13777 | if (!gsi_end_p (gsi) && is_gimple_omp (gsi_stmt (gsi))) | |
50674e96 DN |
13778 | { |
13779 | struct omp_region *region; | |
726a989a | 13780 | enum gimple_code code; |
50674e96 | 13781 | |
726a989a RB |
13782 | stmt = gsi_stmt (gsi); |
13783 | code = gimple_code (stmt); | |
13784 | if (code == GIMPLE_OMP_RETURN) | |
50674e96 DN |
13785 | { |
13786 | /* STMT is the return point out of region PARENT. Mark it | |
13787 | as the exit point and make PARENT the immediately | |
13788 | enclosing region. */ | |
13789 | gcc_assert (parent); | |
13790 | region = parent; | |
777f7f9a | 13791 | region->exit = bb; |
50674e96 | 13792 | parent = parent->outer; |
50674e96 | 13793 | } |
726a989a | 13794 | else if (code == GIMPLE_OMP_ATOMIC_STORE) |
a509ebb5 | 13795 | { |
726a989a RB |
13796 | /* GIMPLE_OMP_ATOMIC_STORE is analoguous to |
13797 | GIMPLE_OMP_RETURN, but matches with | |
13798 | GIMPLE_OMP_ATOMIC_LOAD. */ | |
a509ebb5 | 13799 | gcc_assert (parent); |
726a989a | 13800 | gcc_assert (parent->type == GIMPLE_OMP_ATOMIC_LOAD); |
a509ebb5 RL |
13801 | region = parent; |
13802 | region->exit = bb; | |
13803 | parent = parent->outer; | |
13804 | } | |
726a989a | 13805 | else if (code == GIMPLE_OMP_CONTINUE) |
777f7f9a RH |
13806 | { |
13807 | gcc_assert (parent); | |
13808 | parent->cont = bb; | |
13809 | } | |
726a989a | 13810 | else if (code == GIMPLE_OMP_SECTIONS_SWITCH) |
e5c95afe | 13811 | { |
726a989a RB |
13812 | /* GIMPLE_OMP_SECTIONS_SWITCH is part of |
13813 | GIMPLE_OMP_SECTIONS, and we do nothing for it. */ | |
e5c95afe | 13814 | } |
50674e96 DN |
13815 | else |
13816 | { | |
777f7f9a | 13817 | region = new_omp_region (bb, code, parent); |
41dbbb37 TS |
13818 | /* Otherwise... */ |
13819 | if (code == GIMPLE_OMP_TARGET) | |
13820 | { | |
13821 | switch (gimple_omp_target_kind (stmt)) | |
13822 | { | |
13823 | case GF_OMP_TARGET_KIND_REGION: | |
13824 | case GF_OMP_TARGET_KIND_DATA: | |
13825 | case GF_OMP_TARGET_KIND_OACC_PARALLEL: | |
13826 | case GF_OMP_TARGET_KIND_OACC_KERNELS: | |
13827 | case GF_OMP_TARGET_KIND_OACC_DATA: | |
37d5ad46 | 13828 | case GF_OMP_TARGET_KIND_OACC_HOST_DATA: |
41dbbb37 TS |
13829 | break; |
13830 | case GF_OMP_TARGET_KIND_UPDATE: | |
d9a6bd32 JJ |
13831 | case GF_OMP_TARGET_KIND_ENTER_DATA: |
13832 | case GF_OMP_TARGET_KIND_EXIT_DATA: | |
41dbbb37 TS |
13833 | case GF_OMP_TARGET_KIND_OACC_UPDATE: |
13834 | case GF_OMP_TARGET_KIND_OACC_ENTER_EXIT_DATA: | |
6e232ba4 | 13835 | case GF_OMP_TARGET_KIND_OACC_DECLARE: |
41dbbb37 TS |
13836 | /* ..., other than for those stand-alone directives... */ |
13837 | region = NULL; | |
13838 | break; | |
13839 | default: | |
13840 | gcc_unreachable (); | |
13841 | } | |
13842 | } | |
d9a6bd32 JJ |
13843 | else if (code == GIMPLE_OMP_ORDERED |
13844 | && find_omp_clause (gimple_omp_ordered_clauses | |
13845 | (as_a <gomp_ordered *> (stmt)), | |
13846 | OMP_CLAUSE_DEPEND)) | |
13847 | /* #pragma omp ordered depend is also just a stand-alone | |
13848 | directive. */ | |
13849 | region = NULL; | |
41dbbb37 TS |
13850 | /* ..., this directive becomes the parent for a new region. */ |
13851 | if (region) | |
13852 | parent = region; | |
50674e96 | 13853 | } |
50674e96 DN |
13854 | } |
13855 | ||
5f40b3cb ZD |
13856 | if (single_tree && !parent) |
13857 | return; | |
13858 | ||
50674e96 DN |
13859 | for (son = first_dom_son (CDI_DOMINATORS, bb); |
13860 | son; | |
13861 | son = next_dom_son (CDI_DOMINATORS, son)) | |
5f40b3cb ZD |
13862 | build_omp_regions_1 (son, parent, single_tree); |
13863 | } | |
13864 | ||
13865 | /* Builds the tree of OMP regions rooted at ROOT, storing it to | |
13866 | root_omp_region. */ | |
13867 | ||
13868 | static void | |
13869 | build_omp_regions_root (basic_block root) | |
13870 | { | |
13871 | gcc_assert (root_omp_region == NULL); | |
13872 | build_omp_regions_1 (root, NULL, true); | |
13873 | gcc_assert (root_omp_region != NULL); | |
50674e96 DN |
13874 | } |
13875 | ||
5f40b3cb ZD |
13876 | /* Expands omp construct (and its subconstructs) starting in HEAD. */ |
13877 | ||
13878 | void | |
13879 | omp_expand_local (basic_block head) | |
13880 | { | |
13881 | build_omp_regions_root (head); | |
13882 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
13883 | { | |
13884 | fprintf (dump_file, "\nOMP region tree\n\n"); | |
13885 | dump_omp_region (dump_file, root_omp_region, 0); | |
13886 | fprintf (dump_file, "\n"); | |
13887 | } | |
13888 | ||
13889 | remove_exit_barriers (root_omp_region); | |
13890 | expand_omp (root_omp_region); | |
13891 | ||
13892 | free_omp_regions (); | |
13893 | } | |
50674e96 DN |
13894 | |
13895 | /* Scan the CFG and build a tree of OMP regions. Return the root of | |
13896 | the OMP region tree. */ | |
13897 | ||
13898 | static void | |
13899 | build_omp_regions (void) | |
13900 | { | |
777f7f9a | 13901 | gcc_assert (root_omp_region == NULL); |
50674e96 | 13902 | calculate_dominance_info (CDI_DOMINATORS); |
fefa31b5 | 13903 | build_omp_regions_1 (ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, false); |
50674e96 DN |
13904 | } |
13905 | ||
50674e96 DN |
13906 | /* Main entry point for expanding OMP-GIMPLE into runtime calls. */ |
13907 | ||
c2924966 | 13908 | static unsigned int |
50674e96 DN |
13909 | execute_expand_omp (void) |
13910 | { | |
13911 | build_omp_regions (); | |
13912 | ||
777f7f9a RH |
13913 | if (!root_omp_region) |
13914 | return 0; | |
50674e96 | 13915 | |
777f7f9a RH |
13916 | if (dump_file) |
13917 | { | |
13918 | fprintf (dump_file, "\nOMP region tree\n\n"); | |
13919 | dump_omp_region (dump_file, root_omp_region, 0); | |
13920 | fprintf (dump_file, "\n"); | |
50674e96 | 13921 | } |
777f7f9a RH |
13922 | |
13923 | remove_exit_barriers (root_omp_region); | |
13924 | ||
13925 | expand_omp (root_omp_region); | |
13926 | ||
b2b29377 | 13927 | if (flag_checking && !loops_state_satisfies_p (LOOPS_NEED_FIXUP)) |
e67d7a1e | 13928 | verify_loop_structure (); |
777f7f9a RH |
13929 | cleanup_tree_cfg (); |
13930 | ||
13931 | free_omp_regions (); | |
13932 | ||
c2924966 | 13933 | return 0; |
50674e96 DN |
13934 | } |
13935 | ||
917948d3 ZD |
13936 | /* OMP expansion -- the default pass, run before creation of SSA form. */ |
13937 | ||
17795822 TS |
13938 | namespace { |
13939 | ||
13940 | const pass_data pass_data_expand_omp = | |
27a4cd48 DM |
13941 | { |
13942 | GIMPLE_PASS, /* type */ | |
13943 | "ompexp", /* name */ | |
13944 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
13945 | TV_NONE, /* tv_id */ |
13946 | PROP_gimple_any, /* properties_required */ | |
18751894 | 13947 | PROP_gimple_eomp, /* properties_provided */ |
27a4cd48 DM |
13948 | 0, /* properties_destroyed */ |
13949 | 0, /* todo_flags_start */ | |
13950 | 0, /* todo_flags_finish */ | |
50674e96 | 13951 | }; |
27a4cd48 | 13952 | |
17795822 | 13953 | class pass_expand_omp : public gimple_opt_pass |
27a4cd48 DM |
13954 | { |
13955 | public: | |
c3284718 RS |
13956 | pass_expand_omp (gcc::context *ctxt) |
13957 | : gimple_opt_pass (pass_data_expand_omp, ctxt) | |
27a4cd48 DM |
13958 | {} |
13959 | ||
13960 | /* opt_pass methods: */ | |
18751894 | 13961 | virtual unsigned int execute (function *) |
1a3d085c | 13962 | { |
41dbbb37 TS |
13963 | bool gate = ((flag_cilkplus != 0 || flag_openacc != 0 || flag_openmp != 0 |
13964 | || flag_openmp_simd != 0) | |
13965 | && !seen_error ()); | |
1a3d085c | 13966 | |
18751894 | 13967 | /* This pass always runs, to provide PROP_gimple_eomp. |
41dbbb37 | 13968 | But often, there is nothing to do. */ |
18751894 TV |
13969 | if (!gate) |
13970 | return 0; | |
13971 | ||
13972 | return execute_expand_omp (); | |
13973 | } | |
27a4cd48 DM |
13974 | |
13975 | }; // class pass_expand_omp | |
13976 | ||
17795822 TS |
13977 | } // anon namespace |
13978 | ||
27a4cd48 DM |
13979 | gimple_opt_pass * |
13980 | make_pass_expand_omp (gcc::context *ctxt) | |
13981 | { | |
13982 | return new pass_expand_omp (ctxt); | |
13983 | } | |
18751894 | 13984 | |
17795822 TS |
13985 | namespace { |
13986 | ||
13987 | const pass_data pass_data_expand_omp_ssa = | |
18751894 TV |
13988 | { |
13989 | GIMPLE_PASS, /* type */ | |
13990 | "ompexpssa", /* name */ | |
13991 | OPTGROUP_NONE, /* optinfo_flags */ | |
13992 | TV_NONE, /* tv_id */ | |
13993 | PROP_cfg | PROP_ssa, /* properties_required */ | |
13994 | PROP_gimple_eomp, /* properties_provided */ | |
13995 | 0, /* properties_destroyed */ | |
13996 | 0, /* todo_flags_start */ | |
13997 | TODO_cleanup_cfg | TODO_rebuild_alias, /* todo_flags_finish */ | |
13998 | }; | |
13999 | ||
17795822 | 14000 | class pass_expand_omp_ssa : public gimple_opt_pass |
18751894 TV |
14001 | { |
14002 | public: | |
14003 | pass_expand_omp_ssa (gcc::context *ctxt) | |
14004 | : gimple_opt_pass (pass_data_expand_omp_ssa, ctxt) | |
14005 | {} | |
14006 | ||
14007 | /* opt_pass methods: */ | |
14008 | virtual bool gate (function *fun) | |
14009 | { | |
14010 | return !(fun->curr_properties & PROP_gimple_eomp); | |
14011 | } | |
14012 | virtual unsigned int execute (function *) { return execute_expand_omp (); } | |
b5f34b42 | 14013 | opt_pass * clone () { return new pass_expand_omp_ssa (m_ctxt); } |
18751894 TV |
14014 | |
14015 | }; // class pass_expand_omp_ssa | |
14016 | ||
17795822 TS |
14017 | } // anon namespace |
14018 | ||
18751894 TV |
14019 | gimple_opt_pass * |
14020 | make_pass_expand_omp_ssa (gcc::context *ctxt) | |
14021 | { | |
14022 | return new pass_expand_omp_ssa (ctxt); | |
14023 | } | |
50674e96 | 14024 | \f |
41dbbb37 TS |
14025 | /* Routines to lower OMP directives into OMP-GIMPLE. */ |
14026 | ||
acf0174b JJ |
14027 | /* If ctx is a worksharing context inside of a cancellable parallel |
14028 | region and it isn't nowait, add lhs to its GIMPLE_OMP_RETURN | |
14029 | and conditional branch to parallel's cancel_label to handle | |
14030 | cancellation in the implicit barrier. */ | |
14031 | ||
14032 | static void | |
14033 | maybe_add_implicit_barrier_cancel (omp_context *ctx, gimple_seq *body) | |
14034 | { | |
355fe088 | 14035 | gimple *omp_return = gimple_seq_last_stmt (*body); |
acf0174b JJ |
14036 | gcc_assert (gimple_code (omp_return) == GIMPLE_OMP_RETURN); |
14037 | if (gimple_omp_return_nowait_p (omp_return)) | |
14038 | return; | |
14039 | if (ctx->outer | |
14040 | && gimple_code (ctx->outer->stmt) == GIMPLE_OMP_PARALLEL | |
14041 | && ctx->outer->cancellable) | |
14042 | { | |
dd2fc525 JJ |
14043 | tree fndecl = builtin_decl_explicit (BUILT_IN_GOMP_CANCEL); |
14044 | tree c_bool_type = TREE_TYPE (TREE_TYPE (fndecl)); | |
b731b390 | 14045 | tree lhs = create_tmp_var (c_bool_type); |
acf0174b JJ |
14046 | gimple_omp_return_set_lhs (omp_return, lhs); |
14047 | tree fallthru_label = create_artificial_label (UNKNOWN_LOCATION); | |
355fe088 | 14048 | gimple *g = gimple_build_cond (NE_EXPR, lhs, |
dd2fc525 JJ |
14049 | fold_convert (c_bool_type, |
14050 | boolean_false_node), | |
acf0174b JJ |
14051 | ctx->outer->cancel_label, fallthru_label); |
14052 | gimple_seq_add_stmt (body, g); | |
14053 | gimple_seq_add_stmt (body, gimple_build_label (fallthru_label)); | |
14054 | } | |
14055 | } | |
14056 | ||
726a989a RB |
14057 | /* Lower the OpenMP sections directive in the current statement in GSI_P. |
14058 | CTX is the enclosing OMP context for the current statement. */ | |
50674e96 DN |
14059 | |
14060 | static void | |
726a989a | 14061 | lower_omp_sections (gimple_stmt_iterator *gsi_p, omp_context *ctx) |
50674e96 | 14062 | { |
726a989a RB |
14063 | tree block, control; |
14064 | gimple_stmt_iterator tgsi; | |
538dd0b7 | 14065 | gomp_sections *stmt; |
355fe088 | 14066 | gimple *t; |
538dd0b7 | 14067 | gbind *new_stmt, *bind; |
355a7673 | 14068 | gimple_seq ilist, dlist, olist, new_body; |
50674e96 | 14069 | |
538dd0b7 | 14070 | stmt = as_a <gomp_sections *> (gsi_stmt (*gsi_p)); |
50674e96 | 14071 | |
45852dcc | 14072 | push_gimplify_context (); |
50674e96 DN |
14073 | |
14074 | dlist = NULL; | |
14075 | ilist = NULL; | |
726a989a | 14076 | lower_rec_input_clauses (gimple_omp_sections_clauses (stmt), |
acf0174b | 14077 | &ilist, &dlist, ctx, NULL); |
50674e96 | 14078 | |
355a7673 MM |
14079 | new_body = gimple_omp_body (stmt); |
14080 | gimple_omp_set_body (stmt, NULL); | |
14081 | tgsi = gsi_start (new_body); | |
14082 | for (; !gsi_end_p (tgsi); gsi_next (&tgsi)) | |
50674e96 DN |
14083 | { |
14084 | omp_context *sctx; | |
355fe088 | 14085 | gimple *sec_start; |
50674e96 | 14086 | |
726a989a | 14087 | sec_start = gsi_stmt (tgsi); |
50674e96 DN |
14088 | sctx = maybe_lookup_ctx (sec_start); |
14089 | gcc_assert (sctx); | |
14090 | ||
355a7673 MM |
14091 | lower_omp (gimple_omp_body_ptr (sec_start), sctx); |
14092 | gsi_insert_seq_after (&tgsi, gimple_omp_body (sec_start), | |
14093 | GSI_CONTINUE_LINKING); | |
726a989a | 14094 | gimple_omp_set_body (sec_start, NULL); |
50674e96 | 14095 | |
355a7673 | 14096 | if (gsi_one_before_end_p (tgsi)) |
50674e96 | 14097 | { |
726a989a RB |
14098 | gimple_seq l = NULL; |
14099 | lower_lastprivate_clauses (gimple_omp_sections_clauses (stmt), NULL, | |
50674e96 | 14100 | &l, ctx); |
355a7673 | 14101 | gsi_insert_seq_after (&tgsi, l, GSI_CONTINUE_LINKING); |
726a989a | 14102 | gimple_omp_section_set_last (sec_start); |
50674e96 | 14103 | } |
b8698a0f | 14104 | |
355a7673 MM |
14105 | gsi_insert_after (&tgsi, gimple_build_omp_return (false), |
14106 | GSI_CONTINUE_LINKING); | |
50674e96 | 14107 | } |
953ff289 DN |
14108 | |
14109 | block = make_node (BLOCK); | |
355a7673 | 14110 | bind = gimple_build_bind (NULL, new_body, block); |
953ff289 | 14111 | |
726a989a RB |
14112 | olist = NULL; |
14113 | lower_reduction_clauses (gimple_omp_sections_clauses (stmt), &olist, ctx); | |
50674e96 | 14114 | |
b357f682 | 14115 | block = make_node (BLOCK); |
726a989a | 14116 | new_stmt = gimple_build_bind (NULL, NULL, block); |
355a7673 | 14117 | gsi_replace (gsi_p, new_stmt, true); |
50674e96 | 14118 | |
b357f682 | 14119 | pop_gimplify_context (new_stmt); |
726a989a RB |
14120 | gimple_bind_append_vars (new_stmt, ctx->block_vars); |
14121 | BLOCK_VARS (block) = gimple_bind_vars (bind); | |
b357f682 JJ |
14122 | if (BLOCK_VARS (block)) |
14123 | TREE_USED (block) = 1; | |
14124 | ||
726a989a RB |
14125 | new_body = NULL; |
14126 | gimple_seq_add_seq (&new_body, ilist); | |
14127 | gimple_seq_add_stmt (&new_body, stmt); | |
14128 | gimple_seq_add_stmt (&new_body, gimple_build_omp_sections_switch ()); | |
14129 | gimple_seq_add_stmt (&new_body, bind); | |
777f7f9a | 14130 | |
e5c95afe | 14131 | control = create_tmp_var (unsigned_type_node, ".section"); |
726a989a RB |
14132 | t = gimple_build_omp_continue (control, control); |
14133 | gimple_omp_sections_set_control (stmt, control); | |
14134 | gimple_seq_add_stmt (&new_body, t); | |
777f7f9a | 14135 | |
726a989a | 14136 | gimple_seq_add_seq (&new_body, olist); |
acf0174b JJ |
14137 | if (ctx->cancellable) |
14138 | gimple_seq_add_stmt (&new_body, gimple_build_label (ctx->cancel_label)); | |
726a989a | 14139 | gimple_seq_add_seq (&new_body, dlist); |
50674e96 | 14140 | |
726a989a | 14141 | new_body = maybe_catch_exception (new_body); |
4a31b7ee | 14142 | |
726a989a RB |
14143 | t = gimple_build_omp_return |
14144 | (!!find_omp_clause (gimple_omp_sections_clauses (stmt), | |
14145 | OMP_CLAUSE_NOWAIT)); | |
14146 | gimple_seq_add_stmt (&new_body, t); | |
acf0174b | 14147 | maybe_add_implicit_barrier_cancel (ctx, &new_body); |
777f7f9a | 14148 | |
726a989a | 14149 | gimple_bind_set_body (new_stmt, new_body); |
953ff289 DN |
14150 | } |
14151 | ||
14152 | ||
50674e96 | 14153 | /* A subroutine of lower_omp_single. Expand the simple form of |
726a989a | 14154 | a GIMPLE_OMP_SINGLE, without a copyprivate clause: |
953ff289 DN |
14155 | |
14156 | if (GOMP_single_start ()) | |
14157 | BODY; | |
14158 | [ GOMP_barrier (); ] -> unless 'nowait' is present. | |
50674e96 DN |
14159 | |
14160 | FIXME. It may be better to delay expanding the logic of this until | |
14161 | pass_expand_omp. The expanded logic may make the job more difficult | |
14162 | to a synchronization analysis pass. */ | |
953ff289 DN |
14163 | |
14164 | static void | |
538dd0b7 | 14165 | lower_omp_single_simple (gomp_single *single_stmt, gimple_seq *pre_p) |
953ff289 | 14166 | { |
c2255bc4 AH |
14167 | location_t loc = gimple_location (single_stmt); |
14168 | tree tlabel = create_artificial_label (loc); | |
14169 | tree flabel = create_artificial_label (loc); | |
355fe088 | 14170 | gimple *call, *cond; |
726a989a RB |
14171 | tree lhs, decl; |
14172 | ||
e79983f4 | 14173 | decl = builtin_decl_explicit (BUILT_IN_GOMP_SINGLE_START); |
b731b390 | 14174 | lhs = create_tmp_var (TREE_TYPE (TREE_TYPE (decl))); |
726a989a RB |
14175 | call = gimple_build_call (decl, 0); |
14176 | gimple_call_set_lhs (call, lhs); | |
14177 | gimple_seq_add_stmt (pre_p, call); | |
14178 | ||
14179 | cond = gimple_build_cond (EQ_EXPR, lhs, | |
db3927fb AH |
14180 | fold_convert_loc (loc, TREE_TYPE (lhs), |
14181 | boolean_true_node), | |
726a989a RB |
14182 | tlabel, flabel); |
14183 | gimple_seq_add_stmt (pre_p, cond); | |
14184 | gimple_seq_add_stmt (pre_p, gimple_build_label (tlabel)); | |
14185 | gimple_seq_add_seq (pre_p, gimple_omp_body (single_stmt)); | |
14186 | gimple_seq_add_stmt (pre_p, gimple_build_label (flabel)); | |
953ff289 DN |
14187 | } |
14188 | ||
50674e96 DN |
14189 | |
14190 | /* A subroutine of lower_omp_single. Expand the simple form of | |
726a989a | 14191 | a GIMPLE_OMP_SINGLE, with a copyprivate clause: |
953ff289 DN |
14192 | |
14193 | #pragma omp single copyprivate (a, b, c) | |
14194 | ||
14195 | Create a new structure to hold copies of 'a', 'b' and 'c' and emit: | |
14196 | ||
14197 | { | |
14198 | if ((copyout_p = GOMP_single_copy_start ()) == NULL) | |
14199 | { | |
14200 | BODY; | |
14201 | copyout.a = a; | |
14202 | copyout.b = b; | |
14203 | copyout.c = c; | |
14204 | GOMP_single_copy_end (©out); | |
14205 | } | |
14206 | else | |
14207 | { | |
14208 | a = copyout_p->a; | |
14209 | b = copyout_p->b; | |
14210 | c = copyout_p->c; | |
14211 | } | |
14212 | GOMP_barrier (); | |
14213 | } | |
50674e96 DN |
14214 | |
14215 | FIXME. It may be better to delay expanding the logic of this until | |
14216 | pass_expand_omp. The expanded logic may make the job more difficult | |
14217 | to a synchronization analysis pass. */ | |
953ff289 DN |
14218 | |
14219 | static void | |
538dd0b7 DM |
14220 | lower_omp_single_copy (gomp_single *single_stmt, gimple_seq *pre_p, |
14221 | omp_context *ctx) | |
953ff289 | 14222 | { |
e79983f4 | 14223 | tree ptr_type, t, l0, l1, l2, bfn_decl; |
726a989a | 14224 | gimple_seq copyin_seq; |
c2255bc4 | 14225 | location_t loc = gimple_location (single_stmt); |
953ff289 DN |
14226 | |
14227 | ctx->sender_decl = create_tmp_var (ctx->record_type, ".omp_copy_o"); | |
14228 | ||
14229 | ptr_type = build_pointer_type (ctx->record_type); | |
14230 | ctx->receiver_decl = create_tmp_var (ptr_type, ".omp_copy_i"); | |
14231 | ||
c2255bc4 AH |
14232 | l0 = create_artificial_label (loc); |
14233 | l1 = create_artificial_label (loc); | |
14234 | l2 = create_artificial_label (loc); | |
953ff289 | 14235 | |
e79983f4 MM |
14236 | bfn_decl = builtin_decl_explicit (BUILT_IN_GOMP_SINGLE_COPY_START); |
14237 | t = build_call_expr_loc (loc, bfn_decl, 0); | |
db3927fb | 14238 | t = fold_convert_loc (loc, ptr_type, t); |
726a989a | 14239 | gimplify_assign (ctx->receiver_decl, t, pre_p); |
953ff289 DN |
14240 | |
14241 | t = build2 (EQ_EXPR, boolean_type_node, ctx->receiver_decl, | |
14242 | build_int_cst (ptr_type, 0)); | |
14243 | t = build3 (COND_EXPR, void_type_node, t, | |
14244 | build_and_jump (&l0), build_and_jump (&l1)); | |
14245 | gimplify_and_add (t, pre_p); | |
14246 | ||
726a989a | 14247 | gimple_seq_add_stmt (pre_p, gimple_build_label (l0)); |
953ff289 | 14248 | |
726a989a | 14249 | gimple_seq_add_seq (pre_p, gimple_omp_body (single_stmt)); |
953ff289 DN |
14250 | |
14251 | copyin_seq = NULL; | |
726a989a | 14252 | lower_copyprivate_clauses (gimple_omp_single_clauses (single_stmt), pre_p, |
953ff289 DN |
14253 | ©in_seq, ctx); |
14254 | ||
db3927fb | 14255 | t = build_fold_addr_expr_loc (loc, ctx->sender_decl); |
e79983f4 MM |
14256 | bfn_decl = builtin_decl_explicit (BUILT_IN_GOMP_SINGLE_COPY_END); |
14257 | t = build_call_expr_loc (loc, bfn_decl, 1, t); | |
953ff289 DN |
14258 | gimplify_and_add (t, pre_p); |
14259 | ||
14260 | t = build_and_jump (&l2); | |
14261 | gimplify_and_add (t, pre_p); | |
14262 | ||
726a989a | 14263 | gimple_seq_add_stmt (pre_p, gimple_build_label (l1)); |
953ff289 | 14264 | |
726a989a | 14265 | gimple_seq_add_seq (pre_p, copyin_seq); |
953ff289 | 14266 | |
726a989a | 14267 | gimple_seq_add_stmt (pre_p, gimple_build_label (l2)); |
953ff289 DN |
14268 | } |
14269 | ||
50674e96 | 14270 | |
953ff289 DN |
14271 | /* Expand code for an OpenMP single directive. */ |
14272 | ||
14273 | static void | |
726a989a | 14274 | lower_omp_single (gimple_stmt_iterator *gsi_p, omp_context *ctx) |
953ff289 | 14275 | { |
726a989a | 14276 | tree block; |
355fe088 | 14277 | gimple *t; |
538dd0b7 DM |
14278 | gomp_single *single_stmt = as_a <gomp_single *> (gsi_stmt (*gsi_p)); |
14279 | gbind *bind; | |
acf0174b | 14280 | gimple_seq bind_body, bind_body_tail = NULL, dlist; |
953ff289 | 14281 | |
45852dcc | 14282 | push_gimplify_context (); |
953ff289 | 14283 | |
355a7673 MM |
14284 | block = make_node (BLOCK); |
14285 | bind = gimple_build_bind (NULL, NULL, block); | |
14286 | gsi_replace (gsi_p, bind, true); | |
726a989a | 14287 | bind_body = NULL; |
355a7673 | 14288 | dlist = NULL; |
726a989a | 14289 | lower_rec_input_clauses (gimple_omp_single_clauses (single_stmt), |
acf0174b | 14290 | &bind_body, &dlist, ctx, NULL); |
355a7673 | 14291 | lower_omp (gimple_omp_body_ptr (single_stmt), ctx); |
953ff289 | 14292 | |
726a989a | 14293 | gimple_seq_add_stmt (&bind_body, single_stmt); |
953ff289 DN |
14294 | |
14295 | if (ctx->record_type) | |
726a989a | 14296 | lower_omp_single_copy (single_stmt, &bind_body, ctx); |
953ff289 | 14297 | else |
726a989a RB |
14298 | lower_omp_single_simple (single_stmt, &bind_body); |
14299 | ||
14300 | gimple_omp_set_body (single_stmt, NULL); | |
953ff289 | 14301 | |
726a989a | 14302 | gimple_seq_add_seq (&bind_body, dlist); |
777f7f9a | 14303 | |
726a989a | 14304 | bind_body = maybe_catch_exception (bind_body); |
777f7f9a | 14305 | |
b8698a0f | 14306 | t = gimple_build_omp_return |
726a989a RB |
14307 | (!!find_omp_clause (gimple_omp_single_clauses (single_stmt), |
14308 | OMP_CLAUSE_NOWAIT)); | |
acf0174b JJ |
14309 | gimple_seq_add_stmt (&bind_body_tail, t); |
14310 | maybe_add_implicit_barrier_cancel (ctx, &bind_body_tail); | |
14311 | if (ctx->record_type) | |
14312 | { | |
14313 | gimple_stmt_iterator gsi = gsi_start (bind_body_tail); | |
14314 | tree clobber = build_constructor (ctx->record_type, NULL); | |
14315 | TREE_THIS_VOLATILE (clobber) = 1; | |
14316 | gsi_insert_after (&gsi, gimple_build_assign (ctx->sender_decl, | |
14317 | clobber), GSI_SAME_STMT); | |
14318 | } | |
14319 | gimple_seq_add_seq (&bind_body, bind_body_tail); | |
355a7673 | 14320 | gimple_bind_set_body (bind, bind_body); |
777f7f9a | 14321 | |
953ff289 | 14322 | pop_gimplify_context (bind); |
50674e96 | 14323 | |
726a989a RB |
14324 | gimple_bind_append_vars (bind, ctx->block_vars); |
14325 | BLOCK_VARS (block) = ctx->block_vars; | |
b357f682 JJ |
14326 | if (BLOCK_VARS (block)) |
14327 | TREE_USED (block) = 1; | |
953ff289 DN |
14328 | } |
14329 | ||
50674e96 | 14330 | |
953ff289 DN |
14331 | /* Expand code for an OpenMP master directive. */ |
14332 | ||
14333 | static void | |
726a989a | 14334 | lower_omp_master (gimple_stmt_iterator *gsi_p, omp_context *ctx) |
953ff289 | 14335 | { |
e79983f4 | 14336 | tree block, lab = NULL, x, bfn_decl; |
355fe088 | 14337 | gimple *stmt = gsi_stmt (*gsi_p); |
538dd0b7 | 14338 | gbind *bind; |
db3927fb | 14339 | location_t loc = gimple_location (stmt); |
726a989a | 14340 | gimple_seq tseq; |
953ff289 | 14341 | |
45852dcc | 14342 | push_gimplify_context (); |
953ff289 DN |
14343 | |
14344 | block = make_node (BLOCK); | |
355a7673 MM |
14345 | bind = gimple_build_bind (NULL, NULL, block); |
14346 | gsi_replace (gsi_p, bind, true); | |
14347 | gimple_bind_add_stmt (bind, stmt); | |
777f7f9a | 14348 | |
e79983f4 MM |
14349 | bfn_decl = builtin_decl_explicit (BUILT_IN_OMP_GET_THREAD_NUM); |
14350 | x = build_call_expr_loc (loc, bfn_decl, 0); | |
953ff289 DN |
14351 | x = build2 (EQ_EXPR, boolean_type_node, x, integer_zero_node); |
14352 | x = build3 (COND_EXPR, void_type_node, x, NULL, build_and_jump (&lab)); | |
726a989a RB |
14353 | tseq = NULL; |
14354 | gimplify_and_add (x, &tseq); | |
14355 | gimple_bind_add_seq (bind, tseq); | |
953ff289 | 14356 | |
355a7673 | 14357 | lower_omp (gimple_omp_body_ptr (stmt), ctx); |
726a989a RB |
14358 | gimple_omp_set_body (stmt, maybe_catch_exception (gimple_omp_body (stmt))); |
14359 | gimple_bind_add_seq (bind, gimple_omp_body (stmt)); | |
14360 | gimple_omp_set_body (stmt, NULL); | |
953ff289 | 14361 | |
726a989a | 14362 | gimple_bind_add_stmt (bind, gimple_build_label (lab)); |
777f7f9a | 14363 | |
726a989a | 14364 | gimple_bind_add_stmt (bind, gimple_build_omp_return (true)); |
777f7f9a | 14365 | |
953ff289 | 14366 | pop_gimplify_context (bind); |
50674e96 | 14367 | |
726a989a RB |
14368 | gimple_bind_append_vars (bind, ctx->block_vars); |
14369 | BLOCK_VARS (block) = ctx->block_vars; | |
953ff289 DN |
14370 | } |
14371 | ||
50674e96 | 14372 | |
acf0174b JJ |
14373 | /* Expand code for an OpenMP taskgroup directive. */ |
14374 | ||
14375 | static void | |
14376 | lower_omp_taskgroup (gimple_stmt_iterator *gsi_p, omp_context *ctx) | |
14377 | { | |
355fe088 | 14378 | gimple *stmt = gsi_stmt (*gsi_p); |
538dd0b7 DM |
14379 | gcall *x; |
14380 | gbind *bind; | |
acf0174b JJ |
14381 | tree block = make_node (BLOCK); |
14382 | ||
14383 | bind = gimple_build_bind (NULL, NULL, block); | |
14384 | gsi_replace (gsi_p, bind, true); | |
14385 | gimple_bind_add_stmt (bind, stmt); | |
14386 | ||
14387 | x = gimple_build_call (builtin_decl_explicit (BUILT_IN_GOMP_TASKGROUP_START), | |
14388 | 0); | |
14389 | gimple_bind_add_stmt (bind, x); | |
14390 | ||
14391 | lower_omp (gimple_omp_body_ptr (stmt), ctx); | |
14392 | gimple_bind_add_seq (bind, gimple_omp_body (stmt)); | |
14393 | gimple_omp_set_body (stmt, NULL); | |
14394 | ||
14395 | gimple_bind_add_stmt (bind, gimple_build_omp_return (true)); | |
14396 | ||
14397 | gimple_bind_append_vars (bind, ctx->block_vars); | |
14398 | BLOCK_VARS (block) = ctx->block_vars; | |
14399 | } | |
14400 | ||
14401 | ||
d9a6bd32 JJ |
14402 | /* Fold the OMP_ORDERED_CLAUSES for the OMP_ORDERED in STMT if possible. */ |
14403 | ||
14404 | static void | |
14405 | lower_omp_ordered_clauses (gimple_stmt_iterator *gsi_p, gomp_ordered *ord_stmt, | |
14406 | omp_context *ctx) | |
14407 | { | |
14408 | struct omp_for_data fd; | |
14409 | if (!ctx->outer || gimple_code (ctx->outer->stmt) != GIMPLE_OMP_FOR) | |
14410 | return; | |
14411 | ||
14412 | unsigned int len = gimple_omp_for_collapse (ctx->outer->stmt); | |
14413 | struct omp_for_data_loop *loops = XALLOCAVEC (struct omp_for_data_loop, len); | |
14414 | extract_omp_for_data (as_a <gomp_for *> (ctx->outer->stmt), &fd, loops); | |
14415 | if (!fd.ordered) | |
14416 | return; | |
14417 | ||
14418 | tree *list_p = gimple_omp_ordered_clauses_ptr (ord_stmt); | |
14419 | tree c = gimple_omp_ordered_clauses (ord_stmt); | |
14420 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_DEPEND | |
14421 | && OMP_CLAUSE_DEPEND_KIND (c) == OMP_CLAUSE_DEPEND_SINK) | |
14422 | { | |
14423 | /* Merge depend clauses from multiple adjacent | |
14424 | #pragma omp ordered depend(sink:...) constructs | |
14425 | into one #pragma omp ordered depend(sink:...), so that | |
14426 | we can optimize them together. */ | |
14427 | gimple_stmt_iterator gsi = *gsi_p; | |
14428 | gsi_next (&gsi); | |
14429 | while (!gsi_end_p (gsi)) | |
14430 | { | |
14431 | gimple *stmt = gsi_stmt (gsi); | |
14432 | if (is_gimple_debug (stmt) | |
14433 | || gimple_code (stmt) == GIMPLE_NOP) | |
14434 | { | |
14435 | gsi_next (&gsi); | |
14436 | continue; | |
14437 | } | |
14438 | if (gimple_code (stmt) != GIMPLE_OMP_ORDERED) | |
14439 | break; | |
14440 | gomp_ordered *ord_stmt2 = as_a <gomp_ordered *> (stmt); | |
14441 | c = gimple_omp_ordered_clauses (ord_stmt2); | |
14442 | if (c == NULL_TREE | |
14443 | || OMP_CLAUSE_CODE (c) != OMP_CLAUSE_DEPEND | |
14444 | || OMP_CLAUSE_DEPEND_KIND (c) != OMP_CLAUSE_DEPEND_SINK) | |
14445 | break; | |
14446 | while (*list_p) | |
14447 | list_p = &OMP_CLAUSE_CHAIN (*list_p); | |
14448 | *list_p = c; | |
14449 | gsi_remove (&gsi, true); | |
14450 | } | |
14451 | } | |
14452 | ||
14453 | /* Canonicalize sink dependence clauses into one folded clause if | |
14454 | possible. | |
14455 | ||
14456 | The basic algorithm is to create a sink vector whose first | |
14457 | element is the GCD of all the first elements, and whose remaining | |
14458 | elements are the minimum of the subsequent columns. | |
14459 | ||
14460 | We ignore dependence vectors whose first element is zero because | |
14461 | such dependencies are known to be executed by the same thread. | |
14462 | ||
14463 | We take into account the direction of the loop, so a minimum | |
14464 | becomes a maximum if the loop is iterating forwards. We also | |
14465 | ignore sink clauses where the loop direction is unknown, or where | |
14466 | the offsets are clearly invalid because they are not a multiple | |
14467 | of the loop increment. | |
14468 | ||
14469 | For example: | |
14470 | ||
14471 | #pragma omp for ordered(2) | |
14472 | for (i=0; i < N; ++i) | |
14473 | for (j=0; j < M; ++j) | |
14474 | { | |
14475 | #pragma omp ordered \ | |
14476 | depend(sink:i-8,j-2) \ | |
14477 | depend(sink:i,j-1) \ // Completely ignored because i+0. | |
14478 | depend(sink:i-4,j-3) \ | |
14479 | depend(sink:i-6,j-4) | |
14480 | #pragma omp ordered depend(source) | |
14481 | } | |
14482 | ||
14483 | Folded clause is: | |
14484 | ||
14485 | depend(sink:-gcd(8,4,6),-min(2,3,4)) | |
14486 | -or- | |
14487 | depend(sink:-2,-2) | |
14488 | */ | |
14489 | ||
14490 | /* FIXME: Computing GCD's where the first element is zero is | |
14491 | non-trivial in the presence of collapsed loops. Do this later. */ | |
14492 | if (fd.collapse > 1) | |
14493 | return; | |
14494 | ||
14495 | wide_int *folded_deps = XALLOCAVEC (wide_int, 2 * len - 1); | |
14496 | memset (folded_deps, 0, sizeof (*folded_deps) * (2 * len - 1)); | |
14497 | tree folded_dep = NULL_TREE; | |
14498 | /* TRUE if the first dimension's offset is negative. */ | |
14499 | bool neg_offset_p = false; | |
14500 | ||
14501 | list_p = gimple_omp_ordered_clauses_ptr (ord_stmt); | |
14502 | unsigned int i; | |
14503 | while ((c = *list_p) != NULL) | |
14504 | { | |
14505 | bool remove = false; | |
14506 | ||
14507 | gcc_assert (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_DEPEND); | |
14508 | if (OMP_CLAUSE_DEPEND_KIND (c) != OMP_CLAUSE_DEPEND_SINK) | |
14509 | goto next_ordered_clause; | |
14510 | ||
14511 | tree vec; | |
14512 | for (vec = OMP_CLAUSE_DECL (c), i = 0; | |
14513 | vec && TREE_CODE (vec) == TREE_LIST; | |
14514 | vec = TREE_CHAIN (vec), ++i) | |
14515 | { | |
14516 | gcc_assert (i < len); | |
14517 | ||
14518 | /* extract_omp_for_data has canonicalized the condition. */ | |
14519 | gcc_assert (fd.loops[i].cond_code == LT_EXPR | |
14520 | || fd.loops[i].cond_code == GT_EXPR); | |
14521 | bool forward = fd.loops[i].cond_code == LT_EXPR; | |
14522 | bool maybe_lexically_later = true; | |
14523 | ||
14524 | /* While the committee makes up its mind, bail if we have any | |
14525 | non-constant steps. */ | |
14526 | if (TREE_CODE (fd.loops[i].step) != INTEGER_CST) | |
14527 | goto lower_omp_ordered_ret; | |
14528 | ||
14529 | tree itype = TREE_TYPE (TREE_VALUE (vec)); | |
14530 | if (POINTER_TYPE_P (itype)) | |
14531 | itype = sizetype; | |
14532 | wide_int offset = wide_int::from (TREE_PURPOSE (vec), | |
14533 | TYPE_PRECISION (itype), | |
14534 | TYPE_SIGN (itype)); | |
14535 | ||
14536 | /* Ignore invalid offsets that are not multiples of the step. */ | |
14537 | if (!wi::multiple_of_p | |
14538 | (wi::abs (offset), wi::abs ((wide_int) fd.loops[i].step), | |
14539 | UNSIGNED)) | |
14540 | { | |
14541 | warning_at (OMP_CLAUSE_LOCATION (c), 0, | |
14542 | "ignoring sink clause with offset that is not " | |
14543 | "a multiple of the loop step"); | |
14544 | remove = true; | |
14545 | goto next_ordered_clause; | |
14546 | } | |
14547 | ||
14548 | /* Calculate the first dimension. The first dimension of | |
14549 | the folded dependency vector is the GCD of the first | |
14550 | elements, while ignoring any first elements whose offset | |
14551 | is 0. */ | |
14552 | if (i == 0) | |
14553 | { | |
14554 | /* Ignore dependence vectors whose first dimension is 0. */ | |
14555 | if (offset == 0) | |
14556 | { | |
14557 | remove = true; | |
14558 | goto next_ordered_clause; | |
14559 | } | |
14560 | else | |
14561 | { | |
14562 | if (!TYPE_UNSIGNED (itype) && (forward ^ wi::neg_p (offset))) | |
14563 | { | |
14564 | error_at (OMP_CLAUSE_LOCATION (c), | |
14565 | "first offset must be in opposite direction " | |
14566 | "of loop iterations"); | |
14567 | goto lower_omp_ordered_ret; | |
14568 | } | |
14569 | if (forward) | |
14570 | offset = -offset; | |
14571 | neg_offset_p = forward; | |
14572 | /* Initialize the first time around. */ | |
14573 | if (folded_dep == NULL_TREE) | |
14574 | { | |
14575 | folded_dep = c; | |
14576 | folded_deps[0] = offset; | |
14577 | } | |
14578 | else | |
14579 | folded_deps[0] = wi::gcd (folded_deps[0], | |
14580 | offset, UNSIGNED); | |
14581 | } | |
14582 | } | |
14583 | /* Calculate minimum for the remaining dimensions. */ | |
14584 | else | |
14585 | { | |
14586 | folded_deps[len + i - 1] = offset; | |
14587 | if (folded_dep == c) | |
14588 | folded_deps[i] = offset; | |
14589 | else if (maybe_lexically_later | |
14590 | && !wi::eq_p (folded_deps[i], offset)) | |
14591 | { | |
14592 | if (forward ^ wi::gts_p (folded_deps[i], offset)) | |
14593 | { | |
14594 | unsigned int j; | |
14595 | folded_dep = c; | |
14596 | for (j = 1; j <= i; j++) | |
14597 | folded_deps[j] = folded_deps[len + j - 1]; | |
14598 | } | |
14599 | else | |
14600 | maybe_lexically_later = false; | |
14601 | } | |
14602 | } | |
14603 | } | |
14604 | gcc_assert (i == len); | |
14605 | ||
14606 | remove = true; | |
14607 | ||
14608 | next_ordered_clause: | |
14609 | if (remove) | |
14610 | *list_p = OMP_CLAUSE_CHAIN (c); | |
14611 | else | |
14612 | list_p = &OMP_CLAUSE_CHAIN (c); | |
14613 | } | |
14614 | ||
14615 | if (folded_dep) | |
14616 | { | |
14617 | if (neg_offset_p) | |
14618 | folded_deps[0] = -folded_deps[0]; | |
14619 | ||
14620 | tree itype = TREE_TYPE (TREE_VALUE (OMP_CLAUSE_DECL (folded_dep))); | |
14621 | if (POINTER_TYPE_P (itype)) | |
14622 | itype = sizetype; | |
14623 | ||
14624 | TREE_PURPOSE (OMP_CLAUSE_DECL (folded_dep)) | |
14625 | = wide_int_to_tree (itype, folded_deps[0]); | |
14626 | OMP_CLAUSE_CHAIN (folded_dep) = gimple_omp_ordered_clauses (ord_stmt); | |
14627 | *gimple_omp_ordered_clauses_ptr (ord_stmt) = folded_dep; | |
14628 | } | |
14629 | ||
14630 | lower_omp_ordered_ret: | |
14631 | ||
14632 | /* Ordered without clauses is #pragma omp threads, while we want | |
14633 | a nop instead if we remove all clauses. */ | |
14634 | if (gimple_omp_ordered_clauses (ord_stmt) == NULL_TREE) | |
14635 | gsi_replace (gsi_p, gimple_build_nop (), true); | |
14636 | } | |
14637 | ||
14638 | ||
953ff289 DN |
14639 | /* Expand code for an OpenMP ordered directive. */ |
14640 | ||
14641 | static void | |
726a989a | 14642 | lower_omp_ordered (gimple_stmt_iterator *gsi_p, omp_context *ctx) |
953ff289 | 14643 | { |
726a989a | 14644 | tree block; |
355fe088 | 14645 | gimple *stmt = gsi_stmt (*gsi_p); |
d9a6bd32 | 14646 | gomp_ordered *ord_stmt = as_a <gomp_ordered *> (stmt); |
538dd0b7 DM |
14647 | gcall *x; |
14648 | gbind *bind; | |
e4606348 JJ |
14649 | bool simd = find_omp_clause (gimple_omp_ordered_clauses (ord_stmt), |
14650 | OMP_CLAUSE_SIMD); | |
14651 | bool threads = find_omp_clause (gimple_omp_ordered_clauses (ord_stmt), | |
14652 | OMP_CLAUSE_THREADS); | |
d9a6bd32 JJ |
14653 | |
14654 | if (find_omp_clause (gimple_omp_ordered_clauses (ord_stmt), | |
14655 | OMP_CLAUSE_DEPEND)) | |
14656 | { | |
14657 | /* FIXME: This is needs to be moved to the expansion to verify various | |
14658 | conditions only testable on cfg with dominators computed, and also | |
14659 | all the depend clauses to be merged still might need to be available | |
14660 | for the runtime checks. */ | |
14661 | if (0) | |
14662 | lower_omp_ordered_clauses (gsi_p, ord_stmt, ctx); | |
14663 | return; | |
14664 | } | |
953ff289 | 14665 | |
45852dcc | 14666 | push_gimplify_context (); |
953ff289 DN |
14667 | |
14668 | block = make_node (BLOCK); | |
355a7673 MM |
14669 | bind = gimple_build_bind (NULL, NULL, block); |
14670 | gsi_replace (gsi_p, bind, true); | |
14671 | gimple_bind_add_stmt (bind, stmt); | |
777f7f9a | 14672 | |
d9a6bd32 JJ |
14673 | if (simd) |
14674 | { | |
e4606348 JJ |
14675 | x = gimple_build_call_internal (IFN_GOMP_SIMD_ORDERED_START, 1, |
14676 | build_int_cst (NULL_TREE, threads)); | |
d9a6bd32 JJ |
14677 | cfun->has_simduid_loops = true; |
14678 | } | |
14679 | else | |
14680 | x = gimple_build_call (builtin_decl_explicit (BUILT_IN_GOMP_ORDERED_START), | |
14681 | 0); | |
726a989a | 14682 | gimple_bind_add_stmt (bind, x); |
953ff289 | 14683 | |
355a7673 | 14684 | lower_omp (gimple_omp_body_ptr (stmt), ctx); |
726a989a RB |
14685 | gimple_omp_set_body (stmt, maybe_catch_exception (gimple_omp_body (stmt))); |
14686 | gimple_bind_add_seq (bind, gimple_omp_body (stmt)); | |
14687 | gimple_omp_set_body (stmt, NULL); | |
953ff289 | 14688 | |
d9a6bd32 | 14689 | if (simd) |
e4606348 JJ |
14690 | x = gimple_build_call_internal (IFN_GOMP_SIMD_ORDERED_END, 1, |
14691 | build_int_cst (NULL_TREE, threads)); | |
d9a6bd32 JJ |
14692 | else |
14693 | x = gimple_build_call (builtin_decl_explicit (BUILT_IN_GOMP_ORDERED_END), | |
14694 | 0); | |
726a989a | 14695 | gimple_bind_add_stmt (bind, x); |
777f7f9a | 14696 | |
726a989a | 14697 | gimple_bind_add_stmt (bind, gimple_build_omp_return (true)); |
777f7f9a | 14698 | |
953ff289 | 14699 | pop_gimplify_context (bind); |
50674e96 | 14700 | |
726a989a RB |
14701 | gimple_bind_append_vars (bind, ctx->block_vars); |
14702 | BLOCK_VARS (block) = gimple_bind_vars (bind); | |
953ff289 DN |
14703 | } |
14704 | ||
953ff289 | 14705 | |
726a989a | 14706 | /* Gimplify a GIMPLE_OMP_CRITICAL statement. This is a relatively simple |
953ff289 DN |
14707 | substitution of a couple of function calls. But in the NAMED case, |
14708 | requires that languages coordinate a symbol name. It is therefore | |
14709 | best put here in common code. */ | |
14710 | ||
de144fb2 | 14711 | static GTY(()) hash_map<tree, tree> *critical_name_mutexes; |
953ff289 DN |
14712 | |
14713 | static void | |
726a989a | 14714 | lower_omp_critical (gimple_stmt_iterator *gsi_p, omp_context *ctx) |
953ff289 | 14715 | { |
726a989a RB |
14716 | tree block; |
14717 | tree name, lock, unlock; | |
538dd0b7 DM |
14718 | gomp_critical *stmt = as_a <gomp_critical *> (gsi_stmt (*gsi_p)); |
14719 | gbind *bind; | |
db3927fb | 14720 | location_t loc = gimple_location (stmt); |
726a989a | 14721 | gimple_seq tbody; |
953ff289 | 14722 | |
726a989a | 14723 | name = gimple_omp_critical_name (stmt); |
953ff289 DN |
14724 | if (name) |
14725 | { | |
5039610b | 14726 | tree decl; |
953ff289 DN |
14727 | |
14728 | if (!critical_name_mutexes) | |
de144fb2 | 14729 | critical_name_mutexes = hash_map<tree, tree>::create_ggc (10); |
953ff289 | 14730 | |
de144fb2 | 14731 | tree *n = critical_name_mutexes->get (name); |
953ff289 DN |
14732 | if (n == NULL) |
14733 | { | |
14734 | char *new_str; | |
14735 | ||
b731b390 | 14736 | decl = create_tmp_var_raw (ptr_type_node); |
953ff289 DN |
14737 | |
14738 | new_str = ACONCAT ((".gomp_critical_user_", | |
14739 | IDENTIFIER_POINTER (name), NULL)); | |
14740 | DECL_NAME (decl) = get_identifier (new_str); | |
14741 | TREE_PUBLIC (decl) = 1; | |
14742 | TREE_STATIC (decl) = 1; | |
14743 | DECL_COMMON (decl) = 1; | |
14744 | DECL_ARTIFICIAL (decl) = 1; | |
14745 | DECL_IGNORED_P (decl) = 1; | |
1f6be682 | 14746 | |
9041d2e6 | 14747 | varpool_node::finalize_decl (decl); |
953ff289 | 14748 | |
de144fb2 | 14749 | critical_name_mutexes->put (name, decl); |
953ff289 DN |
14750 | } |
14751 | else | |
de144fb2 | 14752 | decl = *n; |
953ff289 | 14753 | |
41dbbb37 | 14754 | /* If '#pragma omp critical' is inside offloaded region or |
476ff787 AT |
14755 | inside function marked as offloadable, the symbol must be |
14756 | marked as offloadable too. */ | |
14757 | omp_context *octx; | |
14758 | if (cgraph_node::get (current_function_decl)->offloadable) | |
14759 | varpool_node::get_create (decl)->offloadable = 1; | |
14760 | else | |
14761 | for (octx = ctx->outer; octx; octx = octx->outer) | |
41dbbb37 | 14762 | if (is_gimple_omp_offloaded (octx->stmt)) |
476ff787 AT |
14763 | { |
14764 | varpool_node::get_create (decl)->offloadable = 1; | |
14765 | break; | |
14766 | } | |
14767 | ||
e79983f4 | 14768 | lock = builtin_decl_explicit (BUILT_IN_GOMP_CRITICAL_NAME_START); |
db3927fb | 14769 | lock = build_call_expr_loc (loc, lock, 1, build_fold_addr_expr_loc (loc, decl)); |
953ff289 | 14770 | |
e79983f4 | 14771 | unlock = builtin_decl_explicit (BUILT_IN_GOMP_CRITICAL_NAME_END); |
db3927fb AH |
14772 | unlock = build_call_expr_loc (loc, unlock, 1, |
14773 | build_fold_addr_expr_loc (loc, decl)); | |
953ff289 DN |
14774 | } |
14775 | else | |
14776 | { | |
e79983f4 | 14777 | lock = builtin_decl_explicit (BUILT_IN_GOMP_CRITICAL_START); |
db3927fb | 14778 | lock = build_call_expr_loc (loc, lock, 0); |
953ff289 | 14779 | |
e79983f4 | 14780 | unlock = builtin_decl_explicit (BUILT_IN_GOMP_CRITICAL_END); |
db3927fb | 14781 | unlock = build_call_expr_loc (loc, unlock, 0); |
953ff289 DN |
14782 | } |
14783 | ||
45852dcc | 14784 | push_gimplify_context (); |
953ff289 DN |
14785 | |
14786 | block = make_node (BLOCK); | |
355a7673 MM |
14787 | bind = gimple_build_bind (NULL, NULL, block); |
14788 | gsi_replace (gsi_p, bind, true); | |
14789 | gimple_bind_add_stmt (bind, stmt); | |
777f7f9a | 14790 | |
726a989a RB |
14791 | tbody = gimple_bind_body (bind); |
14792 | gimplify_and_add (lock, &tbody); | |
14793 | gimple_bind_set_body (bind, tbody); | |
953ff289 | 14794 | |
355a7673 | 14795 | lower_omp (gimple_omp_body_ptr (stmt), ctx); |
726a989a RB |
14796 | gimple_omp_set_body (stmt, maybe_catch_exception (gimple_omp_body (stmt))); |
14797 | gimple_bind_add_seq (bind, gimple_omp_body (stmt)); | |
14798 | gimple_omp_set_body (stmt, NULL); | |
953ff289 | 14799 | |
726a989a RB |
14800 | tbody = gimple_bind_body (bind); |
14801 | gimplify_and_add (unlock, &tbody); | |
14802 | gimple_bind_set_body (bind, tbody); | |
777f7f9a | 14803 | |
726a989a | 14804 | gimple_bind_add_stmt (bind, gimple_build_omp_return (true)); |
953ff289 DN |
14805 | |
14806 | pop_gimplify_context (bind); | |
726a989a RB |
14807 | gimple_bind_append_vars (bind, ctx->block_vars); |
14808 | BLOCK_VARS (block) = gimple_bind_vars (bind); | |
50674e96 DN |
14809 | } |
14810 | ||
14811 | ||
14812 | /* A subroutine of lower_omp_for. Generate code to emit the predicate | |
14813 | for a lastprivate clause. Given a loop control predicate of (V | |
14814 | cond N2), we gate the clause on (!(V cond N2)). The lowered form | |
3d55c64b JJ |
14815 | is appended to *DLIST, iterator initialization is appended to |
14816 | *BODY_P. */ | |
50674e96 DN |
14817 | |
14818 | static void | |
726a989a RB |
14819 | lower_omp_for_lastprivate (struct omp_for_data *fd, gimple_seq *body_p, |
14820 | gimple_seq *dlist, struct omp_context *ctx) | |
50674e96 | 14821 | { |
726a989a | 14822 | tree clauses, cond, vinit; |
50674e96 | 14823 | enum tree_code cond_code; |
726a989a | 14824 | gimple_seq stmts; |
b8698a0f | 14825 | |
a68ab351 | 14826 | cond_code = fd->loop.cond_code; |
50674e96 DN |
14827 | cond_code = cond_code == LT_EXPR ? GE_EXPR : LE_EXPR; |
14828 | ||
14829 | /* When possible, use a strict equality expression. This can let VRP | |
14830 | type optimizations deduce the value and remove a copy. */ | |
9541ffee | 14831 | if (tree_fits_shwi_p (fd->loop.step)) |
50674e96 | 14832 | { |
eb1ce453 | 14833 | HOST_WIDE_INT step = tree_to_shwi (fd->loop.step); |
50674e96 DN |
14834 | if (step == 1 || step == -1) |
14835 | cond_code = EQ_EXPR; | |
14836 | } | |
14837 | ||
41b37d5e JJ |
14838 | tree n2 = fd->loop.n2; |
14839 | if (fd->collapse > 1 | |
14840 | && TREE_CODE (n2) != INTEGER_CST | |
d9a6bd32 | 14841 | && gimple_omp_for_combined_into_p (fd->for_stmt)) |
41b37d5e | 14842 | { |
e01d41e5 | 14843 | struct omp_context *taskreg_ctx = NULL; |
d9a6bd32 JJ |
14844 | if (gimple_code (ctx->outer->stmt) == GIMPLE_OMP_FOR) |
14845 | { | |
14846 | gomp_for *gfor = as_a <gomp_for *> (ctx->outer->stmt); | |
e01d41e5 JJ |
14847 | if (gimple_omp_for_kind (gfor) == GF_OMP_FOR_KIND_FOR |
14848 | || gimple_omp_for_kind (gfor) == GF_OMP_FOR_KIND_DISTRIBUTE) | |
d9a6bd32 | 14849 | { |
e01d41e5 JJ |
14850 | if (gimple_omp_for_combined_into_p (gfor)) |
14851 | { | |
14852 | gcc_assert (ctx->outer->outer | |
14853 | && is_parallel_ctx (ctx->outer->outer)); | |
14854 | taskreg_ctx = ctx->outer->outer; | |
14855 | } | |
14856 | else | |
14857 | { | |
14858 | struct omp_for_data outer_fd; | |
14859 | extract_omp_for_data (gfor, &outer_fd, NULL); | |
14860 | n2 = fold_convert (TREE_TYPE (n2), outer_fd.loop.n2); | |
14861 | } | |
d9a6bd32 JJ |
14862 | } |
14863 | else if (gimple_omp_for_kind (gfor) == GF_OMP_FOR_KIND_TASKLOOP) | |
e01d41e5 | 14864 | taskreg_ctx = ctx->outer->outer; |
d9a6bd32 | 14865 | } |
e01d41e5 JJ |
14866 | else if (is_taskreg_ctx (ctx->outer)) |
14867 | taskreg_ctx = ctx->outer; | |
14868 | if (taskreg_ctx) | |
41b37d5e | 14869 | { |
d9a6bd32 JJ |
14870 | int i; |
14871 | tree innerc | |
e01d41e5 | 14872 | = find_omp_clause (gimple_omp_taskreg_clauses (taskreg_ctx->stmt), |
d9a6bd32 JJ |
14873 | OMP_CLAUSE__LOOPTEMP_); |
14874 | gcc_assert (innerc); | |
14875 | for (i = 0; i < fd->collapse; i++) | |
14876 | { | |
14877 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
14878 | OMP_CLAUSE__LOOPTEMP_); | |
14879 | gcc_assert (innerc); | |
14880 | } | |
14881 | innerc = find_omp_clause (OMP_CLAUSE_CHAIN (innerc), | |
14882 | OMP_CLAUSE__LOOPTEMP_); | |
14883 | if (innerc) | |
14884 | n2 = fold_convert (TREE_TYPE (n2), | |
14885 | lookup_decl (OMP_CLAUSE_DECL (innerc), | |
e01d41e5 | 14886 | taskreg_ctx)); |
41b37d5e JJ |
14887 | } |
14888 | } | |
14889 | cond = build2 (cond_code, boolean_type_node, fd->loop.v, n2); | |
50674e96 | 14890 | |
726a989a | 14891 | clauses = gimple_omp_for_clauses (fd->for_stmt); |
3d55c64b JJ |
14892 | stmts = NULL; |
14893 | lower_lastprivate_clauses (clauses, cond, &stmts, ctx); | |
726a989a | 14894 | if (!gimple_seq_empty_p (stmts)) |
3d55c64b | 14895 | { |
726a989a | 14896 | gimple_seq_add_seq (&stmts, *dlist); |
a68ab351 | 14897 | *dlist = stmts; |
3d55c64b JJ |
14898 | |
14899 | /* Optimize: v = 0; is usually cheaper than v = some_other_constant. */ | |
a68ab351 | 14900 | vinit = fd->loop.n1; |
3d55c64b | 14901 | if (cond_code == EQ_EXPR |
9541ffee | 14902 | && tree_fits_shwi_p (fd->loop.n2) |
a68ab351 JJ |
14903 | && ! integer_zerop (fd->loop.n2)) |
14904 | vinit = build_int_cst (TREE_TYPE (fd->loop.v), 0); | |
74bf76ed JJ |
14905 | else |
14906 | vinit = unshare_expr (vinit); | |
3d55c64b JJ |
14907 | |
14908 | /* Initialize the iterator variable, so that threads that don't execute | |
14909 | any iterations don't execute the lastprivate clauses by accident. */ | |
726a989a | 14910 | gimplify_assign (fd->loop.v, vinit, body_p); |
3d55c64b | 14911 | } |
50674e96 DN |
14912 | } |
14913 | ||
14914 | ||
41dbbb37 | 14915 | /* Lower code for an OMP loop directive. */ |
50674e96 DN |
14916 | |
14917 | static void | |
726a989a | 14918 | lower_omp_for (gimple_stmt_iterator *gsi_p, omp_context *ctx) |
50674e96 | 14919 | { |
726a989a | 14920 | tree *rhs_p, block; |
acf0174b | 14921 | struct omp_for_data fd, *fdp = NULL; |
538dd0b7 DM |
14922 | gomp_for *stmt = as_a <gomp_for *> (gsi_stmt (*gsi_p)); |
14923 | gbind *new_stmt; | |
0f900dfa | 14924 | gimple_seq omp_for_body, body, dlist; |
e4834818 | 14925 | gimple_seq oacc_head = NULL, oacc_tail = NULL; |
726a989a | 14926 | size_t i; |
50674e96 | 14927 | |
45852dcc | 14928 | push_gimplify_context (); |
50674e96 | 14929 | |
355a7673 | 14930 | lower_omp (gimple_omp_for_pre_body_ptr (stmt), ctx); |
50674e96 | 14931 | |
b357f682 | 14932 | block = make_node (BLOCK); |
726a989a | 14933 | new_stmt = gimple_build_bind (NULL, NULL, block); |
355a7673 | 14934 | /* Replace at gsi right away, so that 'stmt' is no member |
026c3cfd | 14935 | of a sequence anymore as we're going to add to a different |
355a7673 MM |
14936 | one below. */ |
14937 | gsi_replace (gsi_p, new_stmt, true); | |
b357f682 | 14938 | |
50674e96 DN |
14939 | /* Move declaration of temporaries in the loop body before we make |
14940 | it go away. */ | |
726a989a RB |
14941 | omp_for_body = gimple_omp_body (stmt); |
14942 | if (!gimple_seq_empty_p (omp_for_body) | |
14943 | && gimple_code (gimple_seq_first_stmt (omp_for_body)) == GIMPLE_BIND) | |
14944 | { | |
538dd0b7 DM |
14945 | gbind *inner_bind |
14946 | = as_a <gbind *> (gimple_seq_first_stmt (omp_for_body)); | |
c74559df | 14947 | tree vars = gimple_bind_vars (inner_bind); |
726a989a | 14948 | gimple_bind_append_vars (new_stmt, vars); |
c74559df JJ |
14949 | /* bind_vars/BLOCK_VARS are being moved to new_stmt/block, don't |
14950 | keep them on the inner_bind and it's block. */ | |
14951 | gimple_bind_set_vars (inner_bind, NULL_TREE); | |
14952 | if (gimple_bind_block (inner_bind)) | |
14953 | BLOCK_VARS (gimple_bind_block (inner_bind)) = NULL_TREE; | |
726a989a | 14954 | } |
50674e96 | 14955 | |
acf0174b JJ |
14956 | if (gimple_omp_for_combined_into_p (stmt)) |
14957 | { | |
14958 | extract_omp_for_data (stmt, &fd, NULL); | |
14959 | fdp = &fd; | |
14960 | ||
14961 | /* We need two temporaries with fd.loop.v type (istart/iend) | |
14962 | and then (fd.collapse - 1) temporaries with the same | |
14963 | type for count2 ... countN-1 vars if not constant. */ | |
14964 | size_t count = 2; | |
14965 | tree type = fd.iter_type; | |
14966 | if (fd.collapse > 1 | |
14967 | && TREE_CODE (fd.loop.n2) != INTEGER_CST) | |
14968 | count += fd.collapse - 1; | |
d9a6bd32 JJ |
14969 | bool taskreg_for |
14970 | = (gimple_omp_for_kind (stmt) == GF_OMP_FOR_KIND_FOR | |
14971 | || gimple_omp_for_kind (stmt) == GF_OMP_FOR_KIND_TASKLOOP); | |
acf0174b JJ |
14972 | tree outerc = NULL, *pc = gimple_omp_for_clauses_ptr (stmt); |
14973 | tree clauses = *pc; | |
d9a6bd32 | 14974 | if (taskreg_for) |
acf0174b | 14975 | outerc |
d9a6bd32 | 14976 | = find_omp_clause (gimple_omp_taskreg_clauses (ctx->outer->stmt), |
acf0174b JJ |
14977 | OMP_CLAUSE__LOOPTEMP_); |
14978 | for (i = 0; i < count; i++) | |
14979 | { | |
14980 | tree temp; | |
d9a6bd32 | 14981 | if (taskreg_for) |
acf0174b JJ |
14982 | { |
14983 | gcc_assert (outerc); | |
14984 | temp = lookup_decl (OMP_CLAUSE_DECL (outerc), ctx->outer); | |
14985 | outerc = find_omp_clause (OMP_CLAUSE_CHAIN (outerc), | |
14986 | OMP_CLAUSE__LOOPTEMP_); | |
14987 | } | |
14988 | else | |
f014c653 | 14989 | { |
b731b390 | 14990 | temp = create_tmp_var (type); |
f014c653 JJ |
14991 | insert_decl_map (&ctx->outer->cb, temp, temp); |
14992 | } | |
acf0174b JJ |
14993 | *pc = build_omp_clause (UNKNOWN_LOCATION, OMP_CLAUSE__LOOPTEMP_); |
14994 | OMP_CLAUSE_DECL (*pc) = temp; | |
14995 | pc = &OMP_CLAUSE_CHAIN (*pc); | |
14996 | } | |
14997 | *pc = clauses; | |
14998 | } | |
14999 | ||
726a989a | 15000 | /* The pre-body and input clauses go before the lowered GIMPLE_OMP_FOR. */ |
50674e96 | 15001 | dlist = NULL; |
726a989a | 15002 | body = NULL; |
acf0174b JJ |
15003 | lower_rec_input_clauses (gimple_omp_for_clauses (stmt), &body, &dlist, ctx, |
15004 | fdp); | |
726a989a | 15005 | gimple_seq_add_seq (&body, gimple_omp_for_pre_body (stmt)); |
50674e96 | 15006 | |
74bf76ed JJ |
15007 | lower_omp (gimple_omp_body_ptr (stmt), ctx); |
15008 | ||
50674e96 DN |
15009 | /* Lower the header expressions. At this point, we can assume that |
15010 | the header is of the form: | |
15011 | ||
15012 | #pragma omp for (V = VAL1; V {<|>|<=|>=} VAL2; V = V [+-] VAL3) | |
15013 | ||
15014 | We just need to make sure that VAL1, VAL2 and VAL3 are lowered | |
15015 | using the .omp_data_s mapping, if needed. */ | |
726a989a | 15016 | for (i = 0; i < gimple_omp_for_collapse (stmt); i++) |
a68ab351 | 15017 | { |
726a989a | 15018 | rhs_p = gimple_omp_for_initial_ptr (stmt, i); |
a68ab351 | 15019 | if (!is_gimple_min_invariant (*rhs_p)) |
726a989a | 15020 | *rhs_p = get_formal_tmp_var (*rhs_p, &body); |
a68ab351 | 15021 | |
726a989a | 15022 | rhs_p = gimple_omp_for_final_ptr (stmt, i); |
a68ab351 | 15023 | if (!is_gimple_min_invariant (*rhs_p)) |
726a989a | 15024 | *rhs_p = get_formal_tmp_var (*rhs_p, &body); |
a68ab351 | 15025 | |
726a989a | 15026 | rhs_p = &TREE_OPERAND (gimple_omp_for_incr (stmt, i), 1); |
a68ab351 | 15027 | if (!is_gimple_min_invariant (*rhs_p)) |
726a989a | 15028 | *rhs_p = get_formal_tmp_var (*rhs_p, &body); |
a68ab351 | 15029 | } |
50674e96 DN |
15030 | |
15031 | /* Once lowered, extract the bounds and clauses. */ | |
a68ab351 | 15032 | extract_omp_for_data (stmt, &fd, NULL); |
50674e96 | 15033 | |
e4834818 NS |
15034 | if (is_gimple_omp_oacc (ctx->stmt) |
15035 | && !ctx_in_oacc_kernels_region (ctx)) | |
15036 | lower_oacc_head_tail (gimple_location (stmt), | |
15037 | gimple_omp_for_clauses (stmt), | |
15038 | &oacc_head, &oacc_tail, ctx); | |
15039 | ||
374d0225 | 15040 | /* Add OpenACC partitioning and reduction markers just before the loop */ |
e4834818 NS |
15041 | if (oacc_head) |
15042 | gimple_seq_add_seq (&body, oacc_head); | |
15043 | ||
726a989a | 15044 | lower_omp_for_lastprivate (&fd, &body, &dlist, ctx); |
50674e96 | 15045 | |
d9a6bd32 JJ |
15046 | if (gimple_omp_for_kind (stmt) == GF_OMP_FOR_KIND_FOR) |
15047 | for (tree c = gimple_omp_for_clauses (stmt); c; c = OMP_CLAUSE_CHAIN (c)) | |
15048 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR | |
15049 | && !OMP_CLAUSE_LINEAR_NO_COPYIN (c)) | |
15050 | { | |
15051 | OMP_CLAUSE_DECL (c) = lookup_decl (OMP_CLAUSE_DECL (c), ctx); | |
15052 | if (DECL_P (OMP_CLAUSE_LINEAR_STEP (c))) | |
15053 | OMP_CLAUSE_LINEAR_STEP (c) | |
15054 | = maybe_lookup_decl_in_outer_ctx (OMP_CLAUSE_LINEAR_STEP (c), | |
15055 | ctx); | |
15056 | } | |
15057 | ||
b2b40051 MJ |
15058 | if (!gimple_omp_for_grid_phony (stmt)) |
15059 | gimple_seq_add_stmt (&body, stmt); | |
726a989a | 15060 | gimple_seq_add_seq (&body, gimple_omp_body (stmt)); |
777f7f9a | 15061 | |
b2b40051 MJ |
15062 | if (!gimple_omp_for_grid_phony (stmt)) |
15063 | gimple_seq_add_stmt (&body, gimple_build_omp_continue (fd.loop.v, | |
15064 | fd.loop.v)); | |
777f7f9a | 15065 | |
50674e96 | 15066 | /* After the loop, add exit clauses. */ |
726a989a | 15067 | lower_reduction_clauses (gimple_omp_for_clauses (stmt), &body, ctx); |
acf0174b JJ |
15068 | |
15069 | if (ctx->cancellable) | |
15070 | gimple_seq_add_stmt (&body, gimple_build_label (ctx->cancel_label)); | |
15071 | ||
726a989a | 15072 | gimple_seq_add_seq (&body, dlist); |
50674e96 | 15073 | |
726a989a | 15074 | body = maybe_catch_exception (body); |
4a31b7ee | 15075 | |
b2b40051 MJ |
15076 | if (!gimple_omp_for_grid_phony (stmt)) |
15077 | { | |
15078 | /* Region exit marker goes at the end of the loop body. */ | |
15079 | gimple_seq_add_stmt (&body, gimple_build_omp_return (fd.have_nowait)); | |
15080 | maybe_add_implicit_barrier_cancel (ctx, &body); | |
15081 | } | |
e4834818 NS |
15082 | |
15083 | /* Add OpenACC joining and reduction markers just after the loop. */ | |
15084 | if (oacc_tail) | |
15085 | gimple_seq_add_seq (&body, oacc_tail); | |
15086 | ||
b357f682 | 15087 | pop_gimplify_context (new_stmt); |
726a989a RB |
15088 | |
15089 | gimple_bind_append_vars (new_stmt, ctx->block_vars); | |
15090 | BLOCK_VARS (block) = gimple_bind_vars (new_stmt); | |
b357f682 JJ |
15091 | if (BLOCK_VARS (block)) |
15092 | TREE_USED (block) = 1; | |
50674e96 | 15093 | |
726a989a RB |
15094 | gimple_bind_set_body (new_stmt, body); |
15095 | gimple_omp_set_body (stmt, NULL); | |
15096 | gimple_omp_for_set_pre_body (stmt, NULL); | |
953ff289 DN |
15097 | } |
15098 | ||
b8698a0f | 15099 | /* Callback for walk_stmts. Check if the current statement only contains |
e0246869 | 15100 | GIMPLE_OMP_FOR or GIMPLE_OMP_SECTIONS. */ |
69f1837b JJ |
15101 | |
15102 | static tree | |
726a989a RB |
15103 | check_combined_parallel (gimple_stmt_iterator *gsi_p, |
15104 | bool *handled_ops_p, | |
15105 | struct walk_stmt_info *wi) | |
69f1837b | 15106 | { |
d3bfe4de | 15107 | int *info = (int *) wi->info; |
355fe088 | 15108 | gimple *stmt = gsi_stmt (*gsi_p); |
69f1837b | 15109 | |
726a989a RB |
15110 | *handled_ops_p = true; |
15111 | switch (gimple_code (stmt)) | |
69f1837b | 15112 | { |
726a989a RB |
15113 | WALK_SUBSTMTS; |
15114 | ||
15115 | case GIMPLE_OMP_FOR: | |
15116 | case GIMPLE_OMP_SECTIONS: | |
69f1837b JJ |
15117 | *info = *info == 0 ? 1 : -1; |
15118 | break; | |
15119 | default: | |
15120 | *info = -1; | |
15121 | break; | |
15122 | } | |
15123 | return NULL; | |
15124 | } | |
50674e96 | 15125 | |
a68ab351 JJ |
15126 | struct omp_taskcopy_context |
15127 | { | |
15128 | /* This field must be at the beginning, as we do "inheritance": Some | |
15129 | callback functions for tree-inline.c (e.g., omp_copy_decl) | |
15130 | receive a copy_body_data pointer that is up-casted to an | |
15131 | omp_context pointer. */ | |
15132 | copy_body_data cb; | |
15133 | omp_context *ctx; | |
15134 | }; | |
15135 | ||
15136 | static tree | |
15137 | task_copyfn_copy_decl (tree var, copy_body_data *cb) | |
15138 | { | |
15139 | struct omp_taskcopy_context *tcctx = (struct omp_taskcopy_context *) cb; | |
15140 | ||
15141 | if (splay_tree_lookup (tcctx->ctx->sfield_map, (splay_tree_key) var)) | |
b731b390 | 15142 | return create_tmp_var (TREE_TYPE (var)); |
a68ab351 JJ |
15143 | |
15144 | return var; | |
15145 | } | |
15146 | ||
15147 | static tree | |
15148 | task_copyfn_remap_type (struct omp_taskcopy_context *tcctx, tree orig_type) | |
15149 | { | |
15150 | tree name, new_fields = NULL, type, f; | |
15151 | ||
15152 | type = lang_hooks.types.make_type (RECORD_TYPE); | |
15153 | name = DECL_NAME (TYPE_NAME (orig_type)); | |
c2255bc4 AH |
15154 | name = build_decl (gimple_location (tcctx->ctx->stmt), |
15155 | TYPE_DECL, name, type); | |
a68ab351 JJ |
15156 | TYPE_NAME (type) = name; |
15157 | ||
15158 | for (f = TYPE_FIELDS (orig_type); f ; f = TREE_CHAIN (f)) | |
15159 | { | |
15160 | tree new_f = copy_node (f); | |
15161 | DECL_CONTEXT (new_f) = type; | |
15162 | TREE_TYPE (new_f) = remap_type (TREE_TYPE (f), &tcctx->cb); | |
15163 | TREE_CHAIN (new_f) = new_fields; | |
726a989a RB |
15164 | walk_tree (&DECL_SIZE (new_f), copy_tree_body_r, &tcctx->cb, NULL); |
15165 | walk_tree (&DECL_SIZE_UNIT (new_f), copy_tree_body_r, &tcctx->cb, NULL); | |
15166 | walk_tree (&DECL_FIELD_OFFSET (new_f), copy_tree_body_r, | |
15167 | &tcctx->cb, NULL); | |
a68ab351 | 15168 | new_fields = new_f; |
b787e7a2 | 15169 | tcctx->cb.decl_map->put (f, new_f); |
a68ab351 JJ |
15170 | } |
15171 | TYPE_FIELDS (type) = nreverse (new_fields); | |
15172 | layout_type (type); | |
15173 | return type; | |
15174 | } | |
15175 | ||
15176 | /* Create task copyfn. */ | |
15177 | ||
15178 | static void | |
538dd0b7 | 15179 | create_task_copyfn (gomp_task *task_stmt, omp_context *ctx) |
a68ab351 JJ |
15180 | { |
15181 | struct function *child_cfun; | |
15182 | tree child_fn, t, c, src, dst, f, sf, arg, sarg, decl; | |
15183 | tree record_type, srecord_type, bind, list; | |
15184 | bool record_needs_remap = false, srecord_needs_remap = false; | |
15185 | splay_tree_node n; | |
15186 | struct omp_taskcopy_context tcctx; | |
db3927fb | 15187 | location_t loc = gimple_location (task_stmt); |
a68ab351 | 15188 | |
726a989a | 15189 | child_fn = gimple_omp_task_copy_fn (task_stmt); |
a68ab351 JJ |
15190 | child_cfun = DECL_STRUCT_FUNCTION (child_fn); |
15191 | gcc_assert (child_cfun->cfg == NULL); | |
a68ab351 JJ |
15192 | DECL_SAVED_TREE (child_fn) = alloc_stmt_list (); |
15193 | ||
15194 | /* Reset DECL_CONTEXT on function arguments. */ | |
910ad8de | 15195 | for (t = DECL_ARGUMENTS (child_fn); t; t = DECL_CHAIN (t)) |
a68ab351 JJ |
15196 | DECL_CONTEXT (t) = child_fn; |
15197 | ||
15198 | /* Populate the function. */ | |
45852dcc | 15199 | push_gimplify_context (); |
af16bc76 | 15200 | push_cfun (child_cfun); |
a68ab351 JJ |
15201 | |
15202 | bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL); | |
15203 | TREE_SIDE_EFFECTS (bind) = 1; | |
15204 | list = NULL; | |
15205 | DECL_SAVED_TREE (child_fn) = bind; | |
726a989a | 15206 | DECL_SOURCE_LOCATION (child_fn) = gimple_location (task_stmt); |
a68ab351 JJ |
15207 | |
15208 | /* Remap src and dst argument types if needed. */ | |
15209 | record_type = ctx->record_type; | |
15210 | srecord_type = ctx->srecord_type; | |
910ad8de | 15211 | for (f = TYPE_FIELDS (record_type); f ; f = DECL_CHAIN (f)) |
a68ab351 JJ |
15212 | if (variably_modified_type_p (TREE_TYPE (f), ctx->cb.src_fn)) |
15213 | { | |
15214 | record_needs_remap = true; | |
15215 | break; | |
15216 | } | |
910ad8de | 15217 | for (f = TYPE_FIELDS (srecord_type); f ; f = DECL_CHAIN (f)) |
a68ab351 JJ |
15218 | if (variably_modified_type_p (TREE_TYPE (f), ctx->cb.src_fn)) |
15219 | { | |
15220 | srecord_needs_remap = true; | |
15221 | break; | |
15222 | } | |
15223 | ||
15224 | if (record_needs_remap || srecord_needs_remap) | |
15225 | { | |
15226 | memset (&tcctx, '\0', sizeof (tcctx)); | |
15227 | tcctx.cb.src_fn = ctx->cb.src_fn; | |
15228 | tcctx.cb.dst_fn = child_fn; | |
d52f5295 | 15229 | tcctx.cb.src_node = cgraph_node::get (tcctx.cb.src_fn); |
fe660d7b | 15230 | gcc_checking_assert (tcctx.cb.src_node); |
a68ab351 JJ |
15231 | tcctx.cb.dst_node = tcctx.cb.src_node; |
15232 | tcctx.cb.src_cfun = ctx->cb.src_cfun; | |
15233 | tcctx.cb.copy_decl = task_copyfn_copy_decl; | |
1d65f45c | 15234 | tcctx.cb.eh_lp_nr = 0; |
a68ab351 | 15235 | tcctx.cb.transform_call_graph_edges = CB_CGE_MOVE; |
b787e7a2 | 15236 | tcctx.cb.decl_map = new hash_map<tree, tree>; |
a68ab351 JJ |
15237 | tcctx.ctx = ctx; |
15238 | ||
15239 | if (record_needs_remap) | |
15240 | record_type = task_copyfn_remap_type (&tcctx, record_type); | |
15241 | if (srecord_needs_remap) | |
15242 | srecord_type = task_copyfn_remap_type (&tcctx, srecord_type); | |
15243 | } | |
15244 | else | |
15245 | tcctx.cb.decl_map = NULL; | |
15246 | ||
a68ab351 JJ |
15247 | arg = DECL_ARGUMENTS (child_fn); |
15248 | TREE_TYPE (arg) = build_pointer_type (record_type); | |
910ad8de | 15249 | sarg = DECL_CHAIN (arg); |
a68ab351 JJ |
15250 | TREE_TYPE (sarg) = build_pointer_type (srecord_type); |
15251 | ||
15252 | /* First pass: initialize temporaries used in record_type and srecord_type | |
15253 | sizes and field offsets. */ | |
15254 | if (tcctx.cb.decl_map) | |
726a989a | 15255 | for (c = gimple_omp_task_clauses (task_stmt); c; c = OMP_CLAUSE_CHAIN (c)) |
a68ab351 JJ |
15256 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE) |
15257 | { | |
15258 | tree *p; | |
15259 | ||
15260 | decl = OMP_CLAUSE_DECL (c); | |
b787e7a2 | 15261 | p = tcctx.cb.decl_map->get (decl); |
a68ab351 JJ |
15262 | if (p == NULL) |
15263 | continue; | |
15264 | n = splay_tree_lookup (ctx->sfield_map, (splay_tree_key) decl); | |
15265 | sf = (tree) n->value; | |
b787e7a2 | 15266 | sf = *tcctx.cb.decl_map->get (sf); |
70f34814 | 15267 | src = build_simple_mem_ref_loc (loc, sarg); |
a9a58711 | 15268 | src = omp_build_component_ref (src, sf); |
726a989a | 15269 | t = build2 (MODIFY_EXPR, TREE_TYPE (*p), *p, src); |
a68ab351 JJ |
15270 | append_to_statement_list (t, &list); |
15271 | } | |
15272 | ||
15273 | /* Second pass: copy shared var pointers and copy construct non-VLA | |
15274 | firstprivate vars. */ | |
726a989a | 15275 | for (c = gimple_omp_task_clauses (task_stmt); c; c = OMP_CLAUSE_CHAIN (c)) |
a68ab351 JJ |
15276 | switch (OMP_CLAUSE_CODE (c)) |
15277 | { | |
d9a6bd32 | 15278 | splay_tree_key key; |
a68ab351 JJ |
15279 | case OMP_CLAUSE_SHARED: |
15280 | decl = OMP_CLAUSE_DECL (c); | |
d9a6bd32 JJ |
15281 | key = (splay_tree_key) decl; |
15282 | if (OMP_CLAUSE_SHARED_FIRSTPRIVATE (c)) | |
15283 | key = (splay_tree_key) &DECL_UID (decl); | |
15284 | n = splay_tree_lookup (ctx->field_map, key); | |
a68ab351 JJ |
15285 | if (n == NULL) |
15286 | break; | |
15287 | f = (tree) n->value; | |
15288 | if (tcctx.cb.decl_map) | |
b787e7a2 | 15289 | f = *tcctx.cb.decl_map->get (f); |
d9a6bd32 | 15290 | n = splay_tree_lookup (ctx->sfield_map, key); |
a68ab351 JJ |
15291 | sf = (tree) n->value; |
15292 | if (tcctx.cb.decl_map) | |
b787e7a2 | 15293 | sf = *tcctx.cb.decl_map->get (sf); |
70f34814 | 15294 | src = build_simple_mem_ref_loc (loc, sarg); |
a9a58711 | 15295 | src = omp_build_component_ref (src, sf); |
70f34814 | 15296 | dst = build_simple_mem_ref_loc (loc, arg); |
a9a58711 | 15297 | dst = omp_build_component_ref (dst, f); |
726a989a | 15298 | t = build2 (MODIFY_EXPR, TREE_TYPE (dst), dst, src); |
a68ab351 JJ |
15299 | append_to_statement_list (t, &list); |
15300 | break; | |
15301 | case OMP_CLAUSE_FIRSTPRIVATE: | |
15302 | decl = OMP_CLAUSE_DECL (c); | |
15303 | if (is_variable_sized (decl)) | |
15304 | break; | |
15305 | n = splay_tree_lookup (ctx->field_map, (splay_tree_key) decl); | |
15306 | if (n == NULL) | |
15307 | break; | |
15308 | f = (tree) n->value; | |
15309 | if (tcctx.cb.decl_map) | |
b787e7a2 | 15310 | f = *tcctx.cb.decl_map->get (f); |
a68ab351 JJ |
15311 | n = splay_tree_lookup (ctx->sfield_map, (splay_tree_key) decl); |
15312 | if (n != NULL) | |
15313 | { | |
15314 | sf = (tree) n->value; | |
15315 | if (tcctx.cb.decl_map) | |
b787e7a2 | 15316 | sf = *tcctx.cb.decl_map->get (sf); |
70f34814 | 15317 | src = build_simple_mem_ref_loc (loc, sarg); |
a9a58711 | 15318 | src = omp_build_component_ref (src, sf); |
a68ab351 | 15319 | if (use_pointer_for_field (decl, NULL) || is_reference (decl)) |
70f34814 | 15320 | src = build_simple_mem_ref_loc (loc, src); |
a68ab351 JJ |
15321 | } |
15322 | else | |
15323 | src = decl; | |
70f34814 | 15324 | dst = build_simple_mem_ref_loc (loc, arg); |
a9a58711 | 15325 | dst = omp_build_component_ref (dst, f); |
a68ab351 JJ |
15326 | t = lang_hooks.decls.omp_clause_copy_ctor (c, dst, src); |
15327 | append_to_statement_list (t, &list); | |
15328 | break; | |
15329 | case OMP_CLAUSE_PRIVATE: | |
15330 | if (! OMP_CLAUSE_PRIVATE_OUTER_REF (c)) | |
15331 | break; | |
15332 | decl = OMP_CLAUSE_DECL (c); | |
15333 | n = splay_tree_lookup (ctx->field_map, (splay_tree_key) decl); | |
15334 | f = (tree) n->value; | |
15335 | if (tcctx.cb.decl_map) | |
b787e7a2 | 15336 | f = *tcctx.cb.decl_map->get (f); |
a68ab351 JJ |
15337 | n = splay_tree_lookup (ctx->sfield_map, (splay_tree_key) decl); |
15338 | if (n != NULL) | |
15339 | { | |
15340 | sf = (tree) n->value; | |
15341 | if (tcctx.cb.decl_map) | |
b787e7a2 | 15342 | sf = *tcctx.cb.decl_map->get (sf); |
70f34814 | 15343 | src = build_simple_mem_ref_loc (loc, sarg); |
a9a58711 | 15344 | src = omp_build_component_ref (src, sf); |
a68ab351 | 15345 | if (use_pointer_for_field (decl, NULL)) |
70f34814 | 15346 | src = build_simple_mem_ref_loc (loc, src); |
a68ab351 JJ |
15347 | } |
15348 | else | |
15349 | src = decl; | |
70f34814 | 15350 | dst = build_simple_mem_ref_loc (loc, arg); |
a9a58711 | 15351 | dst = omp_build_component_ref (dst, f); |
726a989a | 15352 | t = build2 (MODIFY_EXPR, TREE_TYPE (dst), dst, src); |
a68ab351 JJ |
15353 | append_to_statement_list (t, &list); |
15354 | break; | |
15355 | default: | |
15356 | break; | |
15357 | } | |
15358 | ||
15359 | /* Last pass: handle VLA firstprivates. */ | |
15360 | if (tcctx.cb.decl_map) | |
726a989a | 15361 | for (c = gimple_omp_task_clauses (task_stmt); c; c = OMP_CLAUSE_CHAIN (c)) |
a68ab351 JJ |
15362 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE) |
15363 | { | |
15364 | tree ind, ptr, df; | |
15365 | ||
15366 | decl = OMP_CLAUSE_DECL (c); | |
15367 | if (!is_variable_sized (decl)) | |
15368 | continue; | |
15369 | n = splay_tree_lookup (ctx->field_map, (splay_tree_key) decl); | |
15370 | if (n == NULL) | |
15371 | continue; | |
15372 | f = (tree) n->value; | |
b787e7a2 | 15373 | f = *tcctx.cb.decl_map->get (f); |
a68ab351 JJ |
15374 | gcc_assert (DECL_HAS_VALUE_EXPR_P (decl)); |
15375 | ind = DECL_VALUE_EXPR (decl); | |
15376 | gcc_assert (TREE_CODE (ind) == INDIRECT_REF); | |
15377 | gcc_assert (DECL_P (TREE_OPERAND (ind, 0))); | |
15378 | n = splay_tree_lookup (ctx->sfield_map, | |
15379 | (splay_tree_key) TREE_OPERAND (ind, 0)); | |
15380 | sf = (tree) n->value; | |
b787e7a2 | 15381 | sf = *tcctx.cb.decl_map->get (sf); |
70f34814 | 15382 | src = build_simple_mem_ref_loc (loc, sarg); |
a9a58711 | 15383 | src = omp_build_component_ref (src, sf); |
70f34814 RG |
15384 | src = build_simple_mem_ref_loc (loc, src); |
15385 | dst = build_simple_mem_ref_loc (loc, arg); | |
a9a58711 | 15386 | dst = omp_build_component_ref (dst, f); |
a68ab351 JJ |
15387 | t = lang_hooks.decls.omp_clause_copy_ctor (c, dst, src); |
15388 | append_to_statement_list (t, &list); | |
15389 | n = splay_tree_lookup (ctx->field_map, | |
15390 | (splay_tree_key) TREE_OPERAND (ind, 0)); | |
15391 | df = (tree) n->value; | |
b787e7a2 | 15392 | df = *tcctx.cb.decl_map->get (df); |
70f34814 | 15393 | ptr = build_simple_mem_ref_loc (loc, arg); |
a9a58711 | 15394 | ptr = omp_build_component_ref (ptr, df); |
726a989a | 15395 | t = build2 (MODIFY_EXPR, TREE_TYPE (ptr), ptr, |
db3927fb | 15396 | build_fold_addr_expr_loc (loc, dst)); |
a68ab351 JJ |
15397 | append_to_statement_list (t, &list); |
15398 | } | |
15399 | ||
15400 | t = build1 (RETURN_EXPR, void_type_node, NULL); | |
15401 | append_to_statement_list (t, &list); | |
15402 | ||
15403 | if (tcctx.cb.decl_map) | |
b787e7a2 | 15404 | delete tcctx.cb.decl_map; |
a68ab351 JJ |
15405 | pop_gimplify_context (NULL); |
15406 | BIND_EXPR_BODY (bind) = list; | |
15407 | pop_cfun (); | |
a68ab351 JJ |
15408 | } |
15409 | ||
acf0174b | 15410 | static void |
d9a6bd32 | 15411 | lower_depend_clauses (tree *pclauses, gimple_seq *iseq, gimple_seq *oseq) |
acf0174b JJ |
15412 | { |
15413 | tree c, clauses; | |
355fe088 | 15414 | gimple *g; |
acf0174b JJ |
15415 | size_t n_in = 0, n_out = 0, idx = 2, i; |
15416 | ||
d9a6bd32 | 15417 | clauses = find_omp_clause (*pclauses, OMP_CLAUSE_DEPEND); |
acf0174b JJ |
15418 | gcc_assert (clauses); |
15419 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
15420 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_DEPEND) | |
15421 | switch (OMP_CLAUSE_DEPEND_KIND (c)) | |
15422 | { | |
15423 | case OMP_CLAUSE_DEPEND_IN: | |
15424 | n_in++; | |
15425 | break; | |
15426 | case OMP_CLAUSE_DEPEND_OUT: | |
15427 | case OMP_CLAUSE_DEPEND_INOUT: | |
15428 | n_out++; | |
15429 | break; | |
d9a6bd32 JJ |
15430 | case OMP_CLAUSE_DEPEND_SOURCE: |
15431 | case OMP_CLAUSE_DEPEND_SINK: | |
15432 | /* FALLTHRU */ | |
acf0174b JJ |
15433 | default: |
15434 | gcc_unreachable (); | |
15435 | } | |
15436 | tree type = build_array_type_nelts (ptr_type_node, n_in + n_out + 2); | |
b731b390 | 15437 | tree array = create_tmp_var (type); |
d9a6bd32 | 15438 | TREE_ADDRESSABLE (array) = 1; |
acf0174b JJ |
15439 | tree r = build4 (ARRAY_REF, ptr_type_node, array, size_int (0), NULL_TREE, |
15440 | NULL_TREE); | |
15441 | g = gimple_build_assign (r, build_int_cst (ptr_type_node, n_in + n_out)); | |
15442 | gimple_seq_add_stmt (iseq, g); | |
15443 | r = build4 (ARRAY_REF, ptr_type_node, array, size_int (1), NULL_TREE, | |
15444 | NULL_TREE); | |
15445 | g = gimple_build_assign (r, build_int_cst (ptr_type_node, n_out)); | |
15446 | gimple_seq_add_stmt (iseq, g); | |
15447 | for (i = 0; i < 2; i++) | |
15448 | { | |
15449 | if ((i ? n_in : n_out) == 0) | |
15450 | continue; | |
15451 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
15452 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_DEPEND | |
15453 | && ((OMP_CLAUSE_DEPEND_KIND (c) != OMP_CLAUSE_DEPEND_IN) ^ i)) | |
15454 | { | |
15455 | tree t = OMP_CLAUSE_DECL (c); | |
15456 | t = fold_convert (ptr_type_node, t); | |
15457 | gimplify_expr (&t, iseq, NULL, is_gimple_val, fb_rvalue); | |
15458 | r = build4 (ARRAY_REF, ptr_type_node, array, size_int (idx++), | |
15459 | NULL_TREE, NULL_TREE); | |
15460 | g = gimple_build_assign (r, t); | |
15461 | gimple_seq_add_stmt (iseq, g); | |
15462 | } | |
15463 | } | |
acf0174b JJ |
15464 | c = build_omp_clause (UNKNOWN_LOCATION, OMP_CLAUSE_DEPEND); |
15465 | OMP_CLAUSE_DECL (c) = build_fold_addr_expr (array); | |
d9a6bd32 JJ |
15466 | OMP_CLAUSE_CHAIN (c) = *pclauses; |
15467 | *pclauses = c; | |
acf0174b JJ |
15468 | tree clobber = build_constructor (type, NULL); |
15469 | TREE_THIS_VOLATILE (clobber) = 1; | |
15470 | g = gimple_build_assign (array, clobber); | |
15471 | gimple_seq_add_stmt (oseq, g); | |
15472 | } | |
15473 | ||
726a989a RB |
15474 | /* Lower the OpenMP parallel or task directive in the current statement |
15475 | in GSI_P. CTX holds context information for the directive. */ | |
50674e96 DN |
15476 | |
15477 | static void | |
726a989a | 15478 | lower_omp_taskreg (gimple_stmt_iterator *gsi_p, omp_context *ctx) |
50674e96 | 15479 | { |
726a989a RB |
15480 | tree clauses; |
15481 | tree child_fn, t; | |
355fe088 | 15482 | gimple *stmt = gsi_stmt (*gsi_p); |
538dd0b7 | 15483 | gbind *par_bind, *bind, *dep_bind = NULL; |
acf0174b | 15484 | gimple_seq par_body, olist, ilist, par_olist, par_rlist, par_ilist, new_body; |
db3927fb | 15485 | location_t loc = gimple_location (stmt); |
50674e96 | 15486 | |
726a989a | 15487 | clauses = gimple_omp_taskreg_clauses (stmt); |
538dd0b7 DM |
15488 | par_bind |
15489 | = as_a <gbind *> (gimple_seq_first_stmt (gimple_omp_body (stmt))); | |
726a989a | 15490 | par_body = gimple_bind_body (par_bind); |
50674e96 | 15491 | child_fn = ctx->cb.dst_fn; |
726a989a RB |
15492 | if (gimple_code (stmt) == GIMPLE_OMP_PARALLEL |
15493 | && !gimple_omp_parallel_combined_p (stmt)) | |
69f1837b JJ |
15494 | { |
15495 | struct walk_stmt_info wi; | |
15496 | int ws_num = 0; | |
15497 | ||
15498 | memset (&wi, 0, sizeof (wi)); | |
69f1837b JJ |
15499 | wi.info = &ws_num; |
15500 | wi.val_only = true; | |
726a989a | 15501 | walk_gimple_seq (par_body, check_combined_parallel, NULL, &wi); |
69f1837b | 15502 | if (ws_num == 1) |
726a989a | 15503 | gimple_omp_parallel_set_combined_p (stmt, true); |
69f1837b | 15504 | } |
acf0174b JJ |
15505 | gimple_seq dep_ilist = NULL; |
15506 | gimple_seq dep_olist = NULL; | |
15507 | if (gimple_code (stmt) == GIMPLE_OMP_TASK | |
15508 | && find_omp_clause (clauses, OMP_CLAUSE_DEPEND)) | |
15509 | { | |
45852dcc | 15510 | push_gimplify_context (); |
acf0174b | 15511 | dep_bind = gimple_build_bind (NULL, NULL, make_node (BLOCK)); |
d9a6bd32 JJ |
15512 | lower_depend_clauses (gimple_omp_task_clauses_ptr (stmt), |
15513 | &dep_ilist, &dep_olist); | |
acf0174b JJ |
15514 | } |
15515 | ||
a68ab351 | 15516 | if (ctx->srecord_type) |
538dd0b7 | 15517 | create_task_copyfn (as_a <gomp_task *> (stmt), ctx); |
50674e96 | 15518 | |
45852dcc | 15519 | push_gimplify_context (); |
50674e96 | 15520 | |
726a989a RB |
15521 | par_olist = NULL; |
15522 | par_ilist = NULL; | |
acf0174b | 15523 | par_rlist = NULL; |
b2b40051 MJ |
15524 | bool phony_construct = gimple_code (stmt) == GIMPLE_OMP_PARALLEL |
15525 | && gimple_omp_parallel_grid_phony (as_a <gomp_parallel *> (stmt)); | |
15526 | if (phony_construct && ctx->record_type) | |
15527 | { | |
15528 | gcc_checking_assert (!ctx->receiver_decl); | |
15529 | ctx->receiver_decl = create_tmp_var | |
15530 | (build_reference_type (ctx->record_type), ".omp_rec"); | |
15531 | } | |
acf0174b | 15532 | lower_rec_input_clauses (clauses, &par_ilist, &par_olist, ctx, NULL); |
355a7673 | 15533 | lower_omp (&par_body, ctx); |
726a989a | 15534 | if (gimple_code (stmt) == GIMPLE_OMP_PARALLEL) |
acf0174b | 15535 | lower_reduction_clauses (clauses, &par_rlist, ctx); |
50674e96 DN |
15536 | |
15537 | /* Declare all the variables created by mapping and the variables | |
15538 | declared in the scope of the parallel body. */ | |
15539 | record_vars_into (ctx->block_vars, child_fn); | |
726a989a | 15540 | record_vars_into (gimple_bind_vars (par_bind), child_fn); |
50674e96 DN |
15541 | |
15542 | if (ctx->record_type) | |
15543 | { | |
a68ab351 JJ |
15544 | ctx->sender_decl |
15545 | = create_tmp_var (ctx->srecord_type ? ctx->srecord_type | |
15546 | : ctx->record_type, ".omp_data_o"); | |
cd3f04c8 | 15547 | DECL_NAMELESS (ctx->sender_decl) = 1; |
628c189e | 15548 | TREE_ADDRESSABLE (ctx->sender_decl) = 1; |
726a989a | 15549 | gimple_omp_taskreg_set_data_arg (stmt, ctx->sender_decl); |
50674e96 DN |
15550 | } |
15551 | ||
726a989a RB |
15552 | olist = NULL; |
15553 | ilist = NULL; | |
50674e96 DN |
15554 | lower_send_clauses (clauses, &ilist, &olist, ctx); |
15555 | lower_send_shared_vars (&ilist, &olist, ctx); | |
15556 | ||
acf0174b JJ |
15557 | if (ctx->record_type) |
15558 | { | |
15559 | tree clobber = build_constructor (TREE_TYPE (ctx->sender_decl), NULL); | |
15560 | TREE_THIS_VOLATILE (clobber) = 1; | |
15561 | gimple_seq_add_stmt (&olist, gimple_build_assign (ctx->sender_decl, | |
15562 | clobber)); | |
15563 | } | |
15564 | ||
50674e96 | 15565 | /* Once all the expansions are done, sequence all the different |
726a989a | 15566 | fragments inside gimple_omp_body. */ |
50674e96 | 15567 | |
726a989a | 15568 | new_body = NULL; |
50674e96 DN |
15569 | |
15570 | if (ctx->record_type) | |
15571 | { | |
db3927fb | 15572 | t = build_fold_addr_expr_loc (loc, ctx->sender_decl); |
018b899b | 15573 | /* fixup_child_record_type might have changed receiver_decl's type. */ |
db3927fb | 15574 | t = fold_convert_loc (loc, TREE_TYPE (ctx->receiver_decl), t); |
726a989a RB |
15575 | gimple_seq_add_stmt (&new_body, |
15576 | gimple_build_assign (ctx->receiver_decl, t)); | |
50674e96 DN |
15577 | } |
15578 | ||
726a989a RB |
15579 | gimple_seq_add_seq (&new_body, par_ilist); |
15580 | gimple_seq_add_seq (&new_body, par_body); | |
acf0174b JJ |
15581 | gimple_seq_add_seq (&new_body, par_rlist); |
15582 | if (ctx->cancellable) | |
15583 | gimple_seq_add_stmt (&new_body, gimple_build_label (ctx->cancel_label)); | |
726a989a RB |
15584 | gimple_seq_add_seq (&new_body, par_olist); |
15585 | new_body = maybe_catch_exception (new_body); | |
b37dddbc JJ |
15586 | if (gimple_code (stmt) == GIMPLE_OMP_TASK) |
15587 | gimple_seq_add_stmt (&new_body, | |
15588 | gimple_build_omp_continue (integer_zero_node, | |
15589 | integer_zero_node)); | |
b2b40051 MJ |
15590 | if (!phony_construct) |
15591 | { | |
15592 | gimple_seq_add_stmt (&new_body, gimple_build_omp_return (false)); | |
15593 | gimple_omp_set_body (stmt, new_body); | |
15594 | } | |
50674e96 | 15595 | |
726a989a | 15596 | bind = gimple_build_bind (NULL, NULL, gimple_bind_block (par_bind)); |
acf0174b JJ |
15597 | gsi_replace (gsi_p, dep_bind ? dep_bind : bind, true); |
15598 | gimple_bind_add_seq (bind, ilist); | |
b2b40051 MJ |
15599 | if (!phony_construct) |
15600 | gimple_bind_add_stmt (bind, stmt); | |
15601 | else | |
15602 | gimple_bind_add_seq (bind, new_body); | |
acf0174b JJ |
15603 | gimple_bind_add_seq (bind, olist); |
15604 | ||
15605 | pop_gimplify_context (NULL); | |
15606 | ||
15607 | if (dep_bind) | |
15608 | { | |
15609 | gimple_bind_add_seq (dep_bind, dep_ilist); | |
15610 | gimple_bind_add_stmt (dep_bind, bind); | |
15611 | gimple_bind_add_seq (dep_bind, dep_olist); | |
15612 | pop_gimplify_context (dep_bind); | |
15613 | } | |
15614 | } | |
15615 | ||
41dbbb37 | 15616 | /* Lower the GIMPLE_OMP_TARGET in the current statement |
acf0174b JJ |
15617 | in GSI_P. CTX holds context information for the directive. */ |
15618 | ||
15619 | static void | |
15620 | lower_omp_target (gimple_stmt_iterator *gsi_p, omp_context *ctx) | |
15621 | { | |
15622 | tree clauses; | |
15623 | tree child_fn, t, c; | |
538dd0b7 | 15624 | gomp_target *stmt = as_a <gomp_target *> (gsi_stmt (*gsi_p)); |
d9a6bd32 | 15625 | gbind *tgt_bind, *bind, *dep_bind = NULL; |
182190f2 | 15626 | gimple_seq tgt_body, olist, ilist, fplist, new_body; |
acf0174b | 15627 | location_t loc = gimple_location (stmt); |
41dbbb37 | 15628 | bool offloaded, data_region; |
acf0174b | 15629 | unsigned int map_cnt = 0; |
d9a6bd32 | 15630 | bool has_depend = false; |
acf0174b | 15631 | |
41dbbb37 TS |
15632 | offloaded = is_gimple_omp_offloaded (stmt); |
15633 | switch (gimple_omp_target_kind (stmt)) | |
15634 | { | |
15635 | case GF_OMP_TARGET_KIND_REGION: | |
15636 | case GF_OMP_TARGET_KIND_UPDATE: | |
d9a6bd32 JJ |
15637 | case GF_OMP_TARGET_KIND_ENTER_DATA: |
15638 | case GF_OMP_TARGET_KIND_EXIT_DATA: | |
41dbbb37 TS |
15639 | case GF_OMP_TARGET_KIND_OACC_PARALLEL: |
15640 | case GF_OMP_TARGET_KIND_OACC_KERNELS: | |
15641 | case GF_OMP_TARGET_KIND_OACC_UPDATE: | |
15642 | case GF_OMP_TARGET_KIND_OACC_ENTER_EXIT_DATA: | |
6e232ba4 | 15643 | case GF_OMP_TARGET_KIND_OACC_DECLARE: |
41dbbb37 TS |
15644 | data_region = false; |
15645 | break; | |
15646 | case GF_OMP_TARGET_KIND_DATA: | |
15647 | case GF_OMP_TARGET_KIND_OACC_DATA: | |
37d5ad46 | 15648 | case GF_OMP_TARGET_KIND_OACC_HOST_DATA: |
41dbbb37 TS |
15649 | data_region = true; |
15650 | break; | |
15651 | default: | |
15652 | gcc_unreachable (); | |
15653 | } | |
15654 | ||
acf0174b | 15655 | clauses = gimple_omp_target_clauses (stmt); |
41dbbb37 | 15656 | |
d9a6bd32 JJ |
15657 | gimple_seq dep_ilist = NULL; |
15658 | gimple_seq dep_olist = NULL; | |
15659 | if (find_omp_clause (clauses, OMP_CLAUSE_DEPEND)) | |
15660 | { | |
15661 | push_gimplify_context (); | |
15662 | dep_bind = gimple_build_bind (NULL, NULL, make_node (BLOCK)); | |
15663 | lower_depend_clauses (gimple_omp_target_clauses_ptr (stmt), | |
15664 | &dep_ilist, &dep_olist); | |
15665 | has_depend = true; | |
15666 | } | |
15667 | ||
41dbbb37 TS |
15668 | tgt_bind = NULL; |
15669 | tgt_body = NULL; | |
15670 | if (offloaded) | |
acf0174b | 15671 | { |
538dd0b7 | 15672 | tgt_bind = gimple_seq_first_stmt_as_a_bind (gimple_omp_body (stmt)); |
acf0174b JJ |
15673 | tgt_body = gimple_bind_body (tgt_bind); |
15674 | } | |
41dbbb37 | 15675 | else if (data_region) |
acf0174b JJ |
15676 | tgt_body = gimple_omp_body (stmt); |
15677 | child_fn = ctx->cb.dst_fn; | |
15678 | ||
45852dcc | 15679 | push_gimplify_context (); |
182190f2 | 15680 | fplist = NULL; |
acf0174b JJ |
15681 | |
15682 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
15683 | switch (OMP_CLAUSE_CODE (c)) | |
15684 | { | |
15685 | tree var, x; | |
15686 | ||
15687 | default: | |
15688 | break; | |
15689 | case OMP_CLAUSE_MAP: | |
b2b29377 | 15690 | #if CHECKING_P |
41dbbb37 TS |
15691 | /* First check what we're prepared to handle in the following. */ |
15692 | switch (OMP_CLAUSE_MAP_KIND (c)) | |
15693 | { | |
15694 | case GOMP_MAP_ALLOC: | |
15695 | case GOMP_MAP_TO: | |
15696 | case GOMP_MAP_FROM: | |
15697 | case GOMP_MAP_TOFROM: | |
15698 | case GOMP_MAP_POINTER: | |
15699 | case GOMP_MAP_TO_PSET: | |
d9a6bd32 JJ |
15700 | case GOMP_MAP_FORCE_DEALLOC: |
15701 | case GOMP_MAP_RELEASE: | |
15702 | case GOMP_MAP_ALWAYS_TO: | |
15703 | case GOMP_MAP_ALWAYS_FROM: | |
15704 | case GOMP_MAP_ALWAYS_TOFROM: | |
15705 | case GOMP_MAP_FIRSTPRIVATE_POINTER: | |
e01d41e5 | 15706 | case GOMP_MAP_FIRSTPRIVATE_REFERENCE: |
d9a6bd32 | 15707 | case GOMP_MAP_STRUCT: |
e01d41e5 | 15708 | case GOMP_MAP_ALWAYS_POINTER: |
41dbbb37 TS |
15709 | break; |
15710 | case GOMP_MAP_FORCE_ALLOC: | |
15711 | case GOMP_MAP_FORCE_TO: | |
15712 | case GOMP_MAP_FORCE_FROM: | |
15713 | case GOMP_MAP_FORCE_TOFROM: | |
15714 | case GOMP_MAP_FORCE_PRESENT: | |
41dbbb37 | 15715 | case GOMP_MAP_FORCE_DEVICEPTR: |
6e232ba4 JN |
15716 | case GOMP_MAP_DEVICE_RESIDENT: |
15717 | case GOMP_MAP_LINK: | |
41dbbb37 TS |
15718 | gcc_assert (is_gimple_omp_oacc (stmt)); |
15719 | break; | |
15720 | default: | |
15721 | gcc_unreachable (); | |
15722 | } | |
15723 | #endif | |
15724 | /* FALLTHRU */ | |
acf0174b JJ |
15725 | case OMP_CLAUSE_TO: |
15726 | case OMP_CLAUSE_FROM: | |
182190f2 | 15727 | oacc_firstprivate: |
acf0174b JJ |
15728 | var = OMP_CLAUSE_DECL (c); |
15729 | if (!DECL_P (var)) | |
15730 | { | |
15731 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_MAP | |
d9a6bd32 JJ |
15732 | || (!OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION (c) |
15733 | && (OMP_CLAUSE_MAP_KIND (c) | |
15734 | != GOMP_MAP_FIRSTPRIVATE_POINTER))) | |
acf0174b JJ |
15735 | map_cnt++; |
15736 | continue; | |
15737 | } | |
15738 | ||
15739 | if (DECL_SIZE (var) | |
15740 | && TREE_CODE (DECL_SIZE (var)) != INTEGER_CST) | |
15741 | { | |
15742 | tree var2 = DECL_VALUE_EXPR (var); | |
15743 | gcc_assert (TREE_CODE (var2) == INDIRECT_REF); | |
15744 | var2 = TREE_OPERAND (var2, 0); | |
15745 | gcc_assert (DECL_P (var2)); | |
15746 | var = var2; | |
15747 | } | |
15748 | ||
d9a6bd32 | 15749 | if (offloaded |
182190f2 | 15750 | && OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP |
e01d41e5 JJ |
15751 | && (OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_FIRSTPRIVATE_POINTER |
15752 | || OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_FIRSTPRIVATE_REFERENCE)) | |
d9a6bd32 JJ |
15753 | { |
15754 | if (TREE_CODE (TREE_TYPE (var)) == ARRAY_TYPE) | |
15755 | { | |
15756 | if (is_global_var (maybe_lookup_decl_in_outer_ctx (var, ctx)) | |
15757 | && varpool_node::get_create (var)->offloadable) | |
15758 | continue; | |
15759 | ||
15760 | tree type = build_pointer_type (TREE_TYPE (var)); | |
15761 | tree new_var = lookup_decl (var, ctx); | |
15762 | x = create_tmp_var_raw (type, get_name (new_var)); | |
15763 | gimple_add_tmp_var (x); | |
15764 | x = build_simple_mem_ref (x); | |
15765 | SET_DECL_VALUE_EXPR (new_var, x); | |
15766 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
15767 | } | |
15768 | continue; | |
15769 | } | |
15770 | ||
acf0174b JJ |
15771 | if (!maybe_lookup_field (var, ctx)) |
15772 | continue; | |
15773 | ||
41dbbb37 | 15774 | if (offloaded) |
acf0174b JJ |
15775 | { |
15776 | x = build_receiver_ref (var, true, ctx); | |
15777 | tree new_var = lookup_decl (var, ctx); | |
d9a6bd32 | 15778 | |
182190f2 NS |
15779 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP |
15780 | && OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_POINTER | |
acf0174b JJ |
15781 | && !OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION (c) |
15782 | && TREE_CODE (TREE_TYPE (var)) == ARRAY_TYPE) | |
15783 | x = build_simple_mem_ref (x); | |
182190f2 NS |
15784 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE) |
15785 | { | |
15786 | gcc_assert (is_gimple_omp_oacc (ctx->stmt)); | |
15787 | if (is_reference (new_var)) | |
15788 | { | |
15789 | /* Create a local object to hold the instance | |
15790 | value. */ | |
15791 | tree type = TREE_TYPE (TREE_TYPE (new_var)); | |
15792 | const char *id = IDENTIFIER_POINTER (DECL_NAME (new_var)); | |
15793 | tree inst = create_tmp_var (type, id); | |
15794 | gimplify_assign (inst, fold_indirect_ref (x), &fplist); | |
15795 | x = build_fold_addr_expr (inst); | |
15796 | } | |
15797 | gimplify_assign (new_var, x, &fplist); | |
15798 | } | |
15799 | else if (DECL_P (new_var)) | |
15800 | { | |
15801 | SET_DECL_VALUE_EXPR (new_var, x); | |
15802 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
15803 | } | |
15804 | else | |
15805 | gcc_unreachable (); | |
acf0174b JJ |
15806 | } |
15807 | map_cnt++; | |
d9a6bd32 JJ |
15808 | break; |
15809 | ||
15810 | case OMP_CLAUSE_FIRSTPRIVATE: | |
182190f2 NS |
15811 | if (is_oacc_parallel (ctx)) |
15812 | goto oacc_firstprivate; | |
d9a6bd32 JJ |
15813 | map_cnt++; |
15814 | var = OMP_CLAUSE_DECL (c); | |
15815 | if (!is_reference (var) | |
15816 | && !is_gimple_reg_type (TREE_TYPE (var))) | |
15817 | { | |
15818 | tree new_var = lookup_decl (var, ctx); | |
15819 | if (is_variable_sized (var)) | |
15820 | { | |
15821 | tree pvar = DECL_VALUE_EXPR (var); | |
15822 | gcc_assert (TREE_CODE (pvar) == INDIRECT_REF); | |
15823 | pvar = TREE_OPERAND (pvar, 0); | |
15824 | gcc_assert (DECL_P (pvar)); | |
15825 | tree new_pvar = lookup_decl (pvar, ctx); | |
15826 | x = build_fold_indirect_ref (new_pvar); | |
15827 | TREE_THIS_NOTRAP (x) = 1; | |
15828 | } | |
15829 | else | |
15830 | x = build_receiver_ref (var, true, ctx); | |
15831 | SET_DECL_VALUE_EXPR (new_var, x); | |
15832 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
15833 | } | |
15834 | break; | |
15835 | ||
15836 | case OMP_CLAUSE_PRIVATE: | |
182190f2 NS |
15837 | if (is_gimple_omp_oacc (ctx->stmt)) |
15838 | break; | |
d9a6bd32 JJ |
15839 | var = OMP_CLAUSE_DECL (c); |
15840 | if (is_variable_sized (var)) | |
15841 | { | |
15842 | tree new_var = lookup_decl (var, ctx); | |
15843 | tree pvar = DECL_VALUE_EXPR (var); | |
15844 | gcc_assert (TREE_CODE (pvar) == INDIRECT_REF); | |
15845 | pvar = TREE_OPERAND (pvar, 0); | |
15846 | gcc_assert (DECL_P (pvar)); | |
15847 | tree new_pvar = lookup_decl (pvar, ctx); | |
15848 | x = build_fold_indirect_ref (new_pvar); | |
15849 | TREE_THIS_NOTRAP (x) = 1; | |
15850 | SET_DECL_VALUE_EXPR (new_var, x); | |
15851 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
15852 | } | |
15853 | break; | |
15854 | ||
15855 | case OMP_CLAUSE_USE_DEVICE_PTR: | |
15856 | case OMP_CLAUSE_IS_DEVICE_PTR: | |
15857 | var = OMP_CLAUSE_DECL (c); | |
15858 | map_cnt++; | |
15859 | if (is_variable_sized (var)) | |
15860 | { | |
15861 | tree new_var = lookup_decl (var, ctx); | |
15862 | tree pvar = DECL_VALUE_EXPR (var); | |
15863 | gcc_assert (TREE_CODE (pvar) == INDIRECT_REF); | |
15864 | pvar = TREE_OPERAND (pvar, 0); | |
15865 | gcc_assert (DECL_P (pvar)); | |
15866 | tree new_pvar = lookup_decl (pvar, ctx); | |
15867 | x = build_fold_indirect_ref (new_pvar); | |
15868 | TREE_THIS_NOTRAP (x) = 1; | |
15869 | SET_DECL_VALUE_EXPR (new_var, x); | |
15870 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
15871 | } | |
15872 | else if (TREE_CODE (TREE_TYPE (var)) == ARRAY_TYPE) | |
15873 | { | |
15874 | tree new_var = lookup_decl (var, ctx); | |
15875 | tree type = build_pointer_type (TREE_TYPE (var)); | |
15876 | x = create_tmp_var_raw (type, get_name (new_var)); | |
15877 | gimple_add_tmp_var (x); | |
15878 | x = build_simple_mem_ref (x); | |
15879 | SET_DECL_VALUE_EXPR (new_var, x); | |
15880 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
15881 | } | |
15882 | break; | |
acf0174b JJ |
15883 | } |
15884 | ||
41dbbb37 | 15885 | if (offloaded) |
acf0174b JJ |
15886 | { |
15887 | target_nesting_level++; | |
15888 | lower_omp (&tgt_body, ctx); | |
15889 | target_nesting_level--; | |
15890 | } | |
41dbbb37 | 15891 | else if (data_region) |
acf0174b JJ |
15892 | lower_omp (&tgt_body, ctx); |
15893 | ||
41dbbb37 | 15894 | if (offloaded) |
acf0174b JJ |
15895 | { |
15896 | /* Declare all the variables created by mapping and the variables | |
15897 | declared in the scope of the target body. */ | |
15898 | record_vars_into (ctx->block_vars, child_fn); | |
15899 | record_vars_into (gimple_bind_vars (tgt_bind), child_fn); | |
15900 | } | |
15901 | ||
15902 | olist = NULL; | |
15903 | ilist = NULL; | |
15904 | if (ctx->record_type) | |
15905 | { | |
15906 | ctx->sender_decl | |
15907 | = create_tmp_var (ctx->record_type, ".omp_data_arr"); | |
15908 | DECL_NAMELESS (ctx->sender_decl) = 1; | |
15909 | TREE_ADDRESSABLE (ctx->sender_decl) = 1; | |
15910 | t = make_tree_vec (3); | |
15911 | TREE_VEC_ELT (t, 0) = ctx->sender_decl; | |
15912 | TREE_VEC_ELT (t, 1) | |
15913 | = create_tmp_var (build_array_type_nelts (size_type_node, map_cnt), | |
15914 | ".omp_data_sizes"); | |
15915 | DECL_NAMELESS (TREE_VEC_ELT (t, 1)) = 1; | |
15916 | TREE_ADDRESSABLE (TREE_VEC_ELT (t, 1)) = 1; | |
15917 | TREE_STATIC (TREE_VEC_ELT (t, 1)) = 1; | |
d9a6bd32 JJ |
15918 | tree tkind_type = short_unsigned_type_node; |
15919 | int talign_shift = 8; | |
acf0174b | 15920 | TREE_VEC_ELT (t, 2) |
41dbbb37 | 15921 | = create_tmp_var (build_array_type_nelts (tkind_type, map_cnt), |
acf0174b JJ |
15922 | ".omp_data_kinds"); |
15923 | DECL_NAMELESS (TREE_VEC_ELT (t, 2)) = 1; | |
15924 | TREE_ADDRESSABLE (TREE_VEC_ELT (t, 2)) = 1; | |
15925 | TREE_STATIC (TREE_VEC_ELT (t, 2)) = 1; | |
15926 | gimple_omp_target_set_data_arg (stmt, t); | |
15927 | ||
15928 | vec<constructor_elt, va_gc> *vsize; | |
15929 | vec<constructor_elt, va_gc> *vkind; | |
15930 | vec_alloc (vsize, map_cnt); | |
15931 | vec_alloc (vkind, map_cnt); | |
15932 | unsigned int map_idx = 0; | |
15933 | ||
15934 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
15935 | switch (OMP_CLAUSE_CODE (c)) | |
15936 | { | |
d9a6bd32 JJ |
15937 | tree ovar, nc, s, purpose, var, x, type; |
15938 | unsigned int talign; | |
acf0174b JJ |
15939 | |
15940 | default: | |
15941 | break; | |
182190f2 | 15942 | |
acf0174b JJ |
15943 | case OMP_CLAUSE_MAP: |
15944 | case OMP_CLAUSE_TO: | |
15945 | case OMP_CLAUSE_FROM: | |
182190f2 | 15946 | oacc_firstprivate_map: |
acf0174b JJ |
15947 | nc = c; |
15948 | ovar = OMP_CLAUSE_DECL (c); | |
d9a6bd32 | 15949 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP |
e01d41e5 JJ |
15950 | && (OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_FIRSTPRIVATE_POINTER |
15951 | || (OMP_CLAUSE_MAP_KIND (c) | |
15952 | == GOMP_MAP_FIRSTPRIVATE_REFERENCE))) | |
d9a6bd32 | 15953 | break; |
acf0174b JJ |
15954 | if (!DECL_P (ovar)) |
15955 | { | |
15956 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP | |
15957 | && OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION (c)) | |
15958 | { | |
15959 | gcc_checking_assert (OMP_CLAUSE_DECL (OMP_CLAUSE_CHAIN (c)) | |
15960 | == get_base_address (ovar)); | |
15961 | nc = OMP_CLAUSE_CHAIN (c); | |
15962 | ovar = OMP_CLAUSE_DECL (nc); | |
15963 | } | |
15964 | else | |
15965 | { | |
15966 | tree x = build_sender_ref (ovar, ctx); | |
15967 | tree v | |
15968 | = build_fold_addr_expr_with_type (ovar, ptr_type_node); | |
15969 | gimplify_assign (x, v, &ilist); | |
15970 | nc = NULL_TREE; | |
15971 | } | |
15972 | } | |
15973 | else | |
15974 | { | |
15975 | if (DECL_SIZE (ovar) | |
15976 | && TREE_CODE (DECL_SIZE (ovar)) != INTEGER_CST) | |
15977 | { | |
15978 | tree ovar2 = DECL_VALUE_EXPR (ovar); | |
15979 | gcc_assert (TREE_CODE (ovar2) == INDIRECT_REF); | |
15980 | ovar2 = TREE_OPERAND (ovar2, 0); | |
15981 | gcc_assert (DECL_P (ovar2)); | |
15982 | ovar = ovar2; | |
15983 | } | |
e01d41e5 | 15984 | if (!maybe_lookup_field (ovar, ctx)) |
acf0174b JJ |
15985 | continue; |
15986 | } | |
15987 | ||
d9a6bd32 | 15988 | talign = TYPE_ALIGN_UNIT (TREE_TYPE (ovar)); |
0fe81a0f JJ |
15989 | if (DECL_P (ovar) && DECL_ALIGN_UNIT (ovar) > talign) |
15990 | talign = DECL_ALIGN_UNIT (ovar); | |
acf0174b JJ |
15991 | if (nc) |
15992 | { | |
d9a6bd32 | 15993 | var = lookup_decl_in_outer_ctx (ovar, ctx); |
e01d41e5 | 15994 | x = build_sender_ref (ovar, ctx); |
b76e9910 NS |
15995 | |
15996 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP | |
182190f2 NS |
15997 | && OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_POINTER |
15998 | && !OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION (c) | |
15999 | && TREE_CODE (TREE_TYPE (ovar)) == ARRAY_TYPE) | |
acf0174b | 16000 | { |
41dbbb37 | 16001 | gcc_assert (offloaded); |
acf0174b | 16002 | tree avar |
b731b390 | 16003 | = create_tmp_var (TREE_TYPE (TREE_TYPE (x))); |
acf0174b JJ |
16004 | mark_addressable (avar); |
16005 | gimplify_assign (avar, build_fold_addr_expr (var), &ilist); | |
0fe81a0f | 16006 | talign = DECL_ALIGN_UNIT (avar); |
acf0174b JJ |
16007 | avar = build_fold_addr_expr (avar); |
16008 | gimplify_assign (x, avar, &ilist); | |
16009 | } | |
182190f2 NS |
16010 | else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE) |
16011 | { | |
16012 | gcc_assert (is_gimple_omp_oacc (ctx->stmt)); | |
16013 | if (!is_reference (var)) | |
16014 | var = build_fold_addr_expr (var); | |
16015 | else | |
16016 | talign = TYPE_ALIGN_UNIT (TREE_TYPE (TREE_TYPE (ovar))); | |
16017 | gimplify_assign (x, var, &ilist); | |
16018 | } | |
acf0174b JJ |
16019 | else if (is_gimple_reg (var)) |
16020 | { | |
41dbbb37 | 16021 | gcc_assert (offloaded); |
b731b390 | 16022 | tree avar = create_tmp_var (TREE_TYPE (var)); |
acf0174b | 16023 | mark_addressable (avar); |
41dbbb37 TS |
16024 | enum gomp_map_kind map_kind = OMP_CLAUSE_MAP_KIND (c); |
16025 | if (GOMP_MAP_COPY_TO_P (map_kind) | |
16026 | || map_kind == GOMP_MAP_POINTER | |
16027 | || map_kind == GOMP_MAP_TO_PSET | |
16028 | || map_kind == GOMP_MAP_FORCE_DEVICEPTR) | |
acf0174b JJ |
16029 | gimplify_assign (avar, var, &ilist); |
16030 | avar = build_fold_addr_expr (avar); | |
16031 | gimplify_assign (x, avar, &ilist); | |
41dbbb37 TS |
16032 | if ((GOMP_MAP_COPY_FROM_P (map_kind) |
16033 | || map_kind == GOMP_MAP_FORCE_DEVICEPTR) | |
acf0174b JJ |
16034 | && !TYPE_READONLY (TREE_TYPE (var))) |
16035 | { | |
d9a6bd32 | 16036 | x = unshare_expr (x); |
acf0174b JJ |
16037 | x = build_simple_mem_ref (x); |
16038 | gimplify_assign (var, x, &olist); | |
16039 | } | |
16040 | } | |
16041 | else | |
16042 | { | |
16043 | var = build_fold_addr_expr (var); | |
16044 | gimplify_assign (x, var, &ilist); | |
16045 | } | |
16046 | } | |
182190f2 NS |
16047 | s = NULL_TREE; |
16048 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE) | |
16049 | { | |
16050 | gcc_checking_assert (is_gimple_omp_oacc (ctx->stmt)); | |
16051 | s = TREE_TYPE (ovar); | |
16052 | if (TREE_CODE (s) == REFERENCE_TYPE) | |
16053 | s = TREE_TYPE (s); | |
16054 | s = TYPE_SIZE_UNIT (s); | |
16055 | } | |
16056 | else | |
16057 | s = OMP_CLAUSE_SIZE (c); | |
acf0174b JJ |
16058 | if (s == NULL_TREE) |
16059 | s = TYPE_SIZE_UNIT (TREE_TYPE (ovar)); | |
16060 | s = fold_convert (size_type_node, s); | |
d9a6bd32 | 16061 | purpose = size_int (map_idx++); |
acf0174b JJ |
16062 | CONSTRUCTOR_APPEND_ELT (vsize, purpose, s); |
16063 | if (TREE_CODE (s) != INTEGER_CST) | |
16064 | TREE_STATIC (TREE_VEC_ELT (t, 1)) = 0; | |
16065 | ||
d9a6bd32 | 16066 | unsigned HOST_WIDE_INT tkind, tkind_zero; |
acf0174b JJ |
16067 | switch (OMP_CLAUSE_CODE (c)) |
16068 | { | |
16069 | case OMP_CLAUSE_MAP: | |
16070 | tkind = OMP_CLAUSE_MAP_KIND (c); | |
d9a6bd32 JJ |
16071 | tkind_zero = tkind; |
16072 | if (OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c)) | |
16073 | switch (tkind) | |
16074 | { | |
16075 | case GOMP_MAP_ALLOC: | |
16076 | case GOMP_MAP_TO: | |
16077 | case GOMP_MAP_FROM: | |
16078 | case GOMP_MAP_TOFROM: | |
16079 | case GOMP_MAP_ALWAYS_TO: | |
16080 | case GOMP_MAP_ALWAYS_FROM: | |
16081 | case GOMP_MAP_ALWAYS_TOFROM: | |
16082 | case GOMP_MAP_RELEASE: | |
16083 | tkind_zero = GOMP_MAP_ZERO_LEN_ARRAY_SECTION; | |
16084 | break; | |
16085 | case GOMP_MAP_DELETE: | |
16086 | tkind_zero = GOMP_MAP_DELETE_ZERO_LEN_ARRAY_SECTION; | |
16087 | default: | |
16088 | break; | |
16089 | } | |
16090 | if (tkind_zero != tkind) | |
16091 | { | |
16092 | if (integer_zerop (s)) | |
16093 | tkind = tkind_zero; | |
16094 | else if (integer_nonzerop (s)) | |
16095 | tkind_zero = tkind; | |
16096 | } | |
acf0174b | 16097 | break; |
182190f2 NS |
16098 | case OMP_CLAUSE_FIRSTPRIVATE: |
16099 | gcc_checking_assert (is_gimple_omp_oacc (ctx->stmt)); | |
16100 | tkind = GOMP_MAP_TO; | |
16101 | tkind_zero = tkind; | |
16102 | break; | |
acf0174b | 16103 | case OMP_CLAUSE_TO: |
41dbbb37 | 16104 | tkind = GOMP_MAP_TO; |
d9a6bd32 | 16105 | tkind_zero = tkind; |
acf0174b JJ |
16106 | break; |
16107 | case OMP_CLAUSE_FROM: | |
41dbbb37 | 16108 | tkind = GOMP_MAP_FROM; |
d9a6bd32 | 16109 | tkind_zero = tkind; |
acf0174b JJ |
16110 | break; |
16111 | default: | |
16112 | gcc_unreachable (); | |
16113 | } | |
41dbbb37 TS |
16114 | gcc_checking_assert (tkind |
16115 | < (HOST_WIDE_INT_C (1U) << talign_shift)); | |
d9a6bd32 JJ |
16116 | gcc_checking_assert (tkind_zero |
16117 | < (HOST_WIDE_INT_C (1U) << talign_shift)); | |
acf0174b | 16118 | talign = ceil_log2 (talign); |
41dbbb37 | 16119 | tkind |= talign << talign_shift; |
d9a6bd32 | 16120 | tkind_zero |= talign << talign_shift; |
41dbbb37 TS |
16121 | gcc_checking_assert (tkind |
16122 | <= tree_to_uhwi (TYPE_MAX_VALUE (tkind_type))); | |
d9a6bd32 JJ |
16123 | gcc_checking_assert (tkind_zero |
16124 | <= tree_to_uhwi (TYPE_MAX_VALUE (tkind_type))); | |
16125 | if (tkind == tkind_zero) | |
16126 | x = build_int_cstu (tkind_type, tkind); | |
16127 | else | |
16128 | { | |
16129 | TREE_STATIC (TREE_VEC_ELT (t, 2)) = 0; | |
16130 | x = build3 (COND_EXPR, tkind_type, | |
16131 | fold_build2 (EQ_EXPR, boolean_type_node, | |
16132 | unshare_expr (s), size_zero_node), | |
16133 | build_int_cstu (tkind_type, tkind_zero), | |
16134 | build_int_cstu (tkind_type, tkind)); | |
16135 | } | |
16136 | CONSTRUCTOR_APPEND_ELT (vkind, purpose, x); | |
acf0174b JJ |
16137 | if (nc && nc != c) |
16138 | c = nc; | |
d9a6bd32 JJ |
16139 | break; |
16140 | ||
16141 | case OMP_CLAUSE_FIRSTPRIVATE: | |
182190f2 NS |
16142 | if (is_oacc_parallel (ctx)) |
16143 | goto oacc_firstprivate_map; | |
d9a6bd32 JJ |
16144 | ovar = OMP_CLAUSE_DECL (c); |
16145 | if (is_reference (ovar)) | |
16146 | talign = TYPE_ALIGN_UNIT (TREE_TYPE (TREE_TYPE (ovar))); | |
16147 | else | |
16148 | talign = DECL_ALIGN_UNIT (ovar); | |
16149 | var = lookup_decl_in_outer_ctx (ovar, ctx); | |
16150 | x = build_sender_ref (ovar, ctx); | |
16151 | tkind = GOMP_MAP_FIRSTPRIVATE; | |
16152 | type = TREE_TYPE (ovar); | |
16153 | if (is_reference (ovar)) | |
16154 | type = TREE_TYPE (type); | |
16155 | bool use_firstprivate_int, force_addr; | |
16156 | use_firstprivate_int = false; | |
16157 | force_addr = false; | |
16158 | if ((INTEGRAL_TYPE_P (type) | |
16159 | && TYPE_PRECISION (type) <= POINTER_SIZE) | |
16160 | || TREE_CODE (type) == POINTER_TYPE) | |
16161 | use_firstprivate_int = true; | |
16162 | if (has_depend) | |
16163 | { | |
16164 | if (is_reference (var)) | |
16165 | use_firstprivate_int = false; | |
16166 | else if (is_gimple_reg (var)) | |
16167 | { | |
16168 | if (DECL_HAS_VALUE_EXPR_P (var)) | |
16169 | { | |
16170 | tree v = get_base_address (var); | |
16171 | if (DECL_P (v) && TREE_ADDRESSABLE (v)) | |
16172 | { | |
16173 | use_firstprivate_int = false; | |
16174 | force_addr = true; | |
16175 | } | |
16176 | else | |
16177 | switch (TREE_CODE (v)) | |
16178 | { | |
16179 | case INDIRECT_REF: | |
16180 | case MEM_REF: | |
16181 | use_firstprivate_int = false; | |
16182 | force_addr = true; | |
16183 | break; | |
16184 | default: | |
16185 | break; | |
16186 | } | |
16187 | } | |
16188 | } | |
16189 | else | |
16190 | use_firstprivate_int = false; | |
16191 | } | |
16192 | if (use_firstprivate_int) | |
16193 | { | |
16194 | tkind = GOMP_MAP_FIRSTPRIVATE_INT; | |
16195 | tree t = var; | |
16196 | if (is_reference (var)) | |
16197 | t = build_simple_mem_ref (var); | |
16198 | if (TREE_CODE (type) != POINTER_TYPE) | |
16199 | t = fold_convert (pointer_sized_int_node, t); | |
16200 | t = fold_convert (TREE_TYPE (x), t); | |
16201 | gimplify_assign (x, t, &ilist); | |
16202 | } | |
16203 | else if (is_reference (var)) | |
16204 | gimplify_assign (x, var, &ilist); | |
16205 | else if (!force_addr && is_gimple_reg (var)) | |
16206 | { | |
16207 | tree avar = create_tmp_var (TREE_TYPE (var)); | |
16208 | mark_addressable (avar); | |
16209 | gimplify_assign (avar, var, &ilist); | |
16210 | avar = build_fold_addr_expr (avar); | |
16211 | gimplify_assign (x, avar, &ilist); | |
16212 | } | |
16213 | else | |
16214 | { | |
16215 | var = build_fold_addr_expr (var); | |
16216 | gimplify_assign (x, var, &ilist); | |
16217 | } | |
16218 | if (tkind == GOMP_MAP_FIRSTPRIVATE_INT) | |
16219 | s = size_int (0); | |
16220 | else if (is_reference (var)) | |
16221 | s = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (ovar))); | |
16222 | else | |
16223 | s = TYPE_SIZE_UNIT (TREE_TYPE (ovar)); | |
16224 | s = fold_convert (size_type_node, s); | |
16225 | purpose = size_int (map_idx++); | |
16226 | CONSTRUCTOR_APPEND_ELT (vsize, purpose, s); | |
16227 | if (TREE_CODE (s) != INTEGER_CST) | |
16228 | TREE_STATIC (TREE_VEC_ELT (t, 1)) = 0; | |
16229 | ||
16230 | gcc_checking_assert (tkind | |
16231 | < (HOST_WIDE_INT_C (1U) << talign_shift)); | |
16232 | talign = ceil_log2 (talign); | |
16233 | tkind |= talign << talign_shift; | |
16234 | gcc_checking_assert (tkind | |
16235 | <= tree_to_uhwi (TYPE_MAX_VALUE (tkind_type))); | |
16236 | CONSTRUCTOR_APPEND_ELT (vkind, purpose, | |
16237 | build_int_cstu (tkind_type, tkind)); | |
16238 | break; | |
16239 | ||
16240 | case OMP_CLAUSE_USE_DEVICE_PTR: | |
16241 | case OMP_CLAUSE_IS_DEVICE_PTR: | |
16242 | ovar = OMP_CLAUSE_DECL (c); | |
16243 | var = lookup_decl_in_outer_ctx (ovar, ctx); | |
16244 | x = build_sender_ref (ovar, ctx); | |
c7b48c8a | 16245 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_USE_DEVICE_PTR) |
d9a6bd32 JJ |
16246 | tkind = GOMP_MAP_USE_DEVICE_PTR; |
16247 | else | |
16248 | tkind = GOMP_MAP_FIRSTPRIVATE_INT; | |
16249 | type = TREE_TYPE (ovar); | |
16250 | if (TREE_CODE (type) == ARRAY_TYPE) | |
16251 | var = build_fold_addr_expr (var); | |
16252 | else | |
16253 | { | |
16254 | if (is_reference (ovar)) | |
16255 | { | |
16256 | type = TREE_TYPE (type); | |
16257 | if (TREE_CODE (type) != ARRAY_TYPE) | |
16258 | var = build_simple_mem_ref (var); | |
16259 | var = fold_convert (TREE_TYPE (x), var); | |
16260 | } | |
16261 | } | |
16262 | gimplify_assign (x, var, &ilist); | |
16263 | s = size_int (0); | |
16264 | purpose = size_int (map_idx++); | |
16265 | CONSTRUCTOR_APPEND_ELT (vsize, purpose, s); | |
16266 | gcc_checking_assert (tkind | |
16267 | < (HOST_WIDE_INT_C (1U) << talign_shift)); | |
16268 | gcc_checking_assert (tkind | |
16269 | <= tree_to_uhwi (TYPE_MAX_VALUE (tkind_type))); | |
16270 | CONSTRUCTOR_APPEND_ELT (vkind, purpose, | |
16271 | build_int_cstu (tkind_type, tkind)); | |
16272 | break; | |
acf0174b JJ |
16273 | } |
16274 | ||
16275 | gcc_assert (map_idx == map_cnt); | |
16276 | ||
16277 | DECL_INITIAL (TREE_VEC_ELT (t, 1)) | |
16278 | = build_constructor (TREE_TYPE (TREE_VEC_ELT (t, 1)), vsize); | |
16279 | DECL_INITIAL (TREE_VEC_ELT (t, 2)) | |
16280 | = build_constructor (TREE_TYPE (TREE_VEC_ELT (t, 2)), vkind); | |
d9a6bd32 JJ |
16281 | for (int i = 1; i <= 2; i++) |
16282 | if (!TREE_STATIC (TREE_VEC_ELT (t, i))) | |
16283 | { | |
16284 | gimple_seq initlist = NULL; | |
16285 | force_gimple_operand (build1 (DECL_EXPR, void_type_node, | |
16286 | TREE_VEC_ELT (t, i)), | |
16287 | &initlist, true, NULL_TREE); | |
16288 | gimple_seq_add_seq (&ilist, initlist); | |
16289 | ||
16290 | tree clobber = build_constructor (TREE_TYPE (TREE_VEC_ELT (t, i)), | |
16291 | NULL); | |
16292 | TREE_THIS_VOLATILE (clobber) = 1; | |
16293 | gimple_seq_add_stmt (&olist, | |
16294 | gimple_build_assign (TREE_VEC_ELT (t, i), | |
16295 | clobber)); | |
16296 | } | |
acf0174b JJ |
16297 | |
16298 | tree clobber = build_constructor (ctx->record_type, NULL); | |
16299 | TREE_THIS_VOLATILE (clobber) = 1; | |
16300 | gimple_seq_add_stmt (&olist, gimple_build_assign (ctx->sender_decl, | |
16301 | clobber)); | |
16302 | } | |
16303 | ||
16304 | /* Once all the expansions are done, sequence all the different | |
16305 | fragments inside gimple_omp_body. */ | |
16306 | ||
16307 | new_body = NULL; | |
16308 | ||
41dbbb37 TS |
16309 | if (offloaded |
16310 | && ctx->record_type) | |
acf0174b JJ |
16311 | { |
16312 | t = build_fold_addr_expr_loc (loc, ctx->sender_decl); | |
16313 | /* fixup_child_record_type might have changed receiver_decl's type. */ | |
16314 | t = fold_convert_loc (loc, TREE_TYPE (ctx->receiver_decl), t); | |
16315 | gimple_seq_add_stmt (&new_body, | |
16316 | gimple_build_assign (ctx->receiver_decl, t)); | |
16317 | } | |
182190f2 | 16318 | gimple_seq_add_seq (&new_body, fplist); |
acf0174b | 16319 | |
d9a6bd32 | 16320 | if (offloaded || data_region) |
acf0174b | 16321 | { |
d9a6bd32 JJ |
16322 | tree prev = NULL_TREE; |
16323 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
16324 | switch (OMP_CLAUSE_CODE (c)) | |
16325 | { | |
16326 | tree var, x; | |
16327 | default: | |
16328 | break; | |
16329 | case OMP_CLAUSE_FIRSTPRIVATE: | |
182190f2 NS |
16330 | if (is_gimple_omp_oacc (ctx->stmt)) |
16331 | break; | |
d9a6bd32 JJ |
16332 | var = OMP_CLAUSE_DECL (c); |
16333 | if (is_reference (var) | |
16334 | || is_gimple_reg_type (TREE_TYPE (var))) | |
16335 | { | |
16336 | tree new_var = lookup_decl (var, ctx); | |
16337 | tree type; | |
16338 | type = TREE_TYPE (var); | |
16339 | if (is_reference (var)) | |
16340 | type = TREE_TYPE (type); | |
16341 | bool use_firstprivate_int; | |
16342 | use_firstprivate_int = false; | |
16343 | if ((INTEGRAL_TYPE_P (type) | |
16344 | && TYPE_PRECISION (type) <= POINTER_SIZE) | |
16345 | || TREE_CODE (type) == POINTER_TYPE) | |
16346 | use_firstprivate_int = true; | |
16347 | if (has_depend) | |
16348 | { | |
16349 | tree v = lookup_decl_in_outer_ctx (var, ctx); | |
16350 | if (is_reference (v)) | |
16351 | use_firstprivate_int = false; | |
16352 | else if (is_gimple_reg (v)) | |
16353 | { | |
16354 | if (DECL_HAS_VALUE_EXPR_P (v)) | |
16355 | { | |
16356 | v = get_base_address (v); | |
16357 | if (DECL_P (v) && TREE_ADDRESSABLE (v)) | |
16358 | use_firstprivate_int = false; | |
16359 | else | |
16360 | switch (TREE_CODE (v)) | |
16361 | { | |
16362 | case INDIRECT_REF: | |
16363 | case MEM_REF: | |
16364 | use_firstprivate_int = false; | |
16365 | break; | |
16366 | default: | |
16367 | break; | |
16368 | } | |
16369 | } | |
16370 | } | |
16371 | else | |
16372 | use_firstprivate_int = false; | |
16373 | } | |
16374 | if (use_firstprivate_int) | |
16375 | { | |
16376 | x = build_receiver_ref (var, false, ctx); | |
16377 | if (TREE_CODE (type) != POINTER_TYPE) | |
16378 | x = fold_convert (pointer_sized_int_node, x); | |
16379 | x = fold_convert (type, x); | |
16380 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, | |
16381 | fb_rvalue); | |
16382 | if (is_reference (var)) | |
16383 | { | |
16384 | tree v = create_tmp_var_raw (type, get_name (var)); | |
16385 | gimple_add_tmp_var (v); | |
16386 | TREE_ADDRESSABLE (v) = 1; | |
16387 | gimple_seq_add_stmt (&new_body, | |
16388 | gimple_build_assign (v, x)); | |
16389 | x = build_fold_addr_expr (v); | |
16390 | } | |
16391 | gimple_seq_add_stmt (&new_body, | |
16392 | gimple_build_assign (new_var, x)); | |
16393 | } | |
16394 | else | |
16395 | { | |
16396 | x = build_receiver_ref (var, !is_reference (var), ctx); | |
16397 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, | |
16398 | fb_rvalue); | |
16399 | gimple_seq_add_stmt (&new_body, | |
16400 | gimple_build_assign (new_var, x)); | |
16401 | } | |
16402 | } | |
16403 | else if (is_variable_sized (var)) | |
16404 | { | |
16405 | tree pvar = DECL_VALUE_EXPR (var); | |
16406 | gcc_assert (TREE_CODE (pvar) == INDIRECT_REF); | |
16407 | pvar = TREE_OPERAND (pvar, 0); | |
16408 | gcc_assert (DECL_P (pvar)); | |
16409 | tree new_var = lookup_decl (pvar, ctx); | |
16410 | x = build_receiver_ref (var, false, ctx); | |
16411 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, fb_rvalue); | |
16412 | gimple_seq_add_stmt (&new_body, | |
16413 | gimple_build_assign (new_var, x)); | |
16414 | } | |
16415 | break; | |
16416 | case OMP_CLAUSE_PRIVATE: | |
182190f2 NS |
16417 | if (is_gimple_omp_oacc (ctx->stmt)) |
16418 | break; | |
d9a6bd32 JJ |
16419 | var = OMP_CLAUSE_DECL (c); |
16420 | if (is_reference (var)) | |
16421 | { | |
16422 | location_t clause_loc = OMP_CLAUSE_LOCATION (c); | |
16423 | tree new_var = lookup_decl (var, ctx); | |
16424 | x = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (new_var))); | |
16425 | if (TREE_CONSTANT (x)) | |
16426 | { | |
16427 | x = create_tmp_var_raw (TREE_TYPE (TREE_TYPE (new_var)), | |
16428 | get_name (var)); | |
16429 | gimple_add_tmp_var (x); | |
16430 | TREE_ADDRESSABLE (x) = 1; | |
16431 | x = build_fold_addr_expr_loc (clause_loc, x); | |
16432 | } | |
16433 | else | |
16434 | { | |
16435 | tree atmp | |
16436 | = builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN); | |
16437 | tree rtype = TREE_TYPE (TREE_TYPE (new_var)); | |
16438 | tree al = size_int (TYPE_ALIGN (rtype)); | |
16439 | x = build_call_expr_loc (clause_loc, atmp, 2, x, al); | |
16440 | } | |
16441 | ||
16442 | x = fold_convert_loc (clause_loc, TREE_TYPE (new_var), x); | |
16443 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, fb_rvalue); | |
16444 | gimple_seq_add_stmt (&new_body, | |
16445 | gimple_build_assign (new_var, x)); | |
16446 | } | |
16447 | break; | |
16448 | case OMP_CLAUSE_USE_DEVICE_PTR: | |
16449 | case OMP_CLAUSE_IS_DEVICE_PTR: | |
16450 | var = OMP_CLAUSE_DECL (c); | |
c7b48c8a | 16451 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_USE_DEVICE_PTR) |
d9a6bd32 JJ |
16452 | x = build_sender_ref (var, ctx); |
16453 | else | |
16454 | x = build_receiver_ref (var, false, ctx); | |
16455 | if (is_variable_sized (var)) | |
16456 | { | |
16457 | tree pvar = DECL_VALUE_EXPR (var); | |
16458 | gcc_assert (TREE_CODE (pvar) == INDIRECT_REF); | |
16459 | pvar = TREE_OPERAND (pvar, 0); | |
16460 | gcc_assert (DECL_P (pvar)); | |
16461 | tree new_var = lookup_decl (pvar, ctx); | |
16462 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, fb_rvalue); | |
16463 | gimple_seq_add_stmt (&new_body, | |
16464 | gimple_build_assign (new_var, x)); | |
16465 | } | |
16466 | else if (TREE_CODE (TREE_TYPE (var)) == ARRAY_TYPE) | |
16467 | { | |
16468 | tree new_var = lookup_decl (var, ctx); | |
16469 | new_var = DECL_VALUE_EXPR (new_var); | |
16470 | gcc_assert (TREE_CODE (new_var) == MEM_REF); | |
16471 | new_var = TREE_OPERAND (new_var, 0); | |
16472 | gcc_assert (DECL_P (new_var)); | |
16473 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, fb_rvalue); | |
16474 | gimple_seq_add_stmt (&new_body, | |
16475 | gimple_build_assign (new_var, x)); | |
16476 | } | |
16477 | else | |
16478 | { | |
16479 | tree type = TREE_TYPE (var); | |
16480 | tree new_var = lookup_decl (var, ctx); | |
16481 | if (is_reference (var)) | |
16482 | { | |
16483 | type = TREE_TYPE (type); | |
16484 | if (TREE_CODE (type) != ARRAY_TYPE) | |
16485 | { | |
16486 | tree v = create_tmp_var_raw (type, get_name (var)); | |
16487 | gimple_add_tmp_var (v); | |
16488 | TREE_ADDRESSABLE (v) = 1; | |
16489 | x = fold_convert (type, x); | |
16490 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, | |
16491 | fb_rvalue); | |
16492 | gimple_seq_add_stmt (&new_body, | |
16493 | gimple_build_assign (v, x)); | |
16494 | x = build_fold_addr_expr (v); | |
16495 | } | |
16496 | } | |
16497 | x = fold_convert (TREE_TYPE (new_var), x); | |
16498 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, fb_rvalue); | |
16499 | gimple_seq_add_stmt (&new_body, | |
16500 | gimple_build_assign (new_var, x)); | |
16501 | } | |
16502 | break; | |
16503 | } | |
e01d41e5 | 16504 | /* Handle GOMP_MAP_FIRSTPRIVATE_{POINTER,REFERENCE} in second pass, |
d9a6bd32 JJ |
16505 | so that firstprivate vars holding OMP_CLAUSE_SIZE if needed |
16506 | are already handled. */ | |
182190f2 | 16507 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) |
d9a6bd32 JJ |
16508 | switch (OMP_CLAUSE_CODE (c)) |
16509 | { | |
16510 | tree var; | |
16511 | default: | |
16512 | break; | |
16513 | case OMP_CLAUSE_MAP: | |
e01d41e5 JJ |
16514 | if (OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_FIRSTPRIVATE_POINTER |
16515 | || OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_FIRSTPRIVATE_REFERENCE) | |
d9a6bd32 JJ |
16516 | { |
16517 | location_t clause_loc = OMP_CLAUSE_LOCATION (c); | |
16518 | HOST_WIDE_INT offset = 0; | |
16519 | gcc_assert (prev); | |
16520 | var = OMP_CLAUSE_DECL (c); | |
16521 | if (DECL_P (var) | |
16522 | && TREE_CODE (TREE_TYPE (var)) == ARRAY_TYPE | |
16523 | && is_global_var (maybe_lookup_decl_in_outer_ctx (var, | |
16524 | ctx)) | |
16525 | && varpool_node::get_create (var)->offloadable) | |
16526 | break; | |
16527 | if (TREE_CODE (var) == INDIRECT_REF | |
16528 | && TREE_CODE (TREE_OPERAND (var, 0)) == COMPONENT_REF) | |
16529 | var = TREE_OPERAND (var, 0); | |
16530 | if (TREE_CODE (var) == COMPONENT_REF) | |
16531 | { | |
16532 | var = get_addr_base_and_unit_offset (var, &offset); | |
16533 | gcc_assert (var != NULL_TREE && DECL_P (var)); | |
16534 | } | |
16535 | else if (DECL_SIZE (var) | |
16536 | && TREE_CODE (DECL_SIZE (var)) != INTEGER_CST) | |
16537 | { | |
16538 | tree var2 = DECL_VALUE_EXPR (var); | |
16539 | gcc_assert (TREE_CODE (var2) == INDIRECT_REF); | |
16540 | var2 = TREE_OPERAND (var2, 0); | |
16541 | gcc_assert (DECL_P (var2)); | |
16542 | var = var2; | |
16543 | } | |
16544 | tree new_var = lookup_decl (var, ctx), x; | |
16545 | tree type = TREE_TYPE (new_var); | |
16546 | bool is_ref; | |
16547 | if (TREE_CODE (OMP_CLAUSE_DECL (c)) == INDIRECT_REF | |
16548 | && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (c), 0)) | |
16549 | == COMPONENT_REF)) | |
16550 | { | |
16551 | type = TREE_TYPE (TREE_OPERAND (OMP_CLAUSE_DECL (c), 0)); | |
16552 | is_ref = true; | |
16553 | new_var = build2 (MEM_REF, type, | |
16554 | build_fold_addr_expr (new_var), | |
16555 | build_int_cst (build_pointer_type (type), | |
16556 | offset)); | |
16557 | } | |
16558 | else if (TREE_CODE (OMP_CLAUSE_DECL (c)) == COMPONENT_REF) | |
16559 | { | |
16560 | type = TREE_TYPE (OMP_CLAUSE_DECL (c)); | |
16561 | is_ref = TREE_CODE (type) == REFERENCE_TYPE; | |
16562 | new_var = build2 (MEM_REF, type, | |
16563 | build_fold_addr_expr (new_var), | |
16564 | build_int_cst (build_pointer_type (type), | |
16565 | offset)); | |
16566 | } | |
16567 | else | |
16568 | is_ref = is_reference (var); | |
e01d41e5 JJ |
16569 | if (OMP_CLAUSE_MAP_KIND (c) == GOMP_MAP_FIRSTPRIVATE_REFERENCE) |
16570 | is_ref = false; | |
d9a6bd32 JJ |
16571 | bool ref_to_array = false; |
16572 | if (is_ref) | |
16573 | { | |
16574 | type = TREE_TYPE (type); | |
16575 | if (TREE_CODE (type) == ARRAY_TYPE) | |
16576 | { | |
16577 | type = build_pointer_type (type); | |
16578 | ref_to_array = true; | |
16579 | } | |
16580 | } | |
16581 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
16582 | { | |
16583 | tree decl2 = DECL_VALUE_EXPR (new_var); | |
16584 | gcc_assert (TREE_CODE (decl2) == MEM_REF); | |
16585 | decl2 = TREE_OPERAND (decl2, 0); | |
16586 | gcc_assert (DECL_P (decl2)); | |
16587 | new_var = decl2; | |
16588 | type = TREE_TYPE (new_var); | |
16589 | } | |
16590 | x = build_receiver_ref (OMP_CLAUSE_DECL (prev), false, ctx); | |
16591 | x = fold_convert_loc (clause_loc, type, x); | |
16592 | if (!integer_zerop (OMP_CLAUSE_SIZE (c))) | |
16593 | { | |
16594 | tree bias = OMP_CLAUSE_SIZE (c); | |
16595 | if (DECL_P (bias)) | |
16596 | bias = lookup_decl (bias, ctx); | |
16597 | bias = fold_convert_loc (clause_loc, sizetype, bias); | |
16598 | bias = fold_build1_loc (clause_loc, NEGATE_EXPR, sizetype, | |
16599 | bias); | |
16600 | x = fold_build2_loc (clause_loc, POINTER_PLUS_EXPR, | |
16601 | TREE_TYPE (x), x, bias); | |
16602 | } | |
16603 | if (ref_to_array) | |
16604 | x = fold_convert_loc (clause_loc, TREE_TYPE (new_var), x); | |
16605 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, fb_rvalue); | |
16606 | if (is_ref && !ref_to_array) | |
16607 | { | |
16608 | tree t = create_tmp_var_raw (type, get_name (var)); | |
16609 | gimple_add_tmp_var (t); | |
16610 | TREE_ADDRESSABLE (t) = 1; | |
16611 | gimple_seq_add_stmt (&new_body, | |
16612 | gimple_build_assign (t, x)); | |
16613 | x = build_fold_addr_expr_loc (clause_loc, t); | |
16614 | } | |
16615 | gimple_seq_add_stmt (&new_body, | |
16616 | gimple_build_assign (new_var, x)); | |
16617 | prev = NULL_TREE; | |
16618 | } | |
16619 | else if (OMP_CLAUSE_CHAIN (c) | |
16620 | && OMP_CLAUSE_CODE (OMP_CLAUSE_CHAIN (c)) | |
16621 | == OMP_CLAUSE_MAP | |
e01d41e5 JJ |
16622 | && (OMP_CLAUSE_MAP_KIND (OMP_CLAUSE_CHAIN (c)) |
16623 | == GOMP_MAP_FIRSTPRIVATE_POINTER | |
16624 | || (OMP_CLAUSE_MAP_KIND (OMP_CLAUSE_CHAIN (c)) | |
16625 | == GOMP_MAP_FIRSTPRIVATE_REFERENCE))) | |
d9a6bd32 JJ |
16626 | prev = c; |
16627 | break; | |
16628 | case OMP_CLAUSE_PRIVATE: | |
16629 | var = OMP_CLAUSE_DECL (c); | |
16630 | if (is_variable_sized (var)) | |
16631 | { | |
16632 | location_t clause_loc = OMP_CLAUSE_LOCATION (c); | |
16633 | tree new_var = lookup_decl (var, ctx); | |
16634 | tree pvar = DECL_VALUE_EXPR (var); | |
16635 | gcc_assert (TREE_CODE (pvar) == INDIRECT_REF); | |
16636 | pvar = TREE_OPERAND (pvar, 0); | |
16637 | gcc_assert (DECL_P (pvar)); | |
16638 | tree new_pvar = lookup_decl (pvar, ctx); | |
16639 | tree atmp = builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN); | |
16640 | tree al = size_int (DECL_ALIGN (var)); | |
16641 | tree x = TYPE_SIZE_UNIT (TREE_TYPE (new_var)); | |
16642 | x = build_call_expr_loc (clause_loc, atmp, 2, x, al); | |
16643 | x = fold_convert_loc (clause_loc, TREE_TYPE (new_pvar), x); | |
16644 | gimplify_expr (&x, &new_body, NULL, is_gimple_val, fb_rvalue); | |
16645 | gimple_seq_add_stmt (&new_body, | |
16646 | gimple_build_assign (new_pvar, x)); | |
16647 | } | |
16648 | break; | |
16649 | } | |
68249442 | 16650 | |
e5014671 NS |
16651 | gimple_seq fork_seq = NULL; |
16652 | gimple_seq join_seq = NULL; | |
16653 | ||
16654 | if (is_oacc_parallel (ctx)) | |
16655 | { | |
16656 | /* If there are reductions on the offloaded region itself, treat | |
16657 | them as a dummy GANG loop. */ | |
16658 | tree level = build_int_cst (integer_type_node, GOMP_DIM_GANG); | |
16659 | ||
16660 | lower_oacc_reductions (gimple_location (ctx->stmt), clauses, level, | |
16661 | false, NULL, NULL, &fork_seq, &join_seq, ctx); | |
16662 | } | |
16663 | ||
16664 | gimple_seq_add_seq (&new_body, fork_seq); | |
acf0174b | 16665 | gimple_seq_add_seq (&new_body, tgt_body); |
e5014671 | 16666 | gimple_seq_add_seq (&new_body, join_seq); |
68249442 | 16667 | |
d9a6bd32 JJ |
16668 | if (offloaded) |
16669 | new_body = maybe_catch_exception (new_body); | |
68249442 | 16670 | |
acf0174b JJ |
16671 | gimple_seq_add_stmt (&new_body, gimple_build_omp_return (false)); |
16672 | gimple_omp_set_body (stmt, new_body); | |
16673 | } | |
16674 | ||
16675 | bind = gimple_build_bind (NULL, NULL, | |
16676 | tgt_bind ? gimple_bind_block (tgt_bind) | |
16677 | : NULL_TREE); | |
d9a6bd32 | 16678 | gsi_replace (gsi_p, dep_bind ? dep_bind : bind, true); |
355a7673 MM |
16679 | gimple_bind_add_seq (bind, ilist); |
16680 | gimple_bind_add_stmt (bind, stmt); | |
16681 | gimple_bind_add_seq (bind, olist); | |
50674e96 | 16682 | |
726a989a | 16683 | pop_gimplify_context (NULL); |
d9a6bd32 JJ |
16684 | |
16685 | if (dep_bind) | |
16686 | { | |
16687 | gimple_bind_add_seq (dep_bind, dep_ilist); | |
16688 | gimple_bind_add_stmt (dep_bind, bind); | |
16689 | gimple_bind_add_seq (dep_bind, dep_olist); | |
16690 | pop_gimplify_context (dep_bind); | |
16691 | } | |
50674e96 DN |
16692 | } |
16693 | ||
acf0174b JJ |
16694 | /* Expand code for an OpenMP teams directive. */ |
16695 | ||
16696 | static void | |
16697 | lower_omp_teams (gimple_stmt_iterator *gsi_p, omp_context *ctx) | |
16698 | { | |
538dd0b7 | 16699 | gomp_teams *teams_stmt = as_a <gomp_teams *> (gsi_stmt (*gsi_p)); |
45852dcc | 16700 | push_gimplify_context (); |
acf0174b JJ |
16701 | |
16702 | tree block = make_node (BLOCK); | |
538dd0b7 | 16703 | gbind *bind = gimple_build_bind (NULL, NULL, block); |
acf0174b JJ |
16704 | gsi_replace (gsi_p, bind, true); |
16705 | gimple_seq bind_body = NULL; | |
16706 | gimple_seq dlist = NULL; | |
16707 | gimple_seq olist = NULL; | |
16708 | ||
16709 | tree num_teams = find_omp_clause (gimple_omp_teams_clauses (teams_stmt), | |
16710 | OMP_CLAUSE_NUM_TEAMS); | |
16711 | if (num_teams == NULL_TREE) | |
16712 | num_teams = build_int_cst (unsigned_type_node, 0); | |
16713 | else | |
16714 | { | |
16715 | num_teams = OMP_CLAUSE_NUM_TEAMS_EXPR (num_teams); | |
16716 | num_teams = fold_convert (unsigned_type_node, num_teams); | |
16717 | gimplify_expr (&num_teams, &bind_body, NULL, is_gimple_val, fb_rvalue); | |
16718 | } | |
16719 | tree thread_limit = find_omp_clause (gimple_omp_teams_clauses (teams_stmt), | |
16720 | OMP_CLAUSE_THREAD_LIMIT); | |
16721 | if (thread_limit == NULL_TREE) | |
16722 | thread_limit = build_int_cst (unsigned_type_node, 0); | |
16723 | else | |
16724 | { | |
16725 | thread_limit = OMP_CLAUSE_THREAD_LIMIT_EXPR (thread_limit); | |
16726 | thread_limit = fold_convert (unsigned_type_node, thread_limit); | |
16727 | gimplify_expr (&thread_limit, &bind_body, NULL, is_gimple_val, | |
16728 | fb_rvalue); | |
16729 | } | |
16730 | ||
16731 | lower_rec_input_clauses (gimple_omp_teams_clauses (teams_stmt), | |
16732 | &bind_body, &dlist, ctx, NULL); | |
16733 | lower_omp (gimple_omp_body_ptr (teams_stmt), ctx); | |
16734 | lower_reduction_clauses (gimple_omp_teams_clauses (teams_stmt), &olist, ctx); | |
b2b40051 MJ |
16735 | if (!gimple_omp_teams_grid_phony (teams_stmt)) |
16736 | { | |
16737 | gimple_seq_add_stmt (&bind_body, teams_stmt); | |
16738 | location_t loc = gimple_location (teams_stmt); | |
16739 | tree decl = builtin_decl_explicit (BUILT_IN_GOMP_TEAMS); | |
16740 | gimple *call = gimple_build_call (decl, 2, num_teams, thread_limit); | |
16741 | gimple_set_location (call, loc); | |
16742 | gimple_seq_add_stmt (&bind_body, call); | |
16743 | } | |
acf0174b JJ |
16744 | |
16745 | gimple_seq_add_seq (&bind_body, gimple_omp_body (teams_stmt)); | |
16746 | gimple_omp_set_body (teams_stmt, NULL); | |
16747 | gimple_seq_add_seq (&bind_body, olist); | |
16748 | gimple_seq_add_seq (&bind_body, dlist); | |
b2b40051 MJ |
16749 | if (!gimple_omp_teams_grid_phony (teams_stmt)) |
16750 | gimple_seq_add_stmt (&bind_body, gimple_build_omp_return (true)); | |
acf0174b JJ |
16751 | gimple_bind_set_body (bind, bind_body); |
16752 | ||
16753 | pop_gimplify_context (bind); | |
16754 | ||
16755 | gimple_bind_append_vars (bind, ctx->block_vars); | |
16756 | BLOCK_VARS (block) = ctx->block_vars; | |
16757 | if (BLOCK_VARS (block)) | |
16758 | TREE_USED (block) = 1; | |
16759 | } | |
16760 | ||
b2b40051 MJ |
16761 | /* Expand code within an artificial GIMPLE_OMP_GRID_BODY OMP construct. */ |
16762 | ||
16763 | static void | |
16764 | lower_omp_grid_body (gimple_stmt_iterator *gsi_p, omp_context *ctx) | |
16765 | { | |
16766 | gimple *stmt = gsi_stmt (*gsi_p); | |
16767 | lower_omp (gimple_omp_body_ptr (stmt), ctx); | |
16768 | gimple_seq_add_stmt (gimple_omp_body_ptr (stmt), | |
16769 | gimple_build_omp_return (false)); | |
16770 | } | |
16771 | ||
acf0174b | 16772 | |
d0fb20be | 16773 | /* Callback for lower_omp_1. Return non-NULL if *tp needs to be |
726a989a | 16774 | regimplified. If DATA is non-NULL, lower_omp_1 is outside |
41dbbb37 | 16775 | of OMP context, but with task_shared_vars set. */ |
75a4c3c1 AP |
16776 | |
16777 | static tree | |
726a989a RB |
16778 | lower_omp_regimplify_p (tree *tp, int *walk_subtrees, |
16779 | void *data) | |
75a4c3c1 | 16780 | { |
d0fb20be | 16781 | tree t = *tp; |
75a4c3c1 | 16782 | |
d0fb20be | 16783 | /* Any variable with DECL_VALUE_EXPR needs to be regimplified. */ |
726a989a | 16784 | if (TREE_CODE (t) == VAR_DECL && data == NULL && DECL_HAS_VALUE_EXPR_P (t)) |
b826efd9 JJ |
16785 | return t; |
16786 | ||
16787 | if (task_shared_vars | |
16788 | && DECL_P (t) | |
16789 | && bitmap_bit_p (task_shared_vars, DECL_UID (t))) | |
d0fb20be | 16790 | return t; |
75a4c3c1 | 16791 | |
d0fb20be JJ |
16792 | /* If a global variable has been privatized, TREE_CONSTANT on |
16793 | ADDR_EXPR might be wrong. */ | |
726a989a | 16794 | if (data == NULL && TREE_CODE (t) == ADDR_EXPR) |
d0fb20be | 16795 | recompute_tree_invariant_for_addr_expr (t); |
75a4c3c1 | 16796 | |
d9a6bd32 JJ |
16797 | *walk_subtrees = !IS_TYPE_OR_DECL_P (t); |
16798 | return NULL_TREE; | |
16799 | } | |
16800 | ||
16801 | /* Data to be communicated between lower_omp_regimplify_operands and | |
16802 | lower_omp_regimplify_operands_p. */ | |
16803 | ||
16804 | struct lower_omp_regimplify_operands_data | |
16805 | { | |
16806 | omp_context *ctx; | |
16807 | vec<tree> *decls; | |
16808 | }; | |
16809 | ||
16810 | /* Helper function for lower_omp_regimplify_operands. Find | |
16811 | omp_member_access_dummy_var vars and adjust temporarily their | |
16812 | DECL_VALUE_EXPRs if needed. */ | |
16813 | ||
16814 | static tree | |
16815 | lower_omp_regimplify_operands_p (tree *tp, int *walk_subtrees, | |
16816 | void *data) | |
16817 | { | |
16818 | tree t = omp_member_access_dummy_var (*tp); | |
16819 | if (t) | |
16820 | { | |
16821 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data; | |
16822 | lower_omp_regimplify_operands_data *ldata | |
16823 | = (lower_omp_regimplify_operands_data *) wi->info; | |
16824 | tree o = maybe_lookup_decl (t, ldata->ctx); | |
16825 | if (o != t) | |
16826 | { | |
16827 | ldata->decls->safe_push (DECL_VALUE_EXPR (*tp)); | |
16828 | ldata->decls->safe_push (*tp); | |
16829 | tree v = unshare_and_remap (DECL_VALUE_EXPR (*tp), t, o); | |
16830 | SET_DECL_VALUE_EXPR (*tp, v); | |
16831 | } | |
16832 | } | |
16833 | *walk_subtrees = !IS_TYPE_OR_DECL_P (*tp); | |
d0fb20be | 16834 | return NULL_TREE; |
75a4c3c1 | 16835 | } |
50674e96 | 16836 | |
d9a6bd32 JJ |
16837 | /* Wrapper around gimple_regimplify_operands that adjusts DECL_VALUE_EXPRs |
16838 | of omp_member_access_dummy_var vars during regimplification. */ | |
16839 | ||
16840 | static void | |
16841 | lower_omp_regimplify_operands (omp_context *ctx, gimple *stmt, | |
16842 | gimple_stmt_iterator *gsi_p) | |
16843 | { | |
16844 | auto_vec<tree, 10> decls; | |
16845 | if (ctx) | |
16846 | { | |
16847 | struct walk_stmt_info wi; | |
16848 | memset (&wi, '\0', sizeof (wi)); | |
16849 | struct lower_omp_regimplify_operands_data data; | |
16850 | data.ctx = ctx; | |
16851 | data.decls = &decls; | |
16852 | wi.info = &data; | |
16853 | walk_gimple_op (stmt, lower_omp_regimplify_operands_p, &wi); | |
16854 | } | |
16855 | gimple_regimplify_operands (stmt, gsi_p); | |
16856 | while (!decls.is_empty ()) | |
16857 | { | |
16858 | tree t = decls.pop (); | |
16859 | tree v = decls.pop (); | |
16860 | SET_DECL_VALUE_EXPR (t, v); | |
16861 | } | |
16862 | } | |
16863 | ||
d0fb20be | 16864 | static void |
726a989a | 16865 | lower_omp_1 (gimple_stmt_iterator *gsi_p, omp_context *ctx) |
953ff289 | 16866 | { |
355fe088 | 16867 | gimple *stmt = gsi_stmt (*gsi_p); |
726a989a | 16868 | struct walk_stmt_info wi; |
538dd0b7 | 16869 | gcall *call_stmt; |
953ff289 | 16870 | |
726a989a RB |
16871 | if (gimple_has_location (stmt)) |
16872 | input_location = gimple_location (stmt); | |
d0fb20be | 16873 | |
726a989a RB |
16874 | if (task_shared_vars) |
16875 | memset (&wi, '\0', sizeof (wi)); | |
d0fb20be | 16876 | |
50674e96 | 16877 | /* If we have issued syntax errors, avoid doing any heavy lifting. |
41dbbb37 | 16878 | Just replace the OMP directives with a NOP to avoid |
50674e96 | 16879 | confusing RTL expansion. */ |
1da2ed5f | 16880 | if (seen_error () && is_gimple_omp (stmt)) |
50674e96 | 16881 | { |
726a989a | 16882 | gsi_replace (gsi_p, gimple_build_nop (), true); |
d0fb20be | 16883 | return; |
50674e96 DN |
16884 | } |
16885 | ||
726a989a | 16886 | switch (gimple_code (stmt)) |
953ff289 | 16887 | { |
726a989a | 16888 | case GIMPLE_COND: |
538dd0b7 DM |
16889 | { |
16890 | gcond *cond_stmt = as_a <gcond *> (stmt); | |
16891 | if ((ctx || task_shared_vars) | |
16892 | && (walk_tree (gimple_cond_lhs_ptr (cond_stmt), | |
16893 | lower_omp_regimplify_p, | |
16894 | ctx ? NULL : &wi, NULL) | |
16895 | || walk_tree (gimple_cond_rhs_ptr (cond_stmt), | |
16896 | lower_omp_regimplify_p, | |
16897 | ctx ? NULL : &wi, NULL))) | |
d9a6bd32 | 16898 | lower_omp_regimplify_operands (ctx, cond_stmt, gsi_p); |
538dd0b7 | 16899 | } |
d0fb20be | 16900 | break; |
726a989a | 16901 | case GIMPLE_CATCH: |
538dd0b7 | 16902 | lower_omp (gimple_catch_handler_ptr (as_a <gcatch *> (stmt)), ctx); |
d0fb20be | 16903 | break; |
726a989a | 16904 | case GIMPLE_EH_FILTER: |
355a7673 | 16905 | lower_omp (gimple_eh_filter_failure_ptr (stmt), ctx); |
d0fb20be | 16906 | break; |
726a989a | 16907 | case GIMPLE_TRY: |
355a7673 MM |
16908 | lower_omp (gimple_try_eval_ptr (stmt), ctx); |
16909 | lower_omp (gimple_try_cleanup_ptr (stmt), ctx); | |
d0fb20be | 16910 | break; |
d88513ea | 16911 | case GIMPLE_TRANSACTION: |
538dd0b7 DM |
16912 | lower_omp (gimple_transaction_body_ptr ( |
16913 | as_a <gtransaction *> (stmt)), | |
16914 | ctx); | |
d88513ea | 16915 | break; |
726a989a | 16916 | case GIMPLE_BIND: |
538dd0b7 | 16917 | lower_omp (gimple_bind_body_ptr (as_a <gbind *> (stmt)), ctx); |
d0fb20be | 16918 | break; |
726a989a RB |
16919 | case GIMPLE_OMP_PARALLEL: |
16920 | case GIMPLE_OMP_TASK: | |
16921 | ctx = maybe_lookup_ctx (stmt); | |
acf0174b JJ |
16922 | gcc_assert (ctx); |
16923 | if (ctx->cancellable) | |
16924 | ctx->cancel_label = create_artificial_label (UNKNOWN_LOCATION); | |
726a989a | 16925 | lower_omp_taskreg (gsi_p, ctx); |
d0fb20be | 16926 | break; |
726a989a RB |
16927 | case GIMPLE_OMP_FOR: |
16928 | ctx = maybe_lookup_ctx (stmt); | |
953ff289 | 16929 | gcc_assert (ctx); |
acf0174b JJ |
16930 | if (ctx->cancellable) |
16931 | ctx->cancel_label = create_artificial_label (UNKNOWN_LOCATION); | |
726a989a | 16932 | lower_omp_for (gsi_p, ctx); |
953ff289 | 16933 | break; |
726a989a RB |
16934 | case GIMPLE_OMP_SECTIONS: |
16935 | ctx = maybe_lookup_ctx (stmt); | |
953ff289 | 16936 | gcc_assert (ctx); |
acf0174b JJ |
16937 | if (ctx->cancellable) |
16938 | ctx->cancel_label = create_artificial_label (UNKNOWN_LOCATION); | |
726a989a | 16939 | lower_omp_sections (gsi_p, ctx); |
953ff289 | 16940 | break; |
726a989a RB |
16941 | case GIMPLE_OMP_SINGLE: |
16942 | ctx = maybe_lookup_ctx (stmt); | |
953ff289 | 16943 | gcc_assert (ctx); |
726a989a | 16944 | lower_omp_single (gsi_p, ctx); |
953ff289 | 16945 | break; |
726a989a RB |
16946 | case GIMPLE_OMP_MASTER: |
16947 | ctx = maybe_lookup_ctx (stmt); | |
953ff289 | 16948 | gcc_assert (ctx); |
726a989a | 16949 | lower_omp_master (gsi_p, ctx); |
953ff289 | 16950 | break; |
acf0174b JJ |
16951 | case GIMPLE_OMP_TASKGROUP: |
16952 | ctx = maybe_lookup_ctx (stmt); | |
16953 | gcc_assert (ctx); | |
16954 | lower_omp_taskgroup (gsi_p, ctx); | |
16955 | break; | |
726a989a RB |
16956 | case GIMPLE_OMP_ORDERED: |
16957 | ctx = maybe_lookup_ctx (stmt); | |
953ff289 | 16958 | gcc_assert (ctx); |
726a989a | 16959 | lower_omp_ordered (gsi_p, ctx); |
953ff289 | 16960 | break; |
726a989a RB |
16961 | case GIMPLE_OMP_CRITICAL: |
16962 | ctx = maybe_lookup_ctx (stmt); | |
953ff289 | 16963 | gcc_assert (ctx); |
726a989a RB |
16964 | lower_omp_critical (gsi_p, ctx); |
16965 | break; | |
16966 | case GIMPLE_OMP_ATOMIC_LOAD: | |
16967 | if ((ctx || task_shared_vars) | |
538dd0b7 DM |
16968 | && walk_tree (gimple_omp_atomic_load_rhs_ptr ( |
16969 | as_a <gomp_atomic_load *> (stmt)), | |
726a989a | 16970 | lower_omp_regimplify_p, ctx ? NULL : &wi, NULL)) |
d9a6bd32 | 16971 | lower_omp_regimplify_operands (ctx, stmt, gsi_p); |
953ff289 | 16972 | break; |
acf0174b JJ |
16973 | case GIMPLE_OMP_TARGET: |
16974 | ctx = maybe_lookup_ctx (stmt); | |
16975 | gcc_assert (ctx); | |
16976 | lower_omp_target (gsi_p, ctx); | |
16977 | break; | |
16978 | case GIMPLE_OMP_TEAMS: | |
16979 | ctx = maybe_lookup_ctx (stmt); | |
16980 | gcc_assert (ctx); | |
16981 | lower_omp_teams (gsi_p, ctx); | |
16982 | break; | |
b2b40051 MJ |
16983 | case GIMPLE_OMP_GRID_BODY: |
16984 | ctx = maybe_lookup_ctx (stmt); | |
16985 | gcc_assert (ctx); | |
16986 | lower_omp_grid_body (gsi_p, ctx); | |
16987 | break; | |
acf0174b JJ |
16988 | case GIMPLE_CALL: |
16989 | tree fndecl; | |
538dd0b7 DM |
16990 | call_stmt = as_a <gcall *> (stmt); |
16991 | fndecl = gimple_call_fndecl (call_stmt); | |
acf0174b JJ |
16992 | if (fndecl |
16993 | && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
16994 | switch (DECL_FUNCTION_CODE (fndecl)) | |
16995 | { | |
16996 | case BUILT_IN_GOMP_BARRIER: | |
16997 | if (ctx == NULL) | |
16998 | break; | |
16999 | /* FALLTHRU */ | |
17000 | case BUILT_IN_GOMP_CANCEL: | |
17001 | case BUILT_IN_GOMP_CANCELLATION_POINT: | |
17002 | omp_context *cctx; | |
17003 | cctx = ctx; | |
17004 | if (gimple_code (cctx->stmt) == GIMPLE_OMP_SECTION) | |
17005 | cctx = cctx->outer; | |
538dd0b7 | 17006 | gcc_assert (gimple_call_lhs (call_stmt) == NULL_TREE); |
acf0174b JJ |
17007 | if (!cctx->cancellable) |
17008 | { | |
17009 | if (DECL_FUNCTION_CODE (fndecl) | |
17010 | == BUILT_IN_GOMP_CANCELLATION_POINT) | |
17011 | { | |
17012 | stmt = gimple_build_nop (); | |
17013 | gsi_replace (gsi_p, stmt, false); | |
17014 | } | |
17015 | break; | |
17016 | } | |
acf0174b JJ |
17017 | if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_GOMP_BARRIER) |
17018 | { | |
17019 | fndecl = builtin_decl_explicit (BUILT_IN_GOMP_BARRIER_CANCEL); | |
538dd0b7 DM |
17020 | gimple_call_set_fndecl (call_stmt, fndecl); |
17021 | gimple_call_set_fntype (call_stmt, TREE_TYPE (fndecl)); | |
acf0174b | 17022 | } |
dd2fc525 | 17023 | tree lhs; |
b731b390 | 17024 | lhs = create_tmp_var (TREE_TYPE (TREE_TYPE (fndecl))); |
538dd0b7 | 17025 | gimple_call_set_lhs (call_stmt, lhs); |
acf0174b JJ |
17026 | tree fallthru_label; |
17027 | fallthru_label = create_artificial_label (UNKNOWN_LOCATION); | |
355fe088 | 17028 | gimple *g; |
acf0174b JJ |
17029 | g = gimple_build_label (fallthru_label); |
17030 | gsi_insert_after (gsi_p, g, GSI_SAME_STMT); | |
dd2fc525 JJ |
17031 | g = gimple_build_cond (NE_EXPR, lhs, |
17032 | fold_convert (TREE_TYPE (lhs), | |
17033 | boolean_false_node), | |
acf0174b JJ |
17034 | cctx->cancel_label, fallthru_label); |
17035 | gsi_insert_after (gsi_p, g, GSI_SAME_STMT); | |
17036 | break; | |
17037 | default: | |
17038 | break; | |
17039 | } | |
17040 | /* FALLTHRU */ | |
d0fb20be | 17041 | default: |
a68ab351 | 17042 | if ((ctx || task_shared_vars) |
726a989a RB |
17043 | && walk_gimple_op (stmt, lower_omp_regimplify_p, |
17044 | ctx ? NULL : &wi)) | |
47519a14 JJ |
17045 | { |
17046 | /* Just remove clobbers, this should happen only if we have | |
17047 | "privatized" local addressable variables in SIMD regions, | |
17048 | the clobber isn't needed in that case and gimplifying address | |
17049 | of the ARRAY_REF into a pointer and creating MEM_REF based | |
17050 | clobber would create worse code than we get with the clobber | |
17051 | dropped. */ | |
17052 | if (gimple_clobber_p (stmt)) | |
17053 | { | |
17054 | gsi_replace (gsi_p, gimple_build_nop (), true); | |
17055 | break; | |
17056 | } | |
d9a6bd32 | 17057 | lower_omp_regimplify_operands (ctx, stmt, gsi_p); |
47519a14 | 17058 | } |
953ff289 | 17059 | break; |
953ff289 | 17060 | } |
953ff289 DN |
17061 | } |
17062 | ||
17063 | static void | |
355a7673 | 17064 | lower_omp (gimple_seq *body, omp_context *ctx) |
953ff289 | 17065 | { |
b357f682 | 17066 | location_t saved_location = input_location; |
355a7673 MM |
17067 | gimple_stmt_iterator gsi; |
17068 | for (gsi = gsi_start (*body); !gsi_end_p (gsi); gsi_next (&gsi)) | |
726a989a | 17069 | lower_omp_1 (&gsi, ctx); |
41dbbb37 | 17070 | /* During gimplification, we haven't folded statments inside offloading |
d26fc979 JJ |
17071 | or taskreg regions (gimplify.c:maybe_fold_stmt); do that now. */ |
17072 | if (target_nesting_level || taskreg_nesting_level) | |
acf0174b JJ |
17073 | for (gsi = gsi_start (*body); !gsi_end_p (gsi); gsi_next (&gsi)) |
17074 | fold_stmt (&gsi); | |
b357f682 | 17075 | input_location = saved_location; |
953ff289 | 17076 | } |
b2b40051 MJ |
17077 | |
17078 | /* Returen true if STMT is an assignment of a register-type into a local | |
17079 | VAR_DECL. */ | |
17080 | ||
17081 | static bool | |
17082 | grid_reg_assignment_to_local_var_p (gimple *stmt) | |
17083 | { | |
17084 | gassign *assign = dyn_cast <gassign *> (stmt); | |
17085 | if (!assign) | |
17086 | return false; | |
17087 | tree lhs = gimple_assign_lhs (assign); | |
17088 | if (TREE_CODE (lhs) != VAR_DECL | |
17089 | || !is_gimple_reg_type (TREE_TYPE (lhs)) | |
17090 | || is_global_var (lhs)) | |
17091 | return false; | |
17092 | return true; | |
17093 | } | |
17094 | ||
17095 | /* Return true if all statements in SEQ are assignments to local register-type | |
17096 | variables. */ | |
17097 | ||
17098 | static bool | |
17099 | grid_seq_only_contains_local_assignments (gimple_seq seq) | |
17100 | { | |
17101 | if (!seq) | |
17102 | return true; | |
17103 | ||
17104 | gimple_stmt_iterator gsi; | |
17105 | for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi)) | |
17106 | if (!grid_reg_assignment_to_local_var_p (gsi_stmt (gsi))) | |
17107 | return false; | |
17108 | return true; | |
17109 | } | |
17110 | ||
17111 | /* Scan statements in SEQ and call itself recursively on any bind. If during | |
17112 | whole search only assignments to register-type local variables and one | |
17113 | single OMP statement is encountered, return true, otherwise return false. | |
17114 | RET is where we store any OMP statement encountered. TARGET_LOC and NAME | |
17115 | are used for dumping a note about a failure. */ | |
17116 | ||
17117 | static bool | |
17118 | grid_find_single_omp_among_assignments_1 (gimple_seq seq, location_t target_loc, | |
17119 | const char *name, gimple **ret) | |
17120 | { | |
17121 | gimple_stmt_iterator gsi; | |
17122 | for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi)) | |
17123 | { | |
17124 | gimple *stmt = gsi_stmt (gsi); | |
17125 | ||
17126 | if (grid_reg_assignment_to_local_var_p (stmt)) | |
17127 | continue; | |
17128 | if (gbind *bind = dyn_cast <gbind *> (stmt)) | |
17129 | { | |
17130 | if (!grid_find_single_omp_among_assignments_1 (gimple_bind_body (bind), | |
17131 | target_loc, name, ret)) | |
17132 | return false; | |
17133 | } | |
17134 | else if (is_gimple_omp (stmt)) | |
17135 | { | |
17136 | if (*ret) | |
17137 | { | |
17138 | if (dump_enabled_p ()) | |
17139 | dump_printf_loc (MSG_NOTE, target_loc, | |
17140 | "Will not turn target construct into a simple " | |
17141 | "GPGPU kernel because %s construct contains " | |
17142 | "multiple OpenMP constructs\n", name); | |
17143 | return false; | |
17144 | } | |
17145 | *ret = stmt; | |
17146 | } | |
17147 | else | |
17148 | { | |
17149 | if (dump_enabled_p ()) | |
17150 | dump_printf_loc (MSG_NOTE, target_loc, | |
17151 | "Will not turn target construct into a simple " | |
17152 | "GPGPU kernel because %s construct contains " | |
17153 | "a complex statement\n", name); | |
17154 | return false; | |
17155 | } | |
17156 | } | |
17157 | return true; | |
17158 | } | |
17159 | ||
17160 | /* Scan statements in SEQ and make sure that it and any binds in it contain | |
17161 | only assignments to local register-type variables and one OMP construct. If | |
17162 | so, return that construct, otherwise return NULL. If dumping is enabled and | |
17163 | function fails, use TARGET_LOC and NAME to dump a note with the reason for | |
17164 | failure. */ | |
17165 | ||
17166 | static gimple * | |
17167 | grid_find_single_omp_among_assignments (gimple_seq seq, location_t target_loc, | |
17168 | const char *name) | |
17169 | { | |
17170 | if (!seq) | |
17171 | { | |
17172 | if (dump_enabled_p ()) | |
17173 | dump_printf_loc (MSG_NOTE, target_loc, | |
17174 | "Will not turn target construct into a simple " | |
17175 | "GPGPU kernel because %s construct has empty " | |
17176 | "body\n", | |
17177 | name); | |
17178 | return NULL; | |
17179 | } | |
17180 | ||
17181 | gimple *ret = NULL; | |
17182 | if (grid_find_single_omp_among_assignments_1 (seq, target_loc, name, &ret)) | |
17183 | { | |
17184 | if (!ret && dump_enabled_p ()) | |
17185 | dump_printf_loc (MSG_NOTE, target_loc, | |
17186 | "Will not turn target construct into a simple " | |
17187 | "GPGPU kernel because %s construct does not contain" | |
17188 | "any other OpenMP construct\n", name); | |
17189 | return ret; | |
17190 | } | |
17191 | else | |
17192 | return NULL; | |
17193 | } | |
17194 | ||
17195 | /* Walker function looking for statements there is no point gridifying (and for | |
17196 | noreturn function calls which we cannot do). Return non-NULL if such a | |
17197 | function is found. */ | |
17198 | ||
17199 | static tree | |
17200 | grid_find_ungridifiable_statement (gimple_stmt_iterator *gsi, | |
17201 | bool *handled_ops_p, | |
17202 | struct walk_stmt_info *) | |
17203 | { | |
17204 | *handled_ops_p = false; | |
17205 | gimple *stmt = gsi_stmt (*gsi); | |
17206 | switch (gimple_code (stmt)) | |
17207 | { | |
17208 | case GIMPLE_CALL: | |
17209 | if (gimple_call_noreturn_p (as_a <gcall *> (stmt))) | |
17210 | { | |
17211 | *handled_ops_p = true; | |
17212 | return error_mark_node; | |
17213 | } | |
17214 | break; | |
17215 | ||
17216 | /* We may reduce the following list if we find a way to implement the | |
17217 | clauses, but now there is no point trying further. */ | |
17218 | case GIMPLE_OMP_CRITICAL: | |
17219 | case GIMPLE_OMP_TASKGROUP: | |
17220 | case GIMPLE_OMP_TASK: | |
17221 | case GIMPLE_OMP_SECTION: | |
17222 | case GIMPLE_OMP_SECTIONS: | |
17223 | case GIMPLE_OMP_SECTIONS_SWITCH: | |
17224 | case GIMPLE_OMP_TARGET: | |
17225 | case GIMPLE_OMP_ORDERED: | |
17226 | *handled_ops_p = true; | |
17227 | return error_mark_node; | |
17228 | ||
17229 | default: | |
17230 | break; | |
17231 | } | |
17232 | return NULL; | |
17233 | } | |
17234 | ||
17235 | ||
17236 | /* If TARGET follows a pattern that can be turned into a gridified GPGPU | |
17237 | kernel, return true, otherwise return false. In the case of success, also | |
17238 | fill in GROUP_SIZE_P with the requested group size or NULL if there is | |
17239 | none. */ | |
17240 | ||
17241 | static bool | |
17242 | grid_target_follows_gridifiable_pattern (gomp_target *target, tree *group_size_p) | |
17243 | { | |
17244 | if (gimple_omp_target_kind (target) != GF_OMP_TARGET_KIND_REGION) | |
17245 | return false; | |
17246 | ||
17247 | location_t tloc = gimple_location (target); | |
17248 | gimple *stmt | |
17249 | = grid_find_single_omp_among_assignments (gimple_omp_body (target), | |
17250 | tloc, "target"); | |
17251 | if (!stmt) | |
17252 | return false; | |
17253 | gomp_teams *teams = dyn_cast <gomp_teams *> (stmt); | |
17254 | tree group_size = NULL; | |
17255 | if (!teams) | |
17256 | { | |
17257 | dump_printf_loc (MSG_NOTE, tloc, | |
17258 | "Will not turn target construct into a simple " | |
17259 | "GPGPU kernel because it does not have a sole teams " | |
17260 | "construct in it.\n"); | |
17261 | return false; | |
17262 | } | |
17263 | ||
17264 | tree clauses = gimple_omp_teams_clauses (teams); | |
17265 | while (clauses) | |
17266 | { | |
17267 | switch (OMP_CLAUSE_CODE (clauses)) | |
17268 | { | |
17269 | case OMP_CLAUSE_NUM_TEAMS: | |
17270 | if (dump_enabled_p ()) | |
17271 | dump_printf_loc (MSG_NOTE, tloc, | |
17272 | "Will not turn target construct into a " | |
17273 | "gridified GPGPU kernel because we cannot " | |
17274 | "handle num_teams clause of teams " | |
17275 | "construct\n "); | |
17276 | return false; | |
17277 | ||
17278 | case OMP_CLAUSE_REDUCTION: | |
17279 | if (dump_enabled_p ()) | |
17280 | dump_printf_loc (MSG_NOTE, tloc, | |
17281 | "Will not turn target construct into a " | |
17282 | "gridified GPGPU kernel because a reduction " | |
17283 | "clause is present\n "); | |
17284 | return false; | |
17285 | ||
17286 | case OMP_CLAUSE_LASTPRIVATE: | |
17287 | if (dump_enabled_p ()) | |
17288 | dump_printf_loc (MSG_NOTE, tloc, | |
17289 | "Will not turn target construct into a " | |
17290 | "gridified GPGPU kernel because a lastprivate " | |
17291 | "clause is present\n "); | |
17292 | return false; | |
17293 | ||
17294 | case OMP_CLAUSE_THREAD_LIMIT: | |
17295 | group_size = OMP_CLAUSE_OPERAND (clauses, 0); | |
17296 | break; | |
17297 | ||
17298 | default: | |
17299 | break; | |
17300 | } | |
17301 | clauses = OMP_CLAUSE_CHAIN (clauses); | |
17302 | } | |
17303 | ||
17304 | stmt = grid_find_single_omp_among_assignments (gimple_omp_body (teams), tloc, | |
17305 | "teams"); | |
17306 | if (!stmt) | |
17307 | return false; | |
17308 | gomp_for *dist = dyn_cast <gomp_for *> (stmt); | |
17309 | if (!dist) | |
17310 | { | |
17311 | dump_printf_loc (MSG_NOTE, tloc, | |
17312 | "Will not turn target construct into a simple " | |
17313 | "GPGPU kernel because the teams construct does not have " | |
17314 | "a sole distribute construct in it.\n"); | |
17315 | return false; | |
17316 | } | |
17317 | ||
17318 | gcc_assert (gimple_omp_for_kind (dist) == GF_OMP_FOR_KIND_DISTRIBUTE); | |
17319 | if (!gimple_omp_for_combined_p (dist)) | |
17320 | { | |
17321 | if (dump_enabled_p ()) | |
17322 | dump_printf_loc (MSG_NOTE, tloc, | |
17323 | "Will not turn target construct into a gridified GPGPU " | |
17324 | "kernel because we cannot handle a standalone " | |
17325 | "distribute construct\n "); | |
17326 | return false; | |
17327 | } | |
17328 | if (dist->collapse > 1) | |
17329 | { | |
17330 | if (dump_enabled_p ()) | |
17331 | dump_printf_loc (MSG_NOTE, tloc, | |
17332 | "Will not turn target construct into a gridified GPGPU " | |
17333 | "kernel because the distribute construct contains " | |
17334 | "collapse clause\n"); | |
17335 | return false; | |
17336 | } | |
17337 | struct omp_for_data fd; | |
17338 | extract_omp_for_data (dist, &fd, NULL); | |
17339 | if (fd.chunk_size) | |
17340 | { | |
17341 | if (group_size && !operand_equal_p (group_size, fd.chunk_size, 0)) | |
17342 | { | |
17343 | if (dump_enabled_p ()) | |
17344 | dump_printf_loc (MSG_NOTE, tloc, | |
17345 | "Will not turn target construct into a " | |
17346 | "gridified GPGPU kernel because the teams " | |
17347 | "thread limit is different from distribute " | |
17348 | "schedule chunk\n"); | |
17349 | return false; | |
17350 | } | |
17351 | group_size = fd.chunk_size; | |
17352 | } | |
17353 | stmt = grid_find_single_omp_among_assignments (gimple_omp_body (dist), tloc, | |
17354 | "distribute"); | |
17355 | gomp_parallel *par; | |
17356 | if (!stmt || !(par = dyn_cast <gomp_parallel *> (stmt))) | |
17357 | return false; | |
17358 | ||
17359 | clauses = gimple_omp_parallel_clauses (par); | |
17360 | while (clauses) | |
17361 | { | |
17362 | switch (OMP_CLAUSE_CODE (clauses)) | |
17363 | { | |
17364 | case OMP_CLAUSE_NUM_THREADS: | |
17365 | if (dump_enabled_p ()) | |
17366 | dump_printf_loc (MSG_NOTE, tloc, | |
17367 | "Will not turn target construct into a gridified" | |
17368 | "GPGPU kernel because there is a num_threads " | |
17369 | "clause of the parallel construct\n"); | |
17370 | return false; | |
17371 | ||
17372 | case OMP_CLAUSE_REDUCTION: | |
17373 | if (dump_enabled_p ()) | |
17374 | dump_printf_loc (MSG_NOTE, tloc, | |
17375 | "Will not turn target construct into a " | |
17376 | "gridified GPGPU kernel because a reduction " | |
17377 | "clause is present\n "); | |
17378 | return false; | |
17379 | ||
17380 | case OMP_CLAUSE_LASTPRIVATE: | |
17381 | if (dump_enabled_p ()) | |
17382 | dump_printf_loc (MSG_NOTE, tloc, | |
17383 | "Will not turn target construct into a " | |
17384 | "gridified GPGPU kernel because a lastprivate " | |
17385 | "clause is present\n "); | |
17386 | return false; | |
17387 | ||
17388 | default: | |
17389 | break; | |
17390 | } | |
17391 | clauses = OMP_CLAUSE_CHAIN (clauses); | |
17392 | } | |
17393 | ||
17394 | stmt = grid_find_single_omp_among_assignments (gimple_omp_body (par), tloc, | |
17395 | "parallel"); | |
17396 | gomp_for *gfor; | |
17397 | if (!stmt || !(gfor = dyn_cast <gomp_for *> (stmt))) | |
17398 | return false; | |
17399 | ||
17400 | if (gimple_omp_for_kind (gfor) != GF_OMP_FOR_KIND_FOR) | |
17401 | { | |
17402 | if (dump_enabled_p ()) | |
17403 | dump_printf_loc (MSG_NOTE, tloc, | |
17404 | "Will not turn target construct into a gridified GPGPU " | |
17405 | "kernel because the inner loop is not a simple for " | |
17406 | "loop\n"); | |
17407 | return false; | |
17408 | } | |
17409 | if (gfor->collapse > 1) | |
17410 | { | |
17411 | if (dump_enabled_p ()) | |
17412 | dump_printf_loc (MSG_NOTE, tloc, | |
17413 | "Will not turn target construct into a gridified GPGPU " | |
17414 | "kernel because the inner loop contains collapse " | |
17415 | "clause\n"); | |
17416 | return false; | |
17417 | } | |
17418 | ||
17419 | if (!grid_seq_only_contains_local_assignments (gimple_omp_for_pre_body (gfor))) | |
17420 | { | |
17421 | if (dump_enabled_p ()) | |
17422 | dump_printf_loc (MSG_NOTE, tloc, | |
17423 | "Will not turn target construct into a gridified GPGPU " | |
17424 | "kernel because the inner loop pre_body contains" | |
17425 | "a complex instruction\n"); | |
17426 | return false; | |
17427 | } | |
17428 | ||
17429 | clauses = gimple_omp_for_clauses (gfor); | |
17430 | while (clauses) | |
17431 | { | |
17432 | switch (OMP_CLAUSE_CODE (clauses)) | |
17433 | { | |
17434 | case OMP_CLAUSE_SCHEDULE: | |
17435 | if (OMP_CLAUSE_SCHEDULE_KIND (clauses) != OMP_CLAUSE_SCHEDULE_AUTO) | |
17436 | { | |
17437 | if (dump_enabled_p ()) | |
17438 | dump_printf_loc (MSG_NOTE, tloc, | |
17439 | "Will not turn target construct into a " | |
17440 | "gridified GPGPU kernel because the inner " | |
17441 | "loop has a non-automatic scheduling clause\n"); | |
17442 | return false; | |
17443 | } | |
17444 | break; | |
17445 | ||
17446 | case OMP_CLAUSE_REDUCTION: | |
17447 | if (dump_enabled_p ()) | |
17448 | dump_printf_loc (MSG_NOTE, tloc, | |
17449 | "Will not turn target construct into a " | |
17450 | "gridified GPGPU kernel because a reduction " | |
17451 | "clause is present\n "); | |
17452 | return false; | |
17453 | ||
17454 | case OMP_CLAUSE_LASTPRIVATE: | |
17455 | if (dump_enabled_p ()) | |
17456 | dump_printf_loc (MSG_NOTE, tloc, | |
17457 | "Will not turn target construct into a " | |
17458 | "gridified GPGPU kernel because a lastprivate " | |
17459 | "clause is present\n "); | |
17460 | return false; | |
17461 | ||
17462 | default: | |
17463 | break; | |
17464 | } | |
17465 | clauses = OMP_CLAUSE_CHAIN (clauses); | |
17466 | } | |
17467 | ||
17468 | struct walk_stmt_info wi; | |
17469 | memset (&wi, 0, sizeof (wi)); | |
17470 | if (gimple *bad = walk_gimple_seq (gimple_omp_body (gfor), | |
17471 | grid_find_ungridifiable_statement, | |
17472 | NULL, &wi)) | |
17473 | { | |
17474 | if (dump_enabled_p ()) | |
17475 | { | |
17476 | if (is_gimple_call (bad)) | |
17477 | dump_printf_loc (MSG_NOTE, tloc, | |
17478 | "Will not turn target construct into a gridified " | |
17479 | " GPGPU kernel because the inner loop contains " | |
17480 | "call to a noreturn function\n"); | |
17481 | else | |
17482 | dump_printf_loc (MSG_NOTE, tloc, | |
17483 | "Will not turn target construct into a gridified " | |
17484 | "GPGPU kernel because the inner loop contains " | |
17485 | "statement %s which cannot be transformed\n", | |
17486 | gimple_code_name[(int) gimple_code (bad)]); | |
17487 | } | |
17488 | return false; | |
17489 | } | |
17490 | ||
17491 | *group_size_p = group_size; | |
17492 | return true; | |
17493 | } | |
17494 | ||
17495 | /* Operand walker, used to remap pre-body declarations according to a hash map | |
17496 | provided in DATA. */ | |
17497 | ||
17498 | static tree | |
17499 | grid_remap_prebody_decls (tree *tp, int *walk_subtrees, void *data) | |
17500 | { | |
17501 | tree t = *tp; | |
17502 | ||
17503 | if (DECL_P (t) || TYPE_P (t)) | |
17504 | *walk_subtrees = 0; | |
17505 | else | |
17506 | *walk_subtrees = 1; | |
17507 | ||
17508 | if (TREE_CODE (t) == VAR_DECL) | |
17509 | { | |
17510 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data; | |
17511 | hash_map<tree, tree> *declmap = (hash_map<tree, tree> *) wi->info; | |
17512 | tree *repl = declmap->get (t); | |
17513 | if (repl) | |
17514 | *tp = *repl; | |
17515 | } | |
17516 | return NULL_TREE; | |
17517 | } | |
17518 | ||
17519 | /* Copy leading register-type assignments to local variables in SRC to just | |
17520 | before DST, Creating temporaries, adjusting mapping of operands in WI and | |
17521 | remapping operands as necessary. Add any new temporaries to TGT_BIND. | |
17522 | Return the first statement that does not conform to | |
17523 | grid_reg_assignment_to_local_var_p or NULL. */ | |
17524 | ||
17525 | static gimple * | |
17526 | grid_copy_leading_local_assignments (gimple_seq src, gimple_stmt_iterator *dst, | |
17527 | gbind *tgt_bind, struct walk_stmt_info *wi) | |
17528 | { | |
17529 | hash_map<tree, tree> *declmap = (hash_map<tree, tree> *) wi->info; | |
17530 | gimple_stmt_iterator gsi; | |
17531 | for (gsi = gsi_start (src); !gsi_end_p (gsi); gsi_next (&gsi)) | |
17532 | { | |
17533 | gimple *stmt = gsi_stmt (gsi); | |
17534 | if (gbind *bind = dyn_cast <gbind *> (stmt)) | |
17535 | { | |
17536 | gimple *r = grid_copy_leading_local_assignments | |
17537 | (gimple_bind_body (bind), dst, tgt_bind, wi); | |
17538 | if (r) | |
17539 | return r; | |
17540 | else | |
17541 | continue; | |
17542 | } | |
17543 | if (!grid_reg_assignment_to_local_var_p (stmt)) | |
17544 | return stmt; | |
17545 | tree lhs = gimple_assign_lhs (as_a <gassign *> (stmt)); | |
17546 | tree repl = copy_var_decl (lhs, create_tmp_var_name (NULL), | |
17547 | TREE_TYPE (lhs)); | |
17548 | DECL_CONTEXT (repl) = current_function_decl; | |
17549 | gimple_bind_append_vars (tgt_bind, repl); | |
17550 | ||
17551 | declmap->put (lhs, repl); | |
17552 | gassign *copy = as_a <gassign *> (gimple_copy (stmt)); | |
17553 | walk_gimple_op (copy, grid_remap_prebody_decls, wi); | |
17554 | gsi_insert_before (dst, copy, GSI_SAME_STMT); | |
17555 | } | |
17556 | return NULL; | |
17557 | } | |
17558 | ||
17559 | /* Given freshly copied top level kernel SEQ, identify the individual OMP | |
17560 | components, mark them as part of kernel and return the inner loop, and copy | |
17561 | assignment leading to them just before DST, remapping them using WI and | |
17562 | adding new temporaries to TGT_BIND. */ | |
17563 | ||
17564 | static gomp_for * | |
17565 | grid_process_kernel_body_copy (gimple_seq seq, gimple_stmt_iterator *dst, | |
17566 | gbind *tgt_bind, struct walk_stmt_info *wi) | |
17567 | { | |
17568 | gimple *stmt = grid_copy_leading_local_assignments (seq, dst, tgt_bind, wi); | |
17569 | gomp_teams *teams = dyn_cast <gomp_teams *> (stmt); | |
17570 | gcc_assert (teams); | |
17571 | gimple_omp_teams_set_grid_phony (teams, true); | |
17572 | stmt = grid_copy_leading_local_assignments (gimple_omp_body (teams), dst, | |
17573 | tgt_bind, wi); | |
17574 | gcc_checking_assert (stmt); | |
17575 | gomp_for *dist = dyn_cast <gomp_for *> (stmt); | |
17576 | gcc_assert (dist); | |
17577 | gimple_seq prebody = gimple_omp_for_pre_body (dist); | |
17578 | if (prebody) | |
17579 | grid_copy_leading_local_assignments (prebody, dst, tgt_bind, wi); | |
17580 | gimple_omp_for_set_grid_phony (dist, true); | |
17581 | stmt = grid_copy_leading_local_assignments (gimple_omp_body (dist), dst, | |
17582 | tgt_bind, wi); | |
17583 | gcc_checking_assert (stmt); | |
17584 | ||
17585 | gomp_parallel *parallel = as_a <gomp_parallel *> (stmt); | |
17586 | gimple_omp_parallel_set_grid_phony (parallel, true); | |
17587 | stmt = grid_copy_leading_local_assignments (gimple_omp_body (parallel), dst, | |
17588 | tgt_bind, wi); | |
17589 | gomp_for *inner_loop = as_a <gomp_for *> (stmt); | |
17590 | gimple_omp_for_set_kind (inner_loop, GF_OMP_FOR_KIND_GRID_LOOP); | |
17591 | prebody = gimple_omp_for_pre_body (inner_loop); | |
17592 | if (prebody) | |
17593 | grid_copy_leading_local_assignments (prebody, dst, tgt_bind, wi); | |
17594 | ||
17595 | return inner_loop; | |
17596 | } | |
17597 | ||
17598 | /* If TARGET points to a GOMP_TARGET which follows a gridifiable pattern, | |
17599 | create a GPU kernel for it. GSI must point to the same statement, TGT_BIND | |
17600 | is the bind into which temporaries inserted before TARGET should be | |
17601 | added. */ | |
17602 | ||
17603 | static void | |
17604 | grid_attempt_target_gridification (gomp_target *target, | |
17605 | gimple_stmt_iterator *gsi, | |
17606 | gbind *tgt_bind) | |
17607 | { | |
17608 | tree group_size; | |
17609 | if (!target || !grid_target_follows_gridifiable_pattern (target, &group_size)) | |
17610 | return; | |
17611 | ||
17612 | location_t loc = gimple_location (target); | |
17613 | if (dump_enabled_p ()) | |
17614 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, loc, | |
17615 | "Target construct will be turned into a gridified GPGPU " | |
17616 | "kernel\n"); | |
17617 | ||
17618 | /* Copy target body to a GPUKERNEL construct: */ | |
17619 | gimple_seq kernel_seq = copy_gimple_seq_and_replace_locals | |
17620 | (gimple_omp_body (target)); | |
17621 | ||
17622 | hash_map<tree, tree> *declmap = new hash_map<tree, tree>; | |
17623 | struct walk_stmt_info wi; | |
17624 | memset (&wi, 0, sizeof (struct walk_stmt_info)); | |
17625 | wi.info = declmap; | |
17626 | ||
17627 | /* Copy assignments in between OMP statements before target, mark OMP | |
17628 | statements within copy appropriatly. */ | |
17629 | gomp_for *inner_loop = grid_process_kernel_body_copy (kernel_seq, gsi, | |
17630 | tgt_bind, &wi); | |
17631 | ||
17632 | gbind *old_bind = as_a <gbind *> (gimple_seq_first (gimple_omp_body (target))); | |
17633 | gbind *new_bind = as_a <gbind *> (gimple_seq_first (kernel_seq)); | |
17634 | tree new_block = gimple_bind_block (new_bind); | |
17635 | tree enc_block = BLOCK_SUPERCONTEXT (gimple_bind_block (old_bind)); | |
17636 | BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (enc_block); | |
17637 | BLOCK_SUBBLOCKS (enc_block) = new_block; | |
17638 | BLOCK_SUPERCONTEXT (new_block) = enc_block; | |
17639 | gimple *gpukernel = gimple_build_omp_grid_body (kernel_seq); | |
17640 | gimple_seq_add_stmt | |
17641 | (gimple_bind_body_ptr (as_a <gbind *> (gimple_omp_body (target))), | |
17642 | gpukernel); | |
17643 | ||
17644 | walk_tree (&group_size, grid_remap_prebody_decls, &wi, NULL); | |
17645 | push_gimplify_context (); | |
17646 | size_t collapse = gimple_omp_for_collapse (inner_loop); | |
17647 | for (size_t i = 0; i < collapse; i++) | |
17648 | { | |
17649 | tree itype, type = TREE_TYPE (gimple_omp_for_index (inner_loop, i)); | |
17650 | if (POINTER_TYPE_P (type)) | |
17651 | itype = signed_type_for (type); | |
17652 | else | |
17653 | itype = type; | |
17654 | ||
17655 | enum tree_code cond_code = gimple_omp_for_cond (inner_loop, i); | |
17656 | tree n1 = unshare_expr (gimple_omp_for_initial (inner_loop, i)); | |
17657 | walk_tree (&n1, grid_remap_prebody_decls, &wi, NULL); | |
17658 | tree n2 = unshare_expr (gimple_omp_for_final (inner_loop, i)); | |
17659 | walk_tree (&n2, grid_remap_prebody_decls, &wi, NULL); | |
17660 | adjust_for_condition (loc, &cond_code, &n2); | |
17661 | tree step; | |
17662 | step = get_omp_for_step_from_incr (loc, | |
17663 | gimple_omp_for_incr (inner_loop, i)); | |
17664 | gimple_seq tmpseq = NULL; | |
17665 | n1 = fold_convert (itype, n1); | |
17666 | n2 = fold_convert (itype, n2); | |
17667 | tree t = build_int_cst (itype, (cond_code == LT_EXPR ? -1 : 1)); | |
17668 | t = fold_build2 (PLUS_EXPR, itype, step, t); | |
17669 | t = fold_build2 (PLUS_EXPR, itype, t, n2); | |
17670 | t = fold_build2 (MINUS_EXPR, itype, t, n1); | |
17671 | if (TYPE_UNSIGNED (itype) && cond_code == GT_EXPR) | |
17672 | t = fold_build2 (TRUNC_DIV_EXPR, itype, | |
17673 | fold_build1 (NEGATE_EXPR, itype, t), | |
17674 | fold_build1 (NEGATE_EXPR, itype, step)); | |
17675 | else | |
17676 | t = fold_build2 (TRUNC_DIV_EXPR, itype, t, step); | |
17677 | tree gs = fold_convert (uint32_type_node, t); | |
17678 | gimplify_expr (&gs, &tmpseq, NULL, is_gimple_val, fb_rvalue); | |
17679 | if (!gimple_seq_empty_p (tmpseq)) | |
17680 | gsi_insert_seq_before (gsi, tmpseq, GSI_SAME_STMT); | |
17681 | ||
17682 | tree ws; | |
17683 | if (i == 0 && group_size) | |
17684 | { | |
17685 | ws = fold_convert (uint32_type_node, group_size); | |
17686 | tmpseq = NULL; | |
17687 | gimplify_expr (&ws, &tmpseq, NULL, is_gimple_val, fb_rvalue); | |
17688 | if (!gimple_seq_empty_p (tmpseq)) | |
17689 | gsi_insert_seq_before (gsi, tmpseq, GSI_SAME_STMT); | |
17690 | } | |
17691 | else | |
17692 | ws = build_zero_cst (uint32_type_node); | |
17693 | ||
17694 | tree c = build_omp_clause (UNKNOWN_LOCATION, OMP_CLAUSE__GRIDDIM_); | |
17695 | OMP_CLAUSE__GRIDDIM__DIMENSION (c) = i; | |
17696 | OMP_CLAUSE__GRIDDIM__SIZE (c) = gs; | |
17697 | OMP_CLAUSE__GRIDDIM__GROUP (c) = ws; | |
17698 | OMP_CLAUSE_CHAIN (c) = gimple_omp_target_clauses (target); | |
17699 | gimple_omp_target_set_clauses (target, c); | |
17700 | } | |
17701 | pop_gimplify_context (tgt_bind); | |
17702 | delete declmap; | |
17703 | return; | |
17704 | } | |
17705 | ||
17706 | /* Walker function doing all the work for create_target_kernels. */ | |
17707 | ||
17708 | static tree | |
17709 | grid_gridify_all_targets_stmt (gimple_stmt_iterator *gsi, | |
17710 | bool *handled_ops_p, | |
17711 | struct walk_stmt_info *incoming) | |
17712 | { | |
17713 | *handled_ops_p = false; | |
17714 | ||
17715 | gimple *stmt = gsi_stmt (*gsi); | |
17716 | gomp_target *target = dyn_cast <gomp_target *> (stmt); | |
17717 | if (target) | |
17718 | { | |
17719 | gbind *tgt_bind = (gbind *) incoming->info; | |
17720 | gcc_checking_assert (tgt_bind); | |
17721 | grid_attempt_target_gridification (target, gsi, tgt_bind); | |
17722 | return NULL_TREE; | |
17723 | } | |
17724 | gbind *bind = dyn_cast <gbind *> (stmt); | |
17725 | if (bind) | |
17726 | { | |
17727 | *handled_ops_p = true; | |
17728 | struct walk_stmt_info wi; | |
17729 | memset (&wi, 0, sizeof (wi)); | |
17730 | wi.info = bind; | |
17731 | walk_gimple_seq_mod (gimple_bind_body_ptr (bind), | |
17732 | grid_gridify_all_targets_stmt, NULL, &wi); | |
17733 | } | |
17734 | return NULL_TREE; | |
17735 | } | |
17736 | ||
17737 | /* Attempt to gridify all target constructs in BODY_P. All such targets will | |
17738 | have their bodies duplicated, with the new copy being put into a | |
17739 | gimple_omp_grid_body statement. All kernel-related construct within the | |
17740 | grid_body will be marked with phony flags or kernel kinds. Moreover, some | |
17741 | re-structuring is often needed, such as copying pre-bodies before the target | |
17742 | construct so that kernel grid sizes can be computed. */ | |
17743 | ||
17744 | static void | |
17745 | grid_gridify_all_targets (gimple_seq *body_p) | |
17746 | { | |
17747 | struct walk_stmt_info wi; | |
17748 | memset (&wi, 0, sizeof (wi)); | |
17749 | walk_gimple_seq_mod (body_p, grid_gridify_all_targets_stmt, NULL, &wi); | |
17750 | } | |
953ff289 | 17751 | \f |
b2b40051 | 17752 | |
953ff289 DN |
17753 | /* Main entry point. */ |
17754 | ||
c2924966 | 17755 | static unsigned int |
953ff289 DN |
17756 | execute_lower_omp (void) |
17757 | { | |
726a989a | 17758 | gimple_seq body; |
5771c391 JJ |
17759 | int i; |
17760 | omp_context *ctx; | |
726a989a | 17761 | |
535b544a | 17762 | /* This pass always runs, to provide PROP_gimple_lomp. |
41dbbb37 TS |
17763 | But often, there is nothing to do. */ |
17764 | if (flag_cilkplus == 0 && flag_openacc == 0 && flag_openmp == 0 | |
17765 | && flag_openmp_simd == 0) | |
535b544a SB |
17766 | return 0; |
17767 | ||
953ff289 DN |
17768 | all_contexts = splay_tree_new (splay_tree_compare_pointers, 0, |
17769 | delete_omp_context); | |
17770 | ||
726a989a | 17771 | body = gimple_body (current_function_decl); |
b2b40051 MJ |
17772 | |
17773 | if (hsa_gen_requested_p ()) | |
17774 | grid_gridify_all_targets (&body); | |
17775 | ||
26127932 | 17776 | scan_omp (&body, NULL); |
a68ab351 | 17777 | gcc_assert (taskreg_nesting_level == 0); |
5771c391 JJ |
17778 | FOR_EACH_VEC_ELT (taskreg_contexts, i, ctx) |
17779 | finish_taskreg_scan (ctx); | |
17780 | taskreg_contexts.release (); | |
953ff289 DN |
17781 | |
17782 | if (all_contexts->root) | |
a68ab351 JJ |
17783 | { |
17784 | if (task_shared_vars) | |
45852dcc | 17785 | push_gimplify_context (); |
355a7673 | 17786 | lower_omp (&body, NULL); |
a68ab351 JJ |
17787 | if (task_shared_vars) |
17788 | pop_gimplify_context (NULL); | |
17789 | } | |
953ff289 | 17790 | |
50674e96 DN |
17791 | if (all_contexts) |
17792 | { | |
17793 | splay_tree_delete (all_contexts); | |
17794 | all_contexts = NULL; | |
17795 | } | |
a68ab351 | 17796 | BITMAP_FREE (task_shared_vars); |
c2924966 | 17797 | return 0; |
953ff289 DN |
17798 | } |
17799 | ||
17795822 TS |
17800 | namespace { |
17801 | ||
17802 | const pass_data pass_data_lower_omp = | |
27a4cd48 DM |
17803 | { |
17804 | GIMPLE_PASS, /* type */ | |
17805 | "omplower", /* name */ | |
17806 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
17807 | TV_NONE, /* tv_id */ |
17808 | PROP_gimple_any, /* properties_required */ | |
17809 | PROP_gimple_lomp, /* properties_provided */ | |
17810 | 0, /* properties_destroyed */ | |
17811 | 0, /* todo_flags_start */ | |
17812 | 0, /* todo_flags_finish */ | |
953ff289 | 17813 | }; |
27a4cd48 | 17814 | |
17795822 | 17815 | class pass_lower_omp : public gimple_opt_pass |
27a4cd48 DM |
17816 | { |
17817 | public: | |
c3284718 RS |
17818 | pass_lower_omp (gcc::context *ctxt) |
17819 | : gimple_opt_pass (pass_data_lower_omp, ctxt) | |
27a4cd48 DM |
17820 | {} |
17821 | ||
17822 | /* opt_pass methods: */ | |
be55bfe6 | 17823 | virtual unsigned int execute (function *) { return execute_lower_omp (); } |
27a4cd48 DM |
17824 | |
17825 | }; // class pass_lower_omp | |
17826 | ||
17795822 TS |
17827 | } // anon namespace |
17828 | ||
27a4cd48 DM |
17829 | gimple_opt_pass * |
17830 | make_pass_lower_omp (gcc::context *ctxt) | |
17831 | { | |
17832 | return new pass_lower_omp (ctxt); | |
17833 | } | |
953ff289 | 17834 | \f |
41dbbb37 | 17835 | /* The following is a utility to diagnose structured block violations. |
777f7f9a RH |
17836 | It is not part of the "omplower" pass, as that's invoked too late. It |
17837 | should be invoked by the respective front ends after gimplification. */ | |
953ff289 DN |
17838 | |
17839 | static splay_tree all_labels; | |
17840 | ||
17841 | /* Check for mismatched contexts and generate an error if needed. Return | |
17842 | true if an error is detected. */ | |
17843 | ||
17844 | static bool | |
726a989a | 17845 | diagnose_sb_0 (gimple_stmt_iterator *gsi_p, |
355fe088 | 17846 | gimple *branch_ctx, gimple *label_ctx) |
953ff289 | 17847 | { |
41dbbb37 TS |
17848 | gcc_checking_assert (!branch_ctx || is_gimple_omp (branch_ctx)); |
17849 | gcc_checking_assert (!label_ctx || is_gimple_omp (label_ctx)); | |
17850 | ||
726a989a | 17851 | if (label_ctx == branch_ctx) |
953ff289 DN |
17852 | return false; |
17853 | ||
41dbbb37 TS |
17854 | const char* kind = NULL; |
17855 | ||
17856 | if (flag_cilkplus) | |
17857 | { | |
17858 | if ((branch_ctx | |
17859 | && gimple_code (branch_ctx) == GIMPLE_OMP_FOR | |
17860 | && gimple_omp_for_kind (branch_ctx) == GF_OMP_FOR_KIND_CILKSIMD) | |
17861 | || (label_ctx | |
17862 | && gimple_code (label_ctx) == GIMPLE_OMP_FOR | |
17863 | && gimple_omp_for_kind (label_ctx) == GF_OMP_FOR_KIND_CILKSIMD)) | |
17864 | kind = "Cilk Plus"; | |
17865 | } | |
17866 | if (flag_openacc) | |
17867 | { | |
17868 | if ((branch_ctx && is_gimple_omp_oacc (branch_ctx)) | |
17869 | || (label_ctx && is_gimple_omp_oacc (label_ctx))) | |
17870 | { | |
17871 | gcc_checking_assert (kind == NULL); | |
17872 | kind = "OpenACC"; | |
17873 | } | |
17874 | } | |
17875 | if (kind == NULL) | |
17876 | { | |
17877 | gcc_checking_assert (flag_openmp); | |
17878 | kind = "OpenMP"; | |
17879 | } | |
b8698a0f | 17880 | |
726a989a RB |
17881 | /* |
17882 | Previously we kept track of the label's entire context in diagnose_sb_[12] | |
17883 | so we could traverse it and issue a correct "exit" or "enter" error | |
17884 | message upon a structured block violation. | |
17885 | ||
17886 | We built the context by building a list with tree_cons'ing, but there is | |
17887 | no easy counterpart in gimple tuples. It seems like far too much work | |
17888 | for issuing exit/enter error messages. If someone really misses the | |
17889 | distinct error message... patches welcome. | |
17890 | */ | |
b8698a0f | 17891 | |
726a989a | 17892 | #if 0 |
953ff289 | 17893 | /* Try to avoid confusing the user by producing and error message |
fa10beec | 17894 | with correct "exit" or "enter" verbiage. We prefer "exit" |
953ff289 DN |
17895 | unless we can show that LABEL_CTX is nested within BRANCH_CTX. */ |
17896 | if (branch_ctx == NULL) | |
17897 | exit_p = false; | |
17898 | else | |
17899 | { | |
17900 | while (label_ctx) | |
17901 | { | |
17902 | if (TREE_VALUE (label_ctx) == branch_ctx) | |
17903 | { | |
17904 | exit_p = false; | |
17905 | break; | |
17906 | } | |
17907 | label_ctx = TREE_CHAIN (label_ctx); | |
17908 | } | |
17909 | } | |
17910 | ||
17911 | if (exit_p) | |
41dbbb37 | 17912 | error ("invalid exit from %s structured block", kind); |
953ff289 | 17913 | else |
41dbbb37 | 17914 | error ("invalid entry to %s structured block", kind); |
726a989a | 17915 | #endif |
953ff289 | 17916 | |
726a989a RB |
17917 | /* If it's obvious we have an invalid entry, be specific about the error. */ |
17918 | if (branch_ctx == NULL) | |
41dbbb37 | 17919 | error ("invalid entry to %s structured block", kind); |
726a989a | 17920 | else |
c02065fc AH |
17921 | { |
17922 | /* Otherwise, be vague and lazy, but efficient. */ | |
41dbbb37 | 17923 | error ("invalid branch to/from %s structured block", kind); |
c02065fc | 17924 | } |
726a989a RB |
17925 | |
17926 | gsi_replace (gsi_p, gimple_build_nop (), false); | |
953ff289 DN |
17927 | return true; |
17928 | } | |
17929 | ||
41dbbb37 | 17930 | /* Pass 1: Create a minimal tree of structured blocks, and record |
726a989a | 17931 | where each label is found. */ |
953ff289 DN |
17932 | |
17933 | static tree | |
726a989a RB |
17934 | diagnose_sb_1 (gimple_stmt_iterator *gsi_p, bool *handled_ops_p, |
17935 | struct walk_stmt_info *wi) | |
953ff289 | 17936 | { |
355fe088 TS |
17937 | gimple *context = (gimple *) wi->info; |
17938 | gimple *inner_context; | |
17939 | gimple *stmt = gsi_stmt (*gsi_p); | |
953ff289 | 17940 | |
726a989a RB |
17941 | *handled_ops_p = true; |
17942 | ||
41dbbb37 | 17943 | switch (gimple_code (stmt)) |
953ff289 | 17944 | { |
726a989a | 17945 | WALK_SUBSTMTS; |
b8698a0f | 17946 | |
726a989a RB |
17947 | case GIMPLE_OMP_PARALLEL: |
17948 | case GIMPLE_OMP_TASK: | |
17949 | case GIMPLE_OMP_SECTIONS: | |
17950 | case GIMPLE_OMP_SINGLE: | |
17951 | case GIMPLE_OMP_SECTION: | |
17952 | case GIMPLE_OMP_MASTER: | |
17953 | case GIMPLE_OMP_ORDERED: | |
17954 | case GIMPLE_OMP_CRITICAL: | |
acf0174b JJ |
17955 | case GIMPLE_OMP_TARGET: |
17956 | case GIMPLE_OMP_TEAMS: | |
17957 | case GIMPLE_OMP_TASKGROUP: | |
726a989a RB |
17958 | /* The minimal context here is just the current OMP construct. */ |
17959 | inner_context = stmt; | |
953ff289 | 17960 | wi->info = inner_context; |
726a989a | 17961 | walk_gimple_seq (gimple_omp_body (stmt), diagnose_sb_1, NULL, wi); |
953ff289 DN |
17962 | wi->info = context; |
17963 | break; | |
17964 | ||
726a989a RB |
17965 | case GIMPLE_OMP_FOR: |
17966 | inner_context = stmt; | |
953ff289 | 17967 | wi->info = inner_context; |
726a989a RB |
17968 | /* gimple_omp_for_{index,initial,final} are all DECLs; no need to |
17969 | walk them. */ | |
17970 | walk_gimple_seq (gimple_omp_for_pre_body (stmt), | |
17971 | diagnose_sb_1, NULL, wi); | |
17972 | walk_gimple_seq (gimple_omp_body (stmt), diagnose_sb_1, NULL, wi); | |
953ff289 DN |
17973 | wi->info = context; |
17974 | break; | |
17975 | ||
726a989a | 17976 | case GIMPLE_LABEL: |
538dd0b7 DM |
17977 | splay_tree_insert (all_labels, |
17978 | (splay_tree_key) gimple_label_label ( | |
17979 | as_a <glabel *> (stmt)), | |
953ff289 DN |
17980 | (splay_tree_value) context); |
17981 | break; | |
17982 | ||
17983 | default: | |
17984 | break; | |
17985 | } | |
17986 | ||
17987 | return NULL_TREE; | |
17988 | } | |
17989 | ||
17990 | /* Pass 2: Check each branch and see if its context differs from that of | |
17991 | the destination label's context. */ | |
17992 | ||
17993 | static tree | |
726a989a RB |
17994 | diagnose_sb_2 (gimple_stmt_iterator *gsi_p, bool *handled_ops_p, |
17995 | struct walk_stmt_info *wi) | |
953ff289 | 17996 | { |
355fe088 | 17997 | gimple *context = (gimple *) wi->info; |
953ff289 | 17998 | splay_tree_node n; |
355fe088 | 17999 | gimple *stmt = gsi_stmt (*gsi_p); |
953ff289 | 18000 | |
726a989a RB |
18001 | *handled_ops_p = true; |
18002 | ||
18003 | switch (gimple_code (stmt)) | |
953ff289 | 18004 | { |
726a989a RB |
18005 | WALK_SUBSTMTS; |
18006 | ||
18007 | case GIMPLE_OMP_PARALLEL: | |
18008 | case GIMPLE_OMP_TASK: | |
18009 | case GIMPLE_OMP_SECTIONS: | |
18010 | case GIMPLE_OMP_SINGLE: | |
18011 | case GIMPLE_OMP_SECTION: | |
18012 | case GIMPLE_OMP_MASTER: | |
18013 | case GIMPLE_OMP_ORDERED: | |
18014 | case GIMPLE_OMP_CRITICAL: | |
acf0174b JJ |
18015 | case GIMPLE_OMP_TARGET: |
18016 | case GIMPLE_OMP_TEAMS: | |
18017 | case GIMPLE_OMP_TASKGROUP: | |
726a989a | 18018 | wi->info = stmt; |
355a7673 | 18019 | walk_gimple_seq_mod (gimple_omp_body_ptr (stmt), diagnose_sb_2, NULL, wi); |
953ff289 DN |
18020 | wi->info = context; |
18021 | break; | |
18022 | ||
726a989a RB |
18023 | case GIMPLE_OMP_FOR: |
18024 | wi->info = stmt; | |
18025 | /* gimple_omp_for_{index,initial,final} are all DECLs; no need to | |
18026 | walk them. */ | |
355a7673 MM |
18027 | walk_gimple_seq_mod (gimple_omp_for_pre_body_ptr (stmt), |
18028 | diagnose_sb_2, NULL, wi); | |
18029 | walk_gimple_seq_mod (gimple_omp_body_ptr (stmt), diagnose_sb_2, NULL, wi); | |
953ff289 DN |
18030 | wi->info = context; |
18031 | break; | |
18032 | ||
ca50f84a L |
18033 | case GIMPLE_COND: |
18034 | { | |
538dd0b7 DM |
18035 | gcond *cond_stmt = as_a <gcond *> (stmt); |
18036 | tree lab = gimple_cond_true_label (cond_stmt); | |
ca50f84a L |
18037 | if (lab) |
18038 | { | |
18039 | n = splay_tree_lookup (all_labels, | |
18040 | (splay_tree_key) lab); | |
18041 | diagnose_sb_0 (gsi_p, context, | |
355fe088 | 18042 | n ? (gimple *) n->value : NULL); |
ca50f84a | 18043 | } |
538dd0b7 | 18044 | lab = gimple_cond_false_label (cond_stmt); |
ca50f84a L |
18045 | if (lab) |
18046 | { | |
18047 | n = splay_tree_lookup (all_labels, | |
18048 | (splay_tree_key) lab); | |
18049 | diagnose_sb_0 (gsi_p, context, | |
355fe088 | 18050 | n ? (gimple *) n->value : NULL); |
ca50f84a L |
18051 | } |
18052 | } | |
18053 | break; | |
18054 | ||
726a989a | 18055 | case GIMPLE_GOTO: |
953ff289 | 18056 | { |
726a989a | 18057 | tree lab = gimple_goto_dest (stmt); |
953ff289 DN |
18058 | if (TREE_CODE (lab) != LABEL_DECL) |
18059 | break; | |
18060 | ||
18061 | n = splay_tree_lookup (all_labels, (splay_tree_key) lab); | |
355fe088 | 18062 | diagnose_sb_0 (gsi_p, context, n ? (gimple *) n->value : NULL); |
953ff289 DN |
18063 | } |
18064 | break; | |
18065 | ||
726a989a | 18066 | case GIMPLE_SWITCH: |
953ff289 | 18067 | { |
538dd0b7 | 18068 | gswitch *switch_stmt = as_a <gswitch *> (stmt); |
726a989a | 18069 | unsigned int i; |
538dd0b7 | 18070 | for (i = 0; i < gimple_switch_num_labels (switch_stmt); ++i) |
953ff289 | 18071 | { |
538dd0b7 | 18072 | tree lab = CASE_LABEL (gimple_switch_label (switch_stmt, i)); |
953ff289 | 18073 | n = splay_tree_lookup (all_labels, (splay_tree_key) lab); |
355fe088 | 18074 | if (n && diagnose_sb_0 (gsi_p, context, (gimple *) n->value)) |
953ff289 DN |
18075 | break; |
18076 | } | |
18077 | } | |
18078 | break; | |
18079 | ||
726a989a RB |
18080 | case GIMPLE_RETURN: |
18081 | diagnose_sb_0 (gsi_p, context, NULL); | |
953ff289 DN |
18082 | break; |
18083 | ||
18084 | default: | |
18085 | break; | |
18086 | } | |
18087 | ||
18088 | return NULL_TREE; | |
18089 | } | |
18090 | ||
41dbbb37 TS |
18091 | /* Called from tree-cfg.c::make_edges to create cfg edges for all relevant |
18092 | GIMPLE_* codes. */ | |
0645c1a2 | 18093 | bool |
09b22f48 JJ |
18094 | make_gimple_omp_edges (basic_block bb, struct omp_region **region, |
18095 | int *region_idx) | |
0645c1a2 | 18096 | { |
355fe088 | 18097 | gimple *last = last_stmt (bb); |
0645c1a2 AM |
18098 | enum gimple_code code = gimple_code (last); |
18099 | struct omp_region *cur_region = *region; | |
18100 | bool fallthru = false; | |
18101 | ||
18102 | switch (code) | |
18103 | { | |
18104 | case GIMPLE_OMP_PARALLEL: | |
18105 | case GIMPLE_OMP_TASK: | |
18106 | case GIMPLE_OMP_FOR: | |
18107 | case GIMPLE_OMP_SINGLE: | |
18108 | case GIMPLE_OMP_TEAMS: | |
18109 | case GIMPLE_OMP_MASTER: | |
18110 | case GIMPLE_OMP_TASKGROUP: | |
0645c1a2 AM |
18111 | case GIMPLE_OMP_CRITICAL: |
18112 | case GIMPLE_OMP_SECTION: | |
b2b40051 | 18113 | case GIMPLE_OMP_GRID_BODY: |
0645c1a2 AM |
18114 | cur_region = new_omp_region (bb, code, cur_region); |
18115 | fallthru = true; | |
18116 | break; | |
18117 | ||
d9a6bd32 JJ |
18118 | case GIMPLE_OMP_ORDERED: |
18119 | cur_region = new_omp_region (bb, code, cur_region); | |
18120 | fallthru = true; | |
18121 | if (find_omp_clause (gimple_omp_ordered_clauses | |
18122 | (as_a <gomp_ordered *> (last)), | |
18123 | OMP_CLAUSE_DEPEND)) | |
18124 | cur_region = cur_region->outer; | |
18125 | break; | |
18126 | ||
0645c1a2 AM |
18127 | case GIMPLE_OMP_TARGET: |
18128 | cur_region = new_omp_region (bb, code, cur_region); | |
18129 | fallthru = true; | |
41dbbb37 TS |
18130 | switch (gimple_omp_target_kind (last)) |
18131 | { | |
18132 | case GF_OMP_TARGET_KIND_REGION: | |
18133 | case GF_OMP_TARGET_KIND_DATA: | |
18134 | case GF_OMP_TARGET_KIND_OACC_PARALLEL: | |
18135 | case GF_OMP_TARGET_KIND_OACC_KERNELS: | |
18136 | case GF_OMP_TARGET_KIND_OACC_DATA: | |
37d5ad46 | 18137 | case GF_OMP_TARGET_KIND_OACC_HOST_DATA: |
41dbbb37 TS |
18138 | break; |
18139 | case GF_OMP_TARGET_KIND_UPDATE: | |
d9a6bd32 JJ |
18140 | case GF_OMP_TARGET_KIND_ENTER_DATA: |
18141 | case GF_OMP_TARGET_KIND_EXIT_DATA: | |
41dbbb37 TS |
18142 | case GF_OMP_TARGET_KIND_OACC_UPDATE: |
18143 | case GF_OMP_TARGET_KIND_OACC_ENTER_EXIT_DATA: | |
6e232ba4 | 18144 | case GF_OMP_TARGET_KIND_OACC_DECLARE: |
41dbbb37 TS |
18145 | cur_region = cur_region->outer; |
18146 | break; | |
18147 | default: | |
18148 | gcc_unreachable (); | |
18149 | } | |
0645c1a2 AM |
18150 | break; |
18151 | ||
18152 | case GIMPLE_OMP_SECTIONS: | |
18153 | cur_region = new_omp_region (bb, code, cur_region); | |
18154 | fallthru = true; | |
18155 | break; | |
18156 | ||
18157 | case GIMPLE_OMP_SECTIONS_SWITCH: | |
18158 | fallthru = false; | |
18159 | break; | |
18160 | ||
18161 | case GIMPLE_OMP_ATOMIC_LOAD: | |
18162 | case GIMPLE_OMP_ATOMIC_STORE: | |
18163 | fallthru = true; | |
18164 | break; | |
18165 | ||
18166 | case GIMPLE_OMP_RETURN: | |
18167 | /* In the case of a GIMPLE_OMP_SECTION, the edge will go | |
18168 | somewhere other than the next block. This will be | |
18169 | created later. */ | |
18170 | cur_region->exit = bb; | |
b37dddbc JJ |
18171 | if (cur_region->type == GIMPLE_OMP_TASK) |
18172 | /* Add an edge corresponding to not scheduling the task | |
18173 | immediately. */ | |
18174 | make_edge (cur_region->entry, bb, EDGE_ABNORMAL); | |
0645c1a2 AM |
18175 | fallthru = cur_region->type != GIMPLE_OMP_SECTION; |
18176 | cur_region = cur_region->outer; | |
18177 | break; | |
18178 | ||
18179 | case GIMPLE_OMP_CONTINUE: | |
18180 | cur_region->cont = bb; | |
18181 | switch (cur_region->type) | |
18182 | { | |
18183 | case GIMPLE_OMP_FOR: | |
18184 | /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE | |
18185 | succs edges as abnormal to prevent splitting | |
18186 | them. */ | |
18187 | single_succ_edge (cur_region->entry)->flags |= EDGE_ABNORMAL; | |
18188 | /* Make the loopback edge. */ | |
18189 | make_edge (bb, single_succ (cur_region->entry), | |
18190 | EDGE_ABNORMAL); | |
18191 | ||
18192 | /* Create an edge from GIMPLE_OMP_FOR to exit, which | |
18193 | corresponds to the case that the body of the loop | |
18194 | is not executed at all. */ | |
18195 | make_edge (cur_region->entry, bb->next_bb, EDGE_ABNORMAL); | |
18196 | make_edge (bb, bb->next_bb, EDGE_FALLTHRU | EDGE_ABNORMAL); | |
18197 | fallthru = false; | |
18198 | break; | |
18199 | ||
18200 | case GIMPLE_OMP_SECTIONS: | |
18201 | /* Wire up the edges into and out of the nested sections. */ | |
18202 | { | |
18203 | basic_block switch_bb = single_succ (cur_region->entry); | |
18204 | ||
18205 | struct omp_region *i; | |
18206 | for (i = cur_region->inner; i ; i = i->next) | |
18207 | { | |
18208 | gcc_assert (i->type == GIMPLE_OMP_SECTION); | |
18209 | make_edge (switch_bb, i->entry, 0); | |
18210 | make_edge (i->exit, bb, EDGE_FALLTHRU); | |
18211 | } | |
18212 | ||
18213 | /* Make the loopback edge to the block with | |
18214 | GIMPLE_OMP_SECTIONS_SWITCH. */ | |
18215 | make_edge (bb, switch_bb, 0); | |
18216 | ||
18217 | /* Make the edge from the switch to exit. */ | |
18218 | make_edge (switch_bb, bb->next_bb, 0); | |
18219 | fallthru = false; | |
18220 | } | |
18221 | break; | |
18222 | ||
b37dddbc JJ |
18223 | case GIMPLE_OMP_TASK: |
18224 | fallthru = true; | |
18225 | break; | |
18226 | ||
0645c1a2 AM |
18227 | default: |
18228 | gcc_unreachable (); | |
18229 | } | |
18230 | break; | |
18231 | ||
18232 | default: | |
18233 | gcc_unreachable (); | |
18234 | } | |
18235 | ||
18236 | if (*region != cur_region) | |
09b22f48 JJ |
18237 | { |
18238 | *region = cur_region; | |
18239 | if (cur_region) | |
18240 | *region_idx = cur_region->entry->index; | |
18241 | else | |
18242 | *region_idx = 0; | |
18243 | } | |
0645c1a2 AM |
18244 | |
18245 | return fallthru; | |
18246 | } | |
18247 | ||
a406865a RG |
18248 | static unsigned int |
18249 | diagnose_omp_structured_block_errors (void) | |
953ff289 | 18250 | { |
953ff289 | 18251 | struct walk_stmt_info wi; |
a406865a | 18252 | gimple_seq body = gimple_body (current_function_decl); |
953ff289 DN |
18253 | |
18254 | all_labels = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
18255 | ||
18256 | memset (&wi, 0, sizeof (wi)); | |
726a989a | 18257 | walk_gimple_seq (body, diagnose_sb_1, NULL, &wi); |
953ff289 DN |
18258 | |
18259 | memset (&wi, 0, sizeof (wi)); | |
953ff289 | 18260 | wi.want_locations = true; |
355a7673 MM |
18261 | walk_gimple_seq_mod (&body, diagnose_sb_2, NULL, &wi); |
18262 | ||
18263 | gimple_set_body (current_function_decl, body); | |
953ff289 DN |
18264 | |
18265 | splay_tree_delete (all_labels); | |
18266 | all_labels = NULL; | |
18267 | ||
a406865a | 18268 | return 0; |
953ff289 DN |
18269 | } |
18270 | ||
17795822 TS |
18271 | namespace { |
18272 | ||
18273 | const pass_data pass_data_diagnose_omp_blocks = | |
27a4cd48 DM |
18274 | { |
18275 | GIMPLE_PASS, /* type */ | |
18276 | "*diagnose_omp_blocks", /* name */ | |
18277 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
18278 | TV_NONE, /* tv_id */ |
18279 | PROP_gimple_any, /* properties_required */ | |
18280 | 0, /* properties_provided */ | |
18281 | 0, /* properties_destroyed */ | |
18282 | 0, /* todo_flags_start */ | |
18283 | 0, /* todo_flags_finish */ | |
a406865a RG |
18284 | }; |
18285 | ||
17795822 | 18286 | class pass_diagnose_omp_blocks : public gimple_opt_pass |
27a4cd48 DM |
18287 | { |
18288 | public: | |
c3284718 RS |
18289 | pass_diagnose_omp_blocks (gcc::context *ctxt) |
18290 | : gimple_opt_pass (pass_data_diagnose_omp_blocks, ctxt) | |
27a4cd48 DM |
18291 | {} |
18292 | ||
18293 | /* opt_pass methods: */ | |
41dbbb37 TS |
18294 | virtual bool gate (function *) |
18295 | { | |
18296 | return flag_cilkplus || flag_openacc || flag_openmp; | |
18297 | } | |
be55bfe6 TS |
18298 | virtual unsigned int execute (function *) |
18299 | { | |
18300 | return diagnose_omp_structured_block_errors (); | |
18301 | } | |
27a4cd48 DM |
18302 | |
18303 | }; // class pass_diagnose_omp_blocks | |
18304 | ||
17795822 TS |
18305 | } // anon namespace |
18306 | ||
27a4cd48 DM |
18307 | gimple_opt_pass * |
18308 | make_pass_diagnose_omp_blocks (gcc::context *ctxt) | |
18309 | { | |
18310 | return new pass_diagnose_omp_blocks (ctxt); | |
18311 | } | |
0136f8f0 AH |
18312 | \f |
18313 | /* SIMD clone supporting code. */ | |
18314 | ||
18315 | /* Allocate a fresh `simd_clone' and return it. NARGS is the number | |
18316 | of arguments to reserve space for. */ | |
18317 | ||
18318 | static struct cgraph_simd_clone * | |
18319 | simd_clone_struct_alloc (int nargs) | |
18320 | { | |
18321 | struct cgraph_simd_clone *clone_info; | |
18322 | size_t len = (sizeof (struct cgraph_simd_clone) | |
18323 | + nargs * sizeof (struct cgraph_simd_clone_arg)); | |
18324 | clone_info = (struct cgraph_simd_clone *) | |
b3bb0eb9 | 18325 | ggc_internal_cleared_alloc (len); |
0136f8f0 AH |
18326 | return clone_info; |
18327 | } | |
18328 | ||
18329 | /* Make a copy of the `struct cgraph_simd_clone' in FROM to TO. */ | |
18330 | ||
18331 | static inline void | |
18332 | simd_clone_struct_copy (struct cgraph_simd_clone *to, | |
18333 | struct cgraph_simd_clone *from) | |
18334 | { | |
18335 | memcpy (to, from, (sizeof (struct cgraph_simd_clone) | |
92d05580 JJ |
18336 | + ((from->nargs - from->inbranch) |
18337 | * sizeof (struct cgraph_simd_clone_arg)))); | |
0136f8f0 AH |
18338 | } |
18339 | ||
18340 | /* Return vector of parameter types of function FNDECL. This uses | |
18341 | TYPE_ARG_TYPES if available, otherwise falls back to types of | |
18342 | DECL_ARGUMENTS types. */ | |
18343 | ||
18344 | vec<tree> | |
18345 | simd_clone_vector_of_formal_parm_types (tree fndecl) | |
18346 | { | |
18347 | if (TYPE_ARG_TYPES (TREE_TYPE (fndecl))) | |
18348 | return ipa_get_vector_of_formal_parm_types (TREE_TYPE (fndecl)); | |
18349 | vec<tree> args = ipa_get_vector_of_formal_parms (fndecl); | |
18350 | unsigned int i; | |
18351 | tree arg; | |
18352 | FOR_EACH_VEC_ELT (args, i, arg) | |
18353 | args[i] = TREE_TYPE (args[i]); | |
18354 | return args; | |
18355 | } | |
18356 | ||
18357 | /* Given a simd function in NODE, extract the simd specific | |
18358 | information from the OMP clauses passed in CLAUSES, and return | |
18359 | the struct cgraph_simd_clone * if it should be cloned. *INBRANCH_SPECIFIED | |
18360 | is set to TRUE if the `inbranch' or `notinbranch' clause specified, | |
18361 | otherwise set to FALSE. */ | |
18362 | ||
18363 | static struct cgraph_simd_clone * | |
18364 | simd_clone_clauses_extract (struct cgraph_node *node, tree clauses, | |
18365 | bool *inbranch_specified) | |
18366 | { | |
18367 | vec<tree> args = simd_clone_vector_of_formal_parm_types (node->decl); | |
18368 | tree t; | |
18369 | int n; | |
18370 | *inbranch_specified = false; | |
18371 | ||
18372 | n = args.length (); | |
18373 | if (n > 0 && args.last () == void_type_node) | |
18374 | n--; | |
18375 | ||
18376 | /* To distinguish from an OpenMP simd clone, Cilk Plus functions to | |
18377 | be cloned have a distinctive artificial label in addition to "omp | |
18378 | declare simd". */ | |
18379 | bool cilk_clone | |
b72271b9 | 18380 | = (flag_cilkplus |
41958c28 | 18381 | && lookup_attribute ("cilk simd function", |
0136f8f0 AH |
18382 | DECL_ATTRIBUTES (node->decl))); |
18383 | ||
18384 | /* Allocate one more than needed just in case this is an in-branch | |
18385 | clone which will require a mask argument. */ | |
18386 | struct cgraph_simd_clone *clone_info = simd_clone_struct_alloc (n + 1); | |
18387 | clone_info->nargs = n; | |
18388 | clone_info->cilk_elemental = cilk_clone; | |
18389 | ||
18390 | if (!clauses) | |
18391 | { | |
18392 | args.release (); | |
18393 | return clone_info; | |
18394 | } | |
18395 | clauses = TREE_VALUE (clauses); | |
18396 | if (!clauses || TREE_CODE (clauses) != OMP_CLAUSE) | |
18397 | return clone_info; | |
18398 | ||
18399 | for (t = clauses; t; t = OMP_CLAUSE_CHAIN (t)) | |
18400 | { | |
18401 | switch (OMP_CLAUSE_CODE (t)) | |
18402 | { | |
18403 | case OMP_CLAUSE_INBRANCH: | |
18404 | clone_info->inbranch = 1; | |
18405 | *inbranch_specified = true; | |
18406 | break; | |
18407 | case OMP_CLAUSE_NOTINBRANCH: | |
18408 | clone_info->inbranch = 0; | |
18409 | *inbranch_specified = true; | |
18410 | break; | |
18411 | case OMP_CLAUSE_SIMDLEN: | |
18412 | clone_info->simdlen | |
18413 | = TREE_INT_CST_LOW (OMP_CLAUSE_SIMDLEN_EXPR (t)); | |
18414 | break; | |
18415 | case OMP_CLAUSE_LINEAR: | |
18416 | { | |
18417 | tree decl = OMP_CLAUSE_DECL (t); | |
18418 | tree step = OMP_CLAUSE_LINEAR_STEP (t); | |
18419 | int argno = TREE_INT_CST_LOW (decl); | |
18420 | if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (t)) | |
18421 | { | |
e01d41e5 JJ |
18422 | enum cgraph_simd_clone_arg_type arg_type; |
18423 | if (TREE_CODE (args[argno]) == REFERENCE_TYPE) | |
18424 | switch (OMP_CLAUSE_LINEAR_KIND (t)) | |
18425 | { | |
18426 | case OMP_CLAUSE_LINEAR_REF: | |
18427 | arg_type | |
18428 | = SIMD_CLONE_ARG_TYPE_LINEAR_REF_VARIABLE_STEP; | |
18429 | break; | |
18430 | case OMP_CLAUSE_LINEAR_UVAL: | |
18431 | arg_type | |
18432 | = SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_VARIABLE_STEP; | |
18433 | break; | |
18434 | case OMP_CLAUSE_LINEAR_VAL: | |
18435 | case OMP_CLAUSE_LINEAR_DEFAULT: | |
18436 | arg_type | |
18437 | = SIMD_CLONE_ARG_TYPE_LINEAR_VAL_VARIABLE_STEP; | |
18438 | break; | |
18439 | default: | |
18440 | gcc_unreachable (); | |
18441 | } | |
18442 | else | |
18443 | arg_type = SIMD_CLONE_ARG_TYPE_LINEAR_VARIABLE_STEP; | |
18444 | clone_info->args[argno].arg_type = arg_type; | |
0136f8f0 AH |
18445 | clone_info->args[argno].linear_step = tree_to_shwi (step); |
18446 | gcc_assert (clone_info->args[argno].linear_step >= 0 | |
18447 | && clone_info->args[argno].linear_step < n); | |
18448 | } | |
18449 | else | |
18450 | { | |
18451 | if (POINTER_TYPE_P (args[argno])) | |
18452 | step = fold_convert (ssizetype, step); | |
18453 | if (!tree_fits_shwi_p (step)) | |
18454 | { | |
18455 | warning_at (OMP_CLAUSE_LOCATION (t), 0, | |
18456 | "ignoring large linear step"); | |
18457 | args.release (); | |
18458 | return NULL; | |
18459 | } | |
18460 | else if (integer_zerop (step)) | |
18461 | { | |
18462 | warning_at (OMP_CLAUSE_LOCATION (t), 0, | |
18463 | "ignoring zero linear step"); | |
18464 | args.release (); | |
18465 | return NULL; | |
18466 | } | |
18467 | else | |
18468 | { | |
d9a6bd32 JJ |
18469 | enum cgraph_simd_clone_arg_type arg_type; |
18470 | if (TREE_CODE (args[argno]) == REFERENCE_TYPE) | |
18471 | switch (OMP_CLAUSE_LINEAR_KIND (t)) | |
18472 | { | |
18473 | case OMP_CLAUSE_LINEAR_REF: | |
18474 | arg_type | |
18475 | = SIMD_CLONE_ARG_TYPE_LINEAR_REF_CONSTANT_STEP; | |
18476 | break; | |
18477 | case OMP_CLAUSE_LINEAR_UVAL: | |
18478 | arg_type | |
18479 | = SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_CONSTANT_STEP; | |
18480 | break; | |
18481 | case OMP_CLAUSE_LINEAR_VAL: | |
18482 | case OMP_CLAUSE_LINEAR_DEFAULT: | |
18483 | arg_type | |
18484 | = SIMD_CLONE_ARG_TYPE_LINEAR_VAL_CONSTANT_STEP; | |
18485 | break; | |
18486 | default: | |
18487 | gcc_unreachable (); | |
18488 | } | |
18489 | else | |
18490 | arg_type = SIMD_CLONE_ARG_TYPE_LINEAR_CONSTANT_STEP; | |
18491 | clone_info->args[argno].arg_type = arg_type; | |
0136f8f0 AH |
18492 | clone_info->args[argno].linear_step = tree_to_shwi (step); |
18493 | } | |
18494 | } | |
18495 | break; | |
18496 | } | |
18497 | case OMP_CLAUSE_UNIFORM: | |
18498 | { | |
18499 | tree decl = OMP_CLAUSE_DECL (t); | |
18500 | int argno = tree_to_uhwi (decl); | |
18501 | clone_info->args[argno].arg_type | |
18502 | = SIMD_CLONE_ARG_TYPE_UNIFORM; | |
18503 | break; | |
18504 | } | |
18505 | case OMP_CLAUSE_ALIGNED: | |
18506 | { | |
18507 | tree decl = OMP_CLAUSE_DECL (t); | |
18508 | int argno = tree_to_uhwi (decl); | |
18509 | clone_info->args[argno].alignment | |
18510 | = TREE_INT_CST_LOW (OMP_CLAUSE_ALIGNED_ALIGNMENT (t)); | |
18511 | break; | |
18512 | } | |
18513 | default: | |
18514 | break; | |
18515 | } | |
18516 | } | |
18517 | args.release (); | |
18518 | return clone_info; | |
18519 | } | |
18520 | ||
18521 | /* Given a SIMD clone in NODE, calculate the characteristic data | |
18522 | type and return the coresponding type. The characteristic data | |
18523 | type is computed as described in the Intel Vector ABI. */ | |
18524 | ||
18525 | static tree | |
18526 | simd_clone_compute_base_data_type (struct cgraph_node *node, | |
18527 | struct cgraph_simd_clone *clone_info) | |
18528 | { | |
18529 | tree type = integer_type_node; | |
18530 | tree fndecl = node->decl; | |
18531 | ||
18532 | /* a) For non-void function, the characteristic data type is the | |
18533 | return type. */ | |
18534 | if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE) | |
18535 | type = TREE_TYPE (TREE_TYPE (fndecl)); | |
18536 | ||
18537 | /* b) If the function has any non-uniform, non-linear parameters, | |
18538 | then the characteristic data type is the type of the first | |
18539 | such parameter. */ | |
18540 | else | |
18541 | { | |
18542 | vec<tree> map = simd_clone_vector_of_formal_parm_types (fndecl); | |
18543 | for (unsigned int i = 0; i < clone_info->nargs; ++i) | |
18544 | if (clone_info->args[i].arg_type == SIMD_CLONE_ARG_TYPE_VECTOR) | |
18545 | { | |
18546 | type = map[i]; | |
18547 | break; | |
18548 | } | |
18549 | map.release (); | |
18550 | } | |
18551 | ||
18552 | /* c) If the characteristic data type determined by a) or b) above | |
18553 | is struct, union, or class type which is pass-by-value (except | |
18554 | for the type that maps to the built-in complex data type), the | |
18555 | characteristic data type is int. */ | |
18556 | if (RECORD_OR_UNION_TYPE_P (type) | |
18557 | && !aggregate_value_p (type, NULL) | |
18558 | && TREE_CODE (type) != COMPLEX_TYPE) | |
18559 | return integer_type_node; | |
18560 | ||
18561 | /* d) If none of the above three classes is applicable, the | |
18562 | characteristic data type is int. */ | |
18563 | ||
18564 | return type; | |
18565 | ||
18566 | /* e) For Intel Xeon Phi native and offload compilation, if the | |
18567 | resulting characteristic data type is 8-bit or 16-bit integer | |
18568 | data type, the characteristic data type is int. */ | |
18569 | /* Well, we don't handle Xeon Phi yet. */ | |
18570 | } | |
18571 | ||
18572 | static tree | |
18573 | simd_clone_mangle (struct cgraph_node *node, | |
18574 | struct cgraph_simd_clone *clone_info) | |
18575 | { | |
18576 | char vecsize_mangle = clone_info->vecsize_mangle; | |
18577 | char mask = clone_info->inbranch ? 'M' : 'N'; | |
18578 | unsigned int simdlen = clone_info->simdlen; | |
18579 | unsigned int n; | |
18580 | pretty_printer pp; | |
18581 | ||
18582 | gcc_assert (vecsize_mangle && simdlen); | |
18583 | ||
18584 | pp_string (&pp, "_ZGV"); | |
18585 | pp_character (&pp, vecsize_mangle); | |
18586 | pp_character (&pp, mask); | |
18587 | pp_decimal_int (&pp, simdlen); | |
18588 | ||
18589 | for (n = 0; n < clone_info->nargs; ++n) | |
18590 | { | |
18591 | struct cgraph_simd_clone_arg arg = clone_info->args[n]; | |
18592 | ||
d9a6bd32 | 18593 | switch (arg.arg_type) |
0136f8f0 | 18594 | { |
d9a6bd32 JJ |
18595 | case SIMD_CLONE_ARG_TYPE_UNIFORM: |
18596 | pp_character (&pp, 'u'); | |
18597 | break; | |
18598 | case SIMD_CLONE_ARG_TYPE_LINEAR_CONSTANT_STEP: | |
0136f8f0 | 18599 | pp_character (&pp, 'l'); |
d9a6bd32 JJ |
18600 | goto mangle_linear; |
18601 | case SIMD_CLONE_ARG_TYPE_LINEAR_REF_CONSTANT_STEP: | |
18602 | pp_character (&pp, 'R'); | |
18603 | goto mangle_linear; | |
18604 | case SIMD_CLONE_ARG_TYPE_LINEAR_VAL_CONSTANT_STEP: | |
18605 | pp_character (&pp, 'L'); | |
18606 | goto mangle_linear; | |
18607 | case SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_CONSTANT_STEP: | |
18608 | pp_character (&pp, 'U'); | |
18609 | goto mangle_linear; | |
18610 | mangle_linear: | |
18611 | gcc_assert (arg.linear_step != 0); | |
0136f8f0 AH |
18612 | if (arg.linear_step > 1) |
18613 | pp_unsigned_wide_integer (&pp, arg.linear_step); | |
18614 | else if (arg.linear_step < 0) | |
18615 | { | |
18616 | pp_character (&pp, 'n'); | |
18617 | pp_unsigned_wide_integer (&pp, (-(unsigned HOST_WIDE_INT) | |
18618 | arg.linear_step)); | |
18619 | } | |
d9a6bd32 JJ |
18620 | break; |
18621 | case SIMD_CLONE_ARG_TYPE_LINEAR_VARIABLE_STEP: | |
e01d41e5 JJ |
18622 | pp_string (&pp, "ls"); |
18623 | pp_unsigned_wide_integer (&pp, arg.linear_step); | |
18624 | break; | |
18625 | case SIMD_CLONE_ARG_TYPE_LINEAR_REF_VARIABLE_STEP: | |
18626 | pp_string (&pp, "Rs"); | |
18627 | pp_unsigned_wide_integer (&pp, arg.linear_step); | |
18628 | break; | |
18629 | case SIMD_CLONE_ARG_TYPE_LINEAR_VAL_VARIABLE_STEP: | |
18630 | pp_string (&pp, "Ls"); | |
18631 | pp_unsigned_wide_integer (&pp, arg.linear_step); | |
18632 | break; | |
18633 | case SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_VARIABLE_STEP: | |
18634 | pp_string (&pp, "Us"); | |
0136f8f0 | 18635 | pp_unsigned_wide_integer (&pp, arg.linear_step); |
d9a6bd32 JJ |
18636 | break; |
18637 | default: | |
18638 | pp_character (&pp, 'v'); | |
0136f8f0 | 18639 | } |
0136f8f0 AH |
18640 | if (arg.alignment) |
18641 | { | |
18642 | pp_character (&pp, 'a'); | |
18643 | pp_decimal_int (&pp, arg.alignment); | |
18644 | } | |
18645 | } | |
18646 | ||
18647 | pp_underscore (&pp); | |
4cd76837 JJ |
18648 | const char *str = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->decl)); |
18649 | if (*str == '*') | |
18650 | ++str; | |
18651 | pp_string (&pp, str); | |
18652 | str = pp_formatted_text (&pp); | |
0136f8f0 AH |
18653 | |
18654 | /* If there already is a SIMD clone with the same mangled name, don't | |
18655 | add another one. This can happen e.g. for | |
18656 | #pragma omp declare simd | |
18657 | #pragma omp declare simd simdlen(8) | |
18658 | int foo (int, int); | |
18659 | if the simdlen is assumed to be 8 for the first one, etc. */ | |
18660 | for (struct cgraph_node *clone = node->simd_clones; clone; | |
18661 | clone = clone->simdclone->next_clone) | |
18662 | if (strcmp (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (clone->decl)), | |
18663 | str) == 0) | |
18664 | return NULL_TREE; | |
18665 | ||
18666 | return get_identifier (str); | |
18667 | } | |
18668 | ||
18669 | /* Create a simd clone of OLD_NODE and return it. */ | |
18670 | ||
18671 | static struct cgraph_node * | |
18672 | simd_clone_create (struct cgraph_node *old_node) | |
18673 | { | |
18674 | struct cgraph_node *new_node; | |
18675 | if (old_node->definition) | |
e06f9964 | 18676 | { |
d52f5295 | 18677 | if (!old_node->has_gimple_body_p ()) |
e06f9964 | 18678 | return NULL; |
d52f5295 ML |
18679 | old_node->get_body (); |
18680 | new_node = old_node->create_version_clone_with_body (vNULL, NULL, NULL, | |
18681 | false, NULL, NULL, | |
18682 | "simdclone"); | |
e06f9964 | 18683 | } |
0136f8f0 AH |
18684 | else |
18685 | { | |
18686 | tree old_decl = old_node->decl; | |
18687 | tree new_decl = copy_node (old_node->decl); | |
18688 | DECL_NAME (new_decl) = clone_function_name (old_decl, "simdclone"); | |
18689 | SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl)); | |
18690 | SET_DECL_RTL (new_decl, NULL); | |
18691 | DECL_STATIC_CONSTRUCTOR (new_decl) = 0; | |
18692 | DECL_STATIC_DESTRUCTOR (new_decl) = 0; | |
d52f5295 | 18693 | new_node = old_node->create_version_clone (new_decl, vNULL, NULL); |
6f9045f4 IE |
18694 | if (old_node->in_other_partition) |
18695 | new_node->in_other_partition = 1; | |
3dafb85c | 18696 | symtab->call_cgraph_insertion_hooks (new_node); |
0136f8f0 AH |
18697 | } |
18698 | if (new_node == NULL) | |
18699 | return new_node; | |
18700 | ||
18701 | TREE_PUBLIC (new_node->decl) = TREE_PUBLIC (old_node->decl); | |
18702 | ||
18703 | /* The function cgraph_function_versioning () will force the new | |
18704 | symbol local. Undo this, and inherit external visability from | |
18705 | the old node. */ | |
18706 | new_node->local.local = old_node->local.local; | |
18707 | new_node->externally_visible = old_node->externally_visible; | |
18708 | ||
18709 | return new_node; | |
18710 | } | |
18711 | ||
18712 | /* Adjust the return type of the given function to its appropriate | |
18713 | vector counterpart. Returns a simd array to be used throughout the | |
18714 | function as a return value. */ | |
18715 | ||
18716 | static tree | |
18717 | simd_clone_adjust_return_type (struct cgraph_node *node) | |
18718 | { | |
18719 | tree fndecl = node->decl; | |
18720 | tree orig_rettype = TREE_TYPE (TREE_TYPE (fndecl)); | |
18721 | unsigned int veclen; | |
18722 | tree t; | |
18723 | ||
18724 | /* Adjust the function return type. */ | |
18725 | if (orig_rettype == void_type_node) | |
18726 | return NULL_TREE; | |
18727 | TREE_TYPE (fndecl) = build_distinct_type_copy (TREE_TYPE (fndecl)); | |
1c4967b9 JJ |
18728 | t = TREE_TYPE (TREE_TYPE (fndecl)); |
18729 | if (INTEGRAL_TYPE_P (t) || POINTER_TYPE_P (t)) | |
0136f8f0 AH |
18730 | veclen = node->simdclone->vecsize_int; |
18731 | else | |
18732 | veclen = node->simdclone->vecsize_float; | |
1c4967b9 | 18733 | veclen /= GET_MODE_BITSIZE (TYPE_MODE (t)); |
0136f8f0 AH |
18734 | if (veclen > node->simdclone->simdlen) |
18735 | veclen = node->simdclone->simdlen; | |
1c4967b9 JJ |
18736 | if (POINTER_TYPE_P (t)) |
18737 | t = pointer_sized_int_node; | |
0136f8f0 | 18738 | if (veclen == node->simdclone->simdlen) |
1c4967b9 | 18739 | t = build_vector_type (t, node->simdclone->simdlen); |
0136f8f0 AH |
18740 | else |
18741 | { | |
1c4967b9 | 18742 | t = build_vector_type (t, veclen); |
0136f8f0 | 18743 | t = build_array_type_nelts (t, node->simdclone->simdlen / veclen); |
0136f8f0 | 18744 | } |
1c4967b9 | 18745 | TREE_TYPE (TREE_TYPE (fndecl)) = t; |
0136f8f0 AH |
18746 | if (!node->definition) |
18747 | return NULL_TREE; | |
18748 | ||
18749 | t = DECL_RESULT (fndecl); | |
18750 | /* Adjust the DECL_RESULT. */ | |
18751 | gcc_assert (TREE_TYPE (t) != void_type_node); | |
18752 | TREE_TYPE (t) = TREE_TYPE (TREE_TYPE (fndecl)); | |
18753 | relayout_decl (t); | |
18754 | ||
18755 | tree atype = build_array_type_nelts (orig_rettype, | |
18756 | node->simdclone->simdlen); | |
18757 | if (veclen != node->simdclone->simdlen) | |
18758 | return build1 (VIEW_CONVERT_EXPR, atype, t); | |
18759 | ||
18760 | /* Set up a SIMD array to use as the return value. */ | |
18761 | tree retval = create_tmp_var_raw (atype, "retval"); | |
18762 | gimple_add_tmp_var (retval); | |
18763 | return retval; | |
18764 | } | |
18765 | ||
18766 | /* Each vector argument has a corresponding array to be used locally | |
18767 | as part of the eventual loop. Create such temporary array and | |
18768 | return it. | |
18769 | ||
18770 | PREFIX is the prefix to be used for the temporary. | |
18771 | ||
18772 | TYPE is the inner element type. | |
18773 | ||
18774 | SIMDLEN is the number of elements. */ | |
18775 | ||
18776 | static tree | |
18777 | create_tmp_simd_array (const char *prefix, tree type, int simdlen) | |
18778 | { | |
18779 | tree atype = build_array_type_nelts (type, simdlen); | |
18780 | tree avar = create_tmp_var_raw (atype, prefix); | |
18781 | gimple_add_tmp_var (avar); | |
18782 | return avar; | |
18783 | } | |
18784 | ||
18785 | /* Modify the function argument types to their corresponding vector | |
18786 | counterparts if appropriate. Also, create one array for each simd | |
18787 | argument to be used locally when using the function arguments as | |
18788 | part of the loop. | |
18789 | ||
18790 | NODE is the function whose arguments are to be adjusted. | |
18791 | ||
18792 | Returns an adjustment vector that will be filled describing how the | |
18793 | argument types will be adjusted. */ | |
18794 | ||
18795 | static ipa_parm_adjustment_vec | |
18796 | simd_clone_adjust_argument_types (struct cgraph_node *node) | |
18797 | { | |
18798 | vec<tree> args; | |
18799 | ipa_parm_adjustment_vec adjustments; | |
18800 | ||
18801 | if (node->definition) | |
18802 | args = ipa_get_vector_of_formal_parms (node->decl); | |
18803 | else | |
18804 | args = simd_clone_vector_of_formal_parm_types (node->decl); | |
18805 | adjustments.create (args.length ()); | |
18806 | unsigned i, j, veclen; | |
18807 | struct ipa_parm_adjustment adj; | |
18808 | for (i = 0; i < node->simdclone->nargs; ++i) | |
18809 | { | |
18810 | memset (&adj, 0, sizeof (adj)); | |
18811 | tree parm = args[i]; | |
18812 | tree parm_type = node->definition ? TREE_TYPE (parm) : parm; | |
18813 | adj.base_index = i; | |
18814 | adj.base = parm; | |
18815 | ||
18816 | node->simdclone->args[i].orig_arg = node->definition ? parm : NULL_TREE; | |
18817 | node->simdclone->args[i].orig_type = parm_type; | |
18818 | ||
d9a6bd32 | 18819 | switch (node->simdclone->args[i].arg_type) |
0136f8f0 | 18820 | { |
d9a6bd32 | 18821 | default: |
0136f8f0 AH |
18822 | /* No adjustment necessary for scalar arguments. */ |
18823 | adj.op = IPA_PARM_OP_COPY; | |
d9a6bd32 JJ |
18824 | break; |
18825 | case SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_CONSTANT_STEP: | |
e01d41e5 | 18826 | case SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_VARIABLE_STEP: |
d9a6bd32 JJ |
18827 | if (node->definition) |
18828 | node->simdclone->args[i].simd_array | |
18829 | = create_tmp_simd_array (IDENTIFIER_POINTER (DECL_NAME (parm)), | |
18830 | TREE_TYPE (parm_type), | |
18831 | node->simdclone->simdlen); | |
18832 | adj.op = IPA_PARM_OP_COPY; | |
18833 | break; | |
18834 | case SIMD_CLONE_ARG_TYPE_LINEAR_VAL_CONSTANT_STEP: | |
e01d41e5 | 18835 | case SIMD_CLONE_ARG_TYPE_LINEAR_VAL_VARIABLE_STEP: |
d9a6bd32 | 18836 | case SIMD_CLONE_ARG_TYPE_VECTOR: |
0136f8f0 AH |
18837 | if (INTEGRAL_TYPE_P (parm_type) || POINTER_TYPE_P (parm_type)) |
18838 | veclen = node->simdclone->vecsize_int; | |
18839 | else | |
18840 | veclen = node->simdclone->vecsize_float; | |
18841 | veclen /= GET_MODE_BITSIZE (TYPE_MODE (parm_type)); | |
18842 | if (veclen > node->simdclone->simdlen) | |
18843 | veclen = node->simdclone->simdlen; | |
18844 | adj.arg_prefix = "simd"; | |
1c4967b9 JJ |
18845 | if (POINTER_TYPE_P (parm_type)) |
18846 | adj.type = build_vector_type (pointer_sized_int_node, veclen); | |
18847 | else | |
18848 | adj.type = build_vector_type (parm_type, veclen); | |
0136f8f0 AH |
18849 | node->simdclone->args[i].vector_type = adj.type; |
18850 | for (j = veclen; j < node->simdclone->simdlen; j += veclen) | |
18851 | { | |
18852 | adjustments.safe_push (adj); | |
18853 | if (j == veclen) | |
18854 | { | |
18855 | memset (&adj, 0, sizeof (adj)); | |
18856 | adj.op = IPA_PARM_OP_NEW; | |
18857 | adj.arg_prefix = "simd"; | |
18858 | adj.base_index = i; | |
18859 | adj.type = node->simdclone->args[i].vector_type; | |
18860 | } | |
18861 | } | |
18862 | ||
18863 | if (node->definition) | |
18864 | node->simdclone->args[i].simd_array | |
18865 | = create_tmp_simd_array (IDENTIFIER_POINTER (DECL_NAME (parm)), | |
18866 | parm_type, node->simdclone->simdlen); | |
18867 | } | |
18868 | adjustments.safe_push (adj); | |
18869 | } | |
18870 | ||
18871 | if (node->simdclone->inbranch) | |
18872 | { | |
18873 | tree base_type | |
18874 | = simd_clone_compute_base_data_type (node->simdclone->origin, | |
18875 | node->simdclone); | |
18876 | ||
18877 | memset (&adj, 0, sizeof (adj)); | |
18878 | adj.op = IPA_PARM_OP_NEW; | |
18879 | adj.arg_prefix = "mask"; | |
18880 | ||
18881 | adj.base_index = i; | |
18882 | if (INTEGRAL_TYPE_P (base_type) || POINTER_TYPE_P (base_type)) | |
18883 | veclen = node->simdclone->vecsize_int; | |
18884 | else | |
18885 | veclen = node->simdclone->vecsize_float; | |
18886 | veclen /= GET_MODE_BITSIZE (TYPE_MODE (base_type)); | |
18887 | if (veclen > node->simdclone->simdlen) | |
18888 | veclen = node->simdclone->simdlen; | |
1c4967b9 JJ |
18889 | if (POINTER_TYPE_P (base_type)) |
18890 | adj.type = build_vector_type (pointer_sized_int_node, veclen); | |
18891 | else | |
18892 | adj.type = build_vector_type (base_type, veclen); | |
0136f8f0 AH |
18893 | adjustments.safe_push (adj); |
18894 | ||
18895 | for (j = veclen; j < node->simdclone->simdlen; j += veclen) | |
18896 | adjustments.safe_push (adj); | |
18897 | ||
18898 | /* We have previously allocated one extra entry for the mask. Use | |
18899 | it and fill it. */ | |
18900 | struct cgraph_simd_clone *sc = node->simdclone; | |
18901 | sc->nargs++; | |
18902 | if (node->definition) | |
18903 | { | |
18904 | sc->args[i].orig_arg | |
18905 | = build_decl (UNKNOWN_LOCATION, PARM_DECL, NULL, base_type); | |
18906 | sc->args[i].simd_array | |
18907 | = create_tmp_simd_array ("mask", base_type, sc->simdlen); | |
18908 | } | |
18909 | sc->args[i].orig_type = base_type; | |
18910 | sc->args[i].arg_type = SIMD_CLONE_ARG_TYPE_MASK; | |
18911 | } | |
18912 | ||
18913 | if (node->definition) | |
18914 | ipa_modify_formal_parameters (node->decl, adjustments); | |
18915 | else | |
18916 | { | |
18917 | tree new_arg_types = NULL_TREE, new_reversed; | |
18918 | bool last_parm_void = false; | |
18919 | if (args.length () > 0 && args.last () == void_type_node) | |
18920 | last_parm_void = true; | |
18921 | ||
18922 | gcc_assert (TYPE_ARG_TYPES (TREE_TYPE (node->decl))); | |
18923 | j = adjustments.length (); | |
18924 | for (i = 0; i < j; i++) | |
18925 | { | |
18926 | struct ipa_parm_adjustment *adj = &adjustments[i]; | |
18927 | tree ptype; | |
18928 | if (adj->op == IPA_PARM_OP_COPY) | |
18929 | ptype = args[adj->base_index]; | |
18930 | else | |
18931 | ptype = adj->type; | |
18932 | new_arg_types = tree_cons (NULL_TREE, ptype, new_arg_types); | |
18933 | } | |
18934 | new_reversed = nreverse (new_arg_types); | |
18935 | if (last_parm_void) | |
18936 | { | |
18937 | if (new_reversed) | |
18938 | TREE_CHAIN (new_arg_types) = void_list_node; | |
18939 | else | |
18940 | new_reversed = void_list_node; | |
18941 | } | |
18942 | ||
18943 | tree new_type = build_distinct_type_copy (TREE_TYPE (node->decl)); | |
18944 | TYPE_ARG_TYPES (new_type) = new_reversed; | |
18945 | TREE_TYPE (node->decl) = new_type; | |
18946 | ||
18947 | adjustments.release (); | |
18948 | } | |
18949 | args.release (); | |
18950 | return adjustments; | |
18951 | } | |
18952 | ||
18953 | /* Initialize and copy the function arguments in NODE to their | |
18954 | corresponding local simd arrays. Returns a fresh gimple_seq with | |
18955 | the instruction sequence generated. */ | |
18956 | ||
18957 | static gimple_seq | |
18958 | simd_clone_init_simd_arrays (struct cgraph_node *node, | |
18959 | ipa_parm_adjustment_vec adjustments) | |
18960 | { | |
18961 | gimple_seq seq = NULL; | |
18962 | unsigned i = 0, j = 0, k; | |
18963 | ||
18964 | for (tree arg = DECL_ARGUMENTS (node->decl); | |
18965 | arg; | |
18966 | arg = DECL_CHAIN (arg), i++, j++) | |
18967 | { | |
d9a6bd32 JJ |
18968 | if (adjustments[j].op == IPA_PARM_OP_COPY |
18969 | || POINTER_TYPE_P (TREE_TYPE (arg))) | |
0136f8f0 AH |
18970 | continue; |
18971 | ||
18972 | node->simdclone->args[i].vector_arg = arg; | |
18973 | ||
18974 | tree array = node->simdclone->args[i].simd_array; | |
18975 | if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg)) == node->simdclone->simdlen) | |
18976 | { | |
18977 | tree ptype = build_pointer_type (TREE_TYPE (TREE_TYPE (array))); | |
18978 | tree ptr = build_fold_addr_expr (array); | |
18979 | tree t = build2 (MEM_REF, TREE_TYPE (arg), ptr, | |
18980 | build_int_cst (ptype, 0)); | |
18981 | t = build2 (MODIFY_EXPR, TREE_TYPE (t), t, arg); | |
18982 | gimplify_and_add (t, &seq); | |
18983 | } | |
18984 | else | |
18985 | { | |
18986 | unsigned int simdlen = TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg)); | |
18987 | tree ptype = build_pointer_type (TREE_TYPE (TREE_TYPE (array))); | |
18988 | for (k = 0; k < node->simdclone->simdlen; k += simdlen) | |
18989 | { | |
18990 | tree ptr = build_fold_addr_expr (array); | |
18991 | int elemsize; | |
18992 | if (k) | |
18993 | { | |
18994 | arg = DECL_CHAIN (arg); | |
18995 | j++; | |
18996 | } | |
18997 | elemsize | |
18998 | = GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg)))); | |
18999 | tree t = build2 (MEM_REF, TREE_TYPE (arg), ptr, | |
19000 | build_int_cst (ptype, k * elemsize)); | |
19001 | t = build2 (MODIFY_EXPR, TREE_TYPE (t), t, arg); | |
19002 | gimplify_and_add (t, &seq); | |
19003 | } | |
19004 | } | |
19005 | } | |
19006 | return seq; | |
19007 | } | |
19008 | ||
19009 | /* Callback info for ipa_simd_modify_stmt_ops below. */ | |
19010 | ||
19011 | struct modify_stmt_info { | |
19012 | ipa_parm_adjustment_vec adjustments; | |
355fe088 | 19013 | gimple *stmt; |
0136f8f0 AH |
19014 | /* True if the parent statement was modified by |
19015 | ipa_simd_modify_stmt_ops. */ | |
19016 | bool modified; | |
19017 | }; | |
19018 | ||
19019 | /* Callback for walk_gimple_op. | |
19020 | ||
19021 | Adjust operands from a given statement as specified in the | |
19022 | adjustments vector in the callback data. */ | |
19023 | ||
19024 | static tree | |
19025 | ipa_simd_modify_stmt_ops (tree *tp, int *walk_subtrees, void *data) | |
19026 | { | |
19027 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data; | |
2044a4c3 JJ |
19028 | struct modify_stmt_info *info = (struct modify_stmt_info *) wi->info; |
19029 | tree *orig_tp = tp; | |
19030 | if (TREE_CODE (*tp) == ADDR_EXPR) | |
19031 | tp = &TREE_OPERAND (*tp, 0); | |
19032 | struct ipa_parm_adjustment *cand = NULL; | |
19033 | if (TREE_CODE (*tp) == PARM_DECL) | |
19034 | cand = ipa_get_adjustment_candidate (&tp, NULL, info->adjustments, true); | |
19035 | else | |
0136f8f0 | 19036 | { |
0136f8f0 AH |
19037 | if (TYPE_P (*tp)) |
19038 | *walk_subtrees = 0; | |
0136f8f0 | 19039 | } |
0136f8f0 | 19040 | |
2044a4c3 JJ |
19041 | tree repl = NULL_TREE; |
19042 | if (cand) | |
19043 | repl = unshare_expr (cand->new_decl); | |
19044 | else | |
0136f8f0 | 19045 | { |
2044a4c3 JJ |
19046 | if (tp != orig_tp) |
19047 | { | |
19048 | *walk_subtrees = 0; | |
19049 | bool modified = info->modified; | |
19050 | info->modified = false; | |
19051 | walk_tree (tp, ipa_simd_modify_stmt_ops, wi, wi->pset); | |
19052 | if (!info->modified) | |
19053 | { | |
19054 | info->modified = modified; | |
19055 | return NULL_TREE; | |
19056 | } | |
19057 | info->modified = modified; | |
19058 | repl = *tp; | |
19059 | } | |
19060 | else | |
19061 | return NULL_TREE; | |
0136f8f0 | 19062 | } |
2044a4c3 JJ |
19063 | |
19064 | if (tp != orig_tp) | |
0136f8f0 | 19065 | { |
2044a4c3 | 19066 | repl = build_fold_addr_expr (repl); |
355fe088 | 19067 | gimple *stmt; |
932b6d61 JJ |
19068 | if (is_gimple_debug (info->stmt)) |
19069 | { | |
19070 | tree vexpr = make_node (DEBUG_EXPR_DECL); | |
19071 | stmt = gimple_build_debug_source_bind (vexpr, repl, NULL); | |
19072 | DECL_ARTIFICIAL (vexpr) = 1; | |
19073 | TREE_TYPE (vexpr) = TREE_TYPE (repl); | |
19074 | DECL_MODE (vexpr) = TYPE_MODE (TREE_TYPE (repl)); | |
19075 | repl = vexpr; | |
19076 | } | |
19077 | else | |
19078 | { | |
b731b390 | 19079 | stmt = gimple_build_assign (make_ssa_name (TREE_TYPE (repl)), repl); |
932b6d61 JJ |
19080 | repl = gimple_assign_lhs (stmt); |
19081 | } | |
2044a4c3 | 19082 | gimple_stmt_iterator gsi = gsi_for_stmt (info->stmt); |
0136f8f0 | 19083 | gsi_insert_before (&gsi, stmt, GSI_SAME_STMT); |
2044a4c3 | 19084 | *orig_tp = repl; |
0136f8f0 | 19085 | } |
2044a4c3 | 19086 | else if (!useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (repl))) |
0136f8f0 AH |
19087 | { |
19088 | tree vce = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (*tp), repl); | |
19089 | *tp = vce; | |
19090 | } | |
19091 | else | |
19092 | *tp = repl; | |
19093 | ||
19094 | info->modified = true; | |
0136f8f0 AH |
19095 | return NULL_TREE; |
19096 | } | |
19097 | ||
19098 | /* Traverse the function body and perform all modifications as | |
19099 | described in ADJUSTMENTS. At function return, ADJUSTMENTS will be | |
19100 | modified such that the replacement/reduction value will now be an | |
19101 | offset into the corresponding simd_array. | |
19102 | ||
19103 | This function will replace all function argument uses with their | |
19104 | corresponding simd array elements, and ajust the return values | |
19105 | accordingly. */ | |
19106 | ||
19107 | static void | |
19108 | ipa_simd_modify_function_body (struct cgraph_node *node, | |
19109 | ipa_parm_adjustment_vec adjustments, | |
19110 | tree retval_array, tree iter) | |
19111 | { | |
19112 | basic_block bb; | |
2044a4c3 | 19113 | unsigned int i, j, l; |
0136f8f0 AH |
19114 | |
19115 | /* Re-use the adjustments array, but this time use it to replace | |
19116 | every function argument use to an offset into the corresponding | |
19117 | simd_array. */ | |
19118 | for (i = 0, j = 0; i < node->simdclone->nargs; ++i, ++j) | |
19119 | { | |
19120 | if (!node->simdclone->args[i].vector_arg) | |
19121 | continue; | |
19122 | ||
19123 | tree basetype = TREE_TYPE (node->simdclone->args[i].orig_arg); | |
19124 | tree vectype = TREE_TYPE (node->simdclone->args[i].vector_arg); | |
19125 | adjustments[j].new_decl | |
19126 | = build4 (ARRAY_REF, | |
19127 | basetype, | |
19128 | node->simdclone->args[i].simd_array, | |
19129 | iter, | |
19130 | NULL_TREE, NULL_TREE); | |
19131 | if (adjustments[j].op == IPA_PARM_OP_NONE | |
19132 | && TYPE_VECTOR_SUBPARTS (vectype) < node->simdclone->simdlen) | |
19133 | j += node->simdclone->simdlen / TYPE_VECTOR_SUBPARTS (vectype) - 1; | |
19134 | } | |
19135 | ||
2044a4c3 JJ |
19136 | l = adjustments.length (); |
19137 | for (i = 1; i < num_ssa_names; i++) | |
19138 | { | |
19139 | tree name = ssa_name (i); | |
19140 | if (name | |
19141 | && SSA_NAME_VAR (name) | |
19142 | && TREE_CODE (SSA_NAME_VAR (name)) == PARM_DECL) | |
19143 | { | |
19144 | for (j = 0; j < l; j++) | |
19145 | if (SSA_NAME_VAR (name) == adjustments[j].base | |
19146 | && adjustments[j].new_decl) | |
19147 | { | |
19148 | tree base_var; | |
19149 | if (adjustments[j].new_ssa_base == NULL_TREE) | |
19150 | { | |
19151 | base_var | |
19152 | = copy_var_decl (adjustments[j].base, | |
19153 | DECL_NAME (adjustments[j].base), | |
19154 | TREE_TYPE (adjustments[j].base)); | |
19155 | adjustments[j].new_ssa_base = base_var; | |
19156 | } | |
19157 | else | |
19158 | base_var = adjustments[j].new_ssa_base; | |
19159 | if (SSA_NAME_IS_DEFAULT_DEF (name)) | |
19160 | { | |
19161 | bb = single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
19162 | gimple_stmt_iterator gsi = gsi_after_labels (bb); | |
19163 | tree new_decl = unshare_expr (adjustments[j].new_decl); | |
19164 | set_ssa_default_def (cfun, adjustments[j].base, NULL_TREE); | |
19165 | SET_SSA_NAME_VAR_OR_IDENTIFIER (name, base_var); | |
19166 | SSA_NAME_IS_DEFAULT_DEF (name) = 0; | |
355fe088 | 19167 | gimple *stmt = gimple_build_assign (name, new_decl); |
2044a4c3 JJ |
19168 | gsi_insert_before (&gsi, stmt, GSI_SAME_STMT); |
19169 | } | |
19170 | else | |
19171 | SET_SSA_NAME_VAR_OR_IDENTIFIER (name, base_var); | |
19172 | } | |
19173 | } | |
19174 | } | |
19175 | ||
0136f8f0 AH |
19176 | struct modify_stmt_info info; |
19177 | info.adjustments = adjustments; | |
19178 | ||
19179 | FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (node->decl)) | |
19180 | { | |
19181 | gimple_stmt_iterator gsi; | |
19182 | ||
19183 | gsi = gsi_start_bb (bb); | |
19184 | while (!gsi_end_p (gsi)) | |
19185 | { | |
355fe088 | 19186 | gimple *stmt = gsi_stmt (gsi); |
0136f8f0 AH |
19187 | info.stmt = stmt; |
19188 | struct walk_stmt_info wi; | |
19189 | ||
19190 | memset (&wi, 0, sizeof (wi)); | |
19191 | info.modified = false; | |
19192 | wi.info = &info; | |
19193 | walk_gimple_op (stmt, ipa_simd_modify_stmt_ops, &wi); | |
19194 | ||
538dd0b7 | 19195 | if (greturn *return_stmt = dyn_cast <greturn *> (stmt)) |
0136f8f0 | 19196 | { |
538dd0b7 | 19197 | tree retval = gimple_return_retval (return_stmt); |
0136f8f0 AH |
19198 | if (!retval) |
19199 | { | |
19200 | gsi_remove (&gsi, true); | |
19201 | continue; | |
19202 | } | |
19203 | ||
19204 | /* Replace `return foo' with `retval_array[iter] = foo'. */ | |
19205 | tree ref = build4 (ARRAY_REF, TREE_TYPE (retval), | |
19206 | retval_array, iter, NULL, NULL); | |
19207 | stmt = gimple_build_assign (ref, retval); | |
19208 | gsi_replace (&gsi, stmt, true); | |
19209 | info.modified = true; | |
19210 | } | |
19211 | ||
19212 | if (info.modified) | |
19213 | { | |
19214 | update_stmt (stmt); | |
19215 | if (maybe_clean_eh_stmt (stmt)) | |
19216 | gimple_purge_dead_eh_edges (gimple_bb (stmt)); | |
19217 | } | |
19218 | gsi_next (&gsi); | |
19219 | } | |
19220 | } | |
19221 | } | |
19222 | ||
e01d41e5 JJ |
19223 | /* Helper function of simd_clone_adjust, return linear step addend |
19224 | of Ith argument. */ | |
19225 | ||
19226 | static tree | |
19227 | simd_clone_linear_addend (struct cgraph_node *node, unsigned int i, | |
19228 | tree addtype, basic_block entry_bb) | |
19229 | { | |
19230 | tree ptype = NULL_TREE; | |
19231 | switch (node->simdclone->args[i].arg_type) | |
19232 | { | |
19233 | case SIMD_CLONE_ARG_TYPE_LINEAR_CONSTANT_STEP: | |
19234 | case SIMD_CLONE_ARG_TYPE_LINEAR_REF_CONSTANT_STEP: | |
19235 | case SIMD_CLONE_ARG_TYPE_LINEAR_VAL_CONSTANT_STEP: | |
19236 | case SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_CONSTANT_STEP: | |
19237 | return build_int_cst (addtype, node->simdclone->args[i].linear_step); | |
19238 | case SIMD_CLONE_ARG_TYPE_LINEAR_VARIABLE_STEP: | |
19239 | case SIMD_CLONE_ARG_TYPE_LINEAR_REF_VARIABLE_STEP: | |
19240 | ptype = TREE_TYPE (node->simdclone->args[i].orig_arg); | |
19241 | break; | |
19242 | case SIMD_CLONE_ARG_TYPE_LINEAR_VAL_VARIABLE_STEP: | |
19243 | case SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_VARIABLE_STEP: | |
19244 | ptype = TREE_TYPE (TREE_TYPE (node->simdclone->args[i].orig_arg)); | |
19245 | break; | |
19246 | default: | |
19247 | gcc_unreachable (); | |
19248 | } | |
19249 | ||
19250 | unsigned int idx = node->simdclone->args[i].linear_step; | |
19251 | tree arg = node->simdclone->args[idx].orig_arg; | |
19252 | gcc_assert (is_gimple_reg_type (TREE_TYPE (arg))); | |
19253 | gimple_stmt_iterator gsi = gsi_after_labels (entry_bb); | |
19254 | gimple *g; | |
19255 | tree ret; | |
19256 | if (is_gimple_reg (arg)) | |
19257 | ret = get_or_create_ssa_default_def (cfun, arg); | |
19258 | else | |
19259 | { | |
19260 | g = gimple_build_assign (make_ssa_name (TREE_TYPE (arg)), arg); | |
19261 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
19262 | ret = gimple_assign_lhs (g); | |
19263 | } | |
19264 | if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE) | |
19265 | { | |
19266 | g = gimple_build_assign (make_ssa_name (TREE_TYPE (TREE_TYPE (arg))), | |
19267 | build_simple_mem_ref (ret)); | |
19268 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
19269 | ret = gimple_assign_lhs (g); | |
19270 | } | |
19271 | if (!useless_type_conversion_p (addtype, TREE_TYPE (ret))) | |
19272 | { | |
19273 | g = gimple_build_assign (make_ssa_name (addtype), NOP_EXPR, ret); | |
19274 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
19275 | ret = gimple_assign_lhs (g); | |
19276 | } | |
19277 | if (POINTER_TYPE_P (ptype)) | |
19278 | { | |
19279 | tree size = TYPE_SIZE_UNIT (TREE_TYPE (ptype)); | |
19280 | if (size && TREE_CODE (size) == INTEGER_CST) | |
19281 | { | |
19282 | g = gimple_build_assign (make_ssa_name (addtype), MULT_EXPR, | |
19283 | ret, fold_convert (addtype, size)); | |
19284 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
19285 | ret = gimple_assign_lhs (g); | |
19286 | } | |
19287 | } | |
19288 | return ret; | |
19289 | } | |
19290 | ||
0136f8f0 AH |
19291 | /* Adjust the argument types in NODE to their appropriate vector |
19292 | counterparts. */ | |
19293 | ||
19294 | static void | |
19295 | simd_clone_adjust (struct cgraph_node *node) | |
19296 | { | |
19297 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); | |
19298 | ||
19299 | targetm.simd_clone.adjust (node); | |
19300 | ||
19301 | tree retval = simd_clone_adjust_return_type (node); | |
19302 | ipa_parm_adjustment_vec adjustments | |
19303 | = simd_clone_adjust_argument_types (node); | |
19304 | ||
19305 | push_gimplify_context (); | |
19306 | ||
19307 | gimple_seq seq = simd_clone_init_simd_arrays (node, adjustments); | |
19308 | ||
19309 | /* Adjust all uses of vector arguments accordingly. Adjust all | |
19310 | return values accordingly. */ | |
19311 | tree iter = create_tmp_var (unsigned_type_node, "iter"); | |
b731b390 JJ |
19312 | tree iter1 = make_ssa_name (iter); |
19313 | tree iter2 = make_ssa_name (iter); | |
0136f8f0 AH |
19314 | ipa_simd_modify_function_body (node, adjustments, retval, iter1); |
19315 | ||
19316 | /* Initialize the iteration variable. */ | |
19317 | basic_block entry_bb = single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
19318 | basic_block body_bb = split_block_after_labels (entry_bb)->dest; | |
19319 | gimple_stmt_iterator gsi = gsi_after_labels (entry_bb); | |
19320 | /* Insert the SIMD array and iv initialization at function | |
19321 | entry. */ | |
19322 | gsi_insert_seq_before (&gsi, seq, GSI_NEW_STMT); | |
19323 | ||
19324 | pop_gimplify_context (NULL); | |
19325 | ||
19326 | /* Create a new BB right before the original exit BB, to hold the | |
19327 | iteration increment and the condition/branch. */ | |
19328 | basic_block orig_exit = EDGE_PRED (EXIT_BLOCK_PTR_FOR_FN (cfun), 0)->src; | |
19329 | basic_block incr_bb = create_empty_bb (orig_exit); | |
33d9078a | 19330 | add_bb_to_loop (incr_bb, body_bb->loop_father); |
0136f8f0 AH |
19331 | /* The succ of orig_exit was EXIT_BLOCK_PTR_FOR_FN (cfun), with an empty |
19332 | flag. Set it now to be a FALLTHRU_EDGE. */ | |
19333 | gcc_assert (EDGE_COUNT (orig_exit->succs) == 1); | |
19334 | EDGE_SUCC (orig_exit, 0)->flags |= EDGE_FALLTHRU; | |
19335 | for (unsigned i = 0; | |
19336 | i < EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds); ++i) | |
19337 | { | |
19338 | edge e = EDGE_PRED (EXIT_BLOCK_PTR_FOR_FN (cfun), i); | |
19339 | redirect_edge_succ (e, incr_bb); | |
19340 | } | |
19341 | edge e = make_edge (incr_bb, EXIT_BLOCK_PTR_FOR_FN (cfun), 0); | |
19342 | e->probability = REG_BR_PROB_BASE; | |
19343 | gsi = gsi_last_bb (incr_bb); | |
355fe088 | 19344 | gimple *g = gimple_build_assign (iter2, PLUS_EXPR, iter1, |
0d0e4a03 | 19345 | build_int_cst (unsigned_type_node, 1)); |
0136f8f0 AH |
19346 | gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING); |
19347 | ||
19348 | /* Mostly annotate the loop for the vectorizer (the rest is done below). */ | |
19349 | struct loop *loop = alloc_loop (); | |
b15b5979 | 19350 | cfun->has_force_vectorize_loops = true; |
0136f8f0 | 19351 | loop->safelen = node->simdclone->simdlen; |
b15b5979 | 19352 | loop->force_vectorize = true; |
0136f8f0 | 19353 | loop->header = body_bb; |
0136f8f0 AH |
19354 | |
19355 | /* Branch around the body if the mask applies. */ | |
19356 | if (node->simdclone->inbranch) | |
19357 | { | |
19358 | gimple_stmt_iterator gsi = gsi_last_bb (loop->header); | |
19359 | tree mask_array | |
19360 | = node->simdclone->args[node->simdclone->nargs - 1].simd_array; | |
b731b390 | 19361 | tree mask = make_ssa_name (TREE_TYPE (TREE_TYPE (mask_array))); |
0136f8f0 AH |
19362 | tree aref = build4 (ARRAY_REF, |
19363 | TREE_TYPE (TREE_TYPE (mask_array)), | |
19364 | mask_array, iter1, | |
19365 | NULL, NULL); | |
19366 | g = gimple_build_assign (mask, aref); | |
19367 | gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING); | |
19368 | int bitsize = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (aref))); | |
19369 | if (!INTEGRAL_TYPE_P (TREE_TYPE (aref))) | |
19370 | { | |
19371 | aref = build1 (VIEW_CONVERT_EXPR, | |
19372 | build_nonstandard_integer_type (bitsize, 0), mask); | |
b731b390 | 19373 | mask = make_ssa_name (TREE_TYPE (aref)); |
0136f8f0 AH |
19374 | g = gimple_build_assign (mask, aref); |
19375 | gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING); | |
19376 | } | |
19377 | ||
19378 | g = gimple_build_cond (EQ_EXPR, mask, build_zero_cst (TREE_TYPE (mask)), | |
19379 | NULL, NULL); | |
19380 | gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING); | |
19381 | make_edge (loop->header, incr_bb, EDGE_TRUE_VALUE); | |
19382 | FALLTHRU_EDGE (loop->header)->flags = EDGE_FALSE_VALUE; | |
19383 | } | |
19384 | ||
19385 | /* Generate the condition. */ | |
19386 | g = gimple_build_cond (LT_EXPR, | |
19387 | iter2, | |
19388 | build_int_cst (unsigned_type_node, | |
19389 | node->simdclone->simdlen), | |
19390 | NULL, NULL); | |
19391 | gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING); | |
19392 | e = split_block (incr_bb, gsi_stmt (gsi)); | |
19393 | basic_block latch_bb = e->dest; | |
33d9078a | 19394 | basic_block new_exit_bb; |
c4d281b2 | 19395 | new_exit_bb = split_block_after_labels (latch_bb)->dest; |
0136f8f0 AH |
19396 | loop->latch = latch_bb; |
19397 | ||
19398 | redirect_edge_succ (FALLTHRU_EDGE (latch_bb), body_bb); | |
19399 | ||
19400 | make_edge (incr_bb, new_exit_bb, EDGE_FALSE_VALUE); | |
19401 | /* The successor of incr_bb is already pointing to latch_bb; just | |
19402 | change the flags. | |
19403 | make_edge (incr_bb, latch_bb, EDGE_TRUE_VALUE); */ | |
19404 | FALLTHRU_EDGE (incr_bb)->flags = EDGE_TRUE_VALUE; | |
19405 | ||
538dd0b7 | 19406 | gphi *phi = create_phi_node (iter1, body_bb); |
0136f8f0 AH |
19407 | edge preheader_edge = find_edge (entry_bb, body_bb); |
19408 | edge latch_edge = single_succ_edge (latch_bb); | |
19409 | add_phi_arg (phi, build_zero_cst (unsigned_type_node), preheader_edge, | |
19410 | UNKNOWN_LOCATION); | |
19411 | add_phi_arg (phi, iter2, latch_edge, UNKNOWN_LOCATION); | |
19412 | ||
19413 | /* Generate the new return. */ | |
19414 | gsi = gsi_last_bb (new_exit_bb); | |
19415 | if (retval | |
19416 | && TREE_CODE (retval) == VIEW_CONVERT_EXPR | |
19417 | && TREE_CODE (TREE_OPERAND (retval, 0)) == RESULT_DECL) | |
19418 | retval = TREE_OPERAND (retval, 0); | |
19419 | else if (retval) | |
19420 | { | |
19421 | retval = build1 (VIEW_CONVERT_EXPR, | |
19422 | TREE_TYPE (TREE_TYPE (node->decl)), | |
19423 | retval); | |
19424 | retval = force_gimple_operand_gsi (&gsi, retval, true, NULL, | |
19425 | false, GSI_CONTINUE_LINKING); | |
19426 | } | |
19427 | g = gimple_build_return (retval); | |
19428 | gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING); | |
19429 | ||
19430 | /* Handle aligned clauses by replacing default defs of the aligned | |
19431 | uniform args with __builtin_assume_aligned (arg_N(D), alignment) | |
19432 | lhs. Handle linear by adding PHIs. */ | |
19433 | for (unsigned i = 0; i < node->simdclone->nargs; i++) | |
3446fe48 JJ |
19434 | if (node->simdclone->args[i].arg_type == SIMD_CLONE_ARG_TYPE_UNIFORM |
19435 | && (TREE_ADDRESSABLE (node->simdclone->args[i].orig_arg) | |
19436 | || !is_gimple_reg_type | |
19437 | (TREE_TYPE (node->simdclone->args[i].orig_arg)))) | |
19438 | { | |
19439 | tree orig_arg = node->simdclone->args[i].orig_arg; | |
19440 | if (is_gimple_reg_type (TREE_TYPE (orig_arg))) | |
19441 | iter1 = make_ssa_name (TREE_TYPE (orig_arg)); | |
19442 | else | |
19443 | { | |
19444 | iter1 = create_tmp_var_raw (TREE_TYPE (orig_arg)); | |
19445 | gimple_add_tmp_var (iter1); | |
19446 | } | |
19447 | gsi = gsi_after_labels (entry_bb); | |
19448 | g = gimple_build_assign (iter1, orig_arg); | |
19449 | gsi_insert_before (&gsi, g, GSI_NEW_STMT); | |
19450 | gsi = gsi_after_labels (body_bb); | |
19451 | g = gimple_build_assign (orig_arg, iter1); | |
19452 | gsi_insert_before (&gsi, g, GSI_NEW_STMT); | |
19453 | } | |
19454 | else if (node->simdclone->args[i].arg_type == SIMD_CLONE_ARG_TYPE_UNIFORM | |
19455 | && DECL_BY_REFERENCE (node->simdclone->args[i].orig_arg) | |
19456 | && TREE_CODE (TREE_TYPE (node->simdclone->args[i].orig_arg)) | |
19457 | == REFERENCE_TYPE | |
19458 | && TREE_ADDRESSABLE | |
19459 | (TREE_TYPE (TREE_TYPE (node->simdclone->args[i].orig_arg)))) | |
19460 | { | |
19461 | tree orig_arg = node->simdclone->args[i].orig_arg; | |
19462 | tree def = ssa_default_def (cfun, orig_arg); | |
19463 | if (def && !has_zero_uses (def)) | |
19464 | { | |
19465 | iter1 = create_tmp_var_raw (TREE_TYPE (TREE_TYPE (orig_arg))); | |
19466 | gimple_add_tmp_var (iter1); | |
19467 | gsi = gsi_after_labels (entry_bb); | |
19468 | g = gimple_build_assign (iter1, build_simple_mem_ref (def)); | |
19469 | gsi_insert_before (&gsi, g, GSI_NEW_STMT); | |
19470 | gsi = gsi_after_labels (body_bb); | |
19471 | g = gimple_build_assign (build_simple_mem_ref (def), iter1); | |
19472 | gsi_insert_before (&gsi, g, GSI_NEW_STMT); | |
19473 | } | |
19474 | } | |
19475 | else if (node->simdclone->args[i].alignment | |
19476 | && node->simdclone->args[i].arg_type | |
19477 | == SIMD_CLONE_ARG_TYPE_UNIFORM | |
19478 | && (node->simdclone->args[i].alignment | |
19479 | & (node->simdclone->args[i].alignment - 1)) == 0 | |
19480 | && TREE_CODE (TREE_TYPE (node->simdclone->args[i].orig_arg)) | |
19481 | == POINTER_TYPE) | |
0136f8f0 AH |
19482 | { |
19483 | unsigned int alignment = node->simdclone->args[i].alignment; | |
19484 | tree orig_arg = node->simdclone->args[i].orig_arg; | |
19485 | tree def = ssa_default_def (cfun, orig_arg); | |
ab04b46e | 19486 | if (def && !has_zero_uses (def)) |
0136f8f0 AH |
19487 | { |
19488 | tree fn = builtin_decl_explicit (BUILT_IN_ASSUME_ALIGNED); | |
19489 | gimple_seq seq = NULL; | |
19490 | bool need_cvt = false; | |
538dd0b7 | 19491 | gcall *call |
0136f8f0 AH |
19492 | = gimple_build_call (fn, 2, def, size_int (alignment)); |
19493 | g = call; | |
19494 | if (!useless_type_conversion_p (TREE_TYPE (orig_arg), | |
19495 | ptr_type_node)) | |
19496 | need_cvt = true; | |
b731b390 | 19497 | tree t = make_ssa_name (need_cvt ? ptr_type_node : orig_arg); |
0136f8f0 AH |
19498 | gimple_call_set_lhs (g, t); |
19499 | gimple_seq_add_stmt_without_update (&seq, g); | |
19500 | if (need_cvt) | |
19501 | { | |
b731b390 | 19502 | t = make_ssa_name (orig_arg); |
0d0e4a03 | 19503 | g = gimple_build_assign (t, NOP_EXPR, gimple_call_lhs (g)); |
0136f8f0 AH |
19504 | gimple_seq_add_stmt_without_update (&seq, g); |
19505 | } | |
19506 | gsi_insert_seq_on_edge_immediate | |
19507 | (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun)), seq); | |
19508 | ||
19509 | entry_bb = single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
19510 | int freq = compute_call_stmt_bb_frequency (current_function_decl, | |
19511 | entry_bb); | |
d52f5295 ML |
19512 | node->create_edge (cgraph_node::get_create (fn), |
19513 | call, entry_bb->count, freq); | |
0136f8f0 AH |
19514 | |
19515 | imm_use_iterator iter; | |
19516 | use_operand_p use_p; | |
355fe088 | 19517 | gimple *use_stmt; |
0136f8f0 AH |
19518 | tree repl = gimple_get_lhs (g); |
19519 | FOR_EACH_IMM_USE_STMT (use_stmt, iter, def) | |
19520 | if (is_gimple_debug (use_stmt) || use_stmt == call) | |
19521 | continue; | |
19522 | else | |
19523 | FOR_EACH_IMM_USE_ON_STMT (use_p, iter) | |
19524 | SET_USE (use_p, repl); | |
19525 | } | |
19526 | } | |
d9a6bd32 JJ |
19527 | else if ((node->simdclone->args[i].arg_type |
19528 | == SIMD_CLONE_ARG_TYPE_LINEAR_CONSTANT_STEP) | |
19529 | || (node->simdclone->args[i].arg_type | |
e01d41e5 JJ |
19530 | == SIMD_CLONE_ARG_TYPE_LINEAR_REF_CONSTANT_STEP) |
19531 | || (node->simdclone->args[i].arg_type | |
19532 | == SIMD_CLONE_ARG_TYPE_LINEAR_VARIABLE_STEP) | |
19533 | || (node->simdclone->args[i].arg_type | |
19534 | == SIMD_CLONE_ARG_TYPE_LINEAR_REF_VARIABLE_STEP)) | |
0136f8f0 AH |
19535 | { |
19536 | tree orig_arg = node->simdclone->args[i].orig_arg; | |
0136f8f0 AH |
19537 | gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (orig_arg)) |
19538 | || POINTER_TYPE_P (TREE_TYPE (orig_arg))); | |
3446fe48 JJ |
19539 | tree def = NULL_TREE; |
19540 | if (TREE_ADDRESSABLE (orig_arg)) | |
19541 | { | |
19542 | def = make_ssa_name (TREE_TYPE (orig_arg)); | |
19543 | iter1 = make_ssa_name (TREE_TYPE (orig_arg)); | |
19544 | iter2 = make_ssa_name (TREE_TYPE (orig_arg)); | |
19545 | gsi = gsi_after_labels (entry_bb); | |
19546 | g = gimple_build_assign (def, orig_arg); | |
19547 | gsi_insert_before (&gsi, g, GSI_NEW_STMT); | |
19548 | } | |
19549 | else | |
19550 | { | |
19551 | def = ssa_default_def (cfun, orig_arg); | |
19552 | if (!def || has_zero_uses (def)) | |
19553 | def = NULL_TREE; | |
19554 | else | |
19555 | { | |
19556 | iter1 = make_ssa_name (orig_arg); | |
19557 | iter2 = make_ssa_name (orig_arg); | |
19558 | } | |
19559 | } | |
19560 | if (def) | |
0136f8f0 | 19561 | { |
0136f8f0 AH |
19562 | phi = create_phi_node (iter1, body_bb); |
19563 | add_phi_arg (phi, def, preheader_edge, UNKNOWN_LOCATION); | |
19564 | add_phi_arg (phi, iter2, latch_edge, UNKNOWN_LOCATION); | |
19565 | enum tree_code code = INTEGRAL_TYPE_P (TREE_TYPE (orig_arg)) | |
19566 | ? PLUS_EXPR : POINTER_PLUS_EXPR; | |
19567 | tree addtype = INTEGRAL_TYPE_P (TREE_TYPE (orig_arg)) | |
19568 | ? TREE_TYPE (orig_arg) : sizetype; | |
e01d41e5 JJ |
19569 | tree addcst = simd_clone_linear_addend (node, i, addtype, |
19570 | entry_bb); | |
0136f8f0 | 19571 | gsi = gsi_last_bb (incr_bb); |
e01d41e5 | 19572 | g = gimple_build_assign (iter2, code, iter1, addcst); |
0136f8f0 AH |
19573 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); |
19574 | ||
19575 | imm_use_iterator iter; | |
19576 | use_operand_p use_p; | |
355fe088 | 19577 | gimple *use_stmt; |
3446fe48 JJ |
19578 | if (TREE_ADDRESSABLE (orig_arg)) |
19579 | { | |
19580 | gsi = gsi_after_labels (body_bb); | |
19581 | g = gimple_build_assign (orig_arg, iter1); | |
19582 | gsi_insert_before (&gsi, g, GSI_NEW_STMT); | |
19583 | } | |
19584 | else | |
19585 | FOR_EACH_IMM_USE_STMT (use_stmt, iter, def) | |
19586 | if (use_stmt == phi) | |
19587 | continue; | |
19588 | else | |
19589 | FOR_EACH_IMM_USE_ON_STMT (use_p, iter) | |
19590 | SET_USE (use_p, iter1); | |
0136f8f0 AH |
19591 | } |
19592 | } | |
d9a6bd32 | 19593 | else if (node->simdclone->args[i].arg_type |
e01d41e5 JJ |
19594 | == SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_CONSTANT_STEP |
19595 | || (node->simdclone->args[i].arg_type | |
19596 | == SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_VARIABLE_STEP)) | |
d9a6bd32 JJ |
19597 | { |
19598 | tree orig_arg = node->simdclone->args[i].orig_arg; | |
19599 | tree def = ssa_default_def (cfun, orig_arg); | |
19600 | gcc_assert (!TREE_ADDRESSABLE (orig_arg) | |
19601 | && TREE_CODE (TREE_TYPE (orig_arg)) == REFERENCE_TYPE); | |
19602 | if (def && !has_zero_uses (def)) | |
19603 | { | |
19604 | tree rtype = TREE_TYPE (TREE_TYPE (orig_arg)); | |
19605 | iter1 = make_ssa_name (orig_arg); | |
19606 | iter2 = make_ssa_name (orig_arg); | |
19607 | tree iter3 = make_ssa_name (rtype); | |
19608 | tree iter4 = make_ssa_name (rtype); | |
19609 | tree iter5 = make_ssa_name (rtype); | |
19610 | gsi = gsi_after_labels (entry_bb); | |
19611 | gimple *load | |
19612 | = gimple_build_assign (iter3, build_simple_mem_ref (def)); | |
19613 | gsi_insert_before (&gsi, load, GSI_NEW_STMT); | |
19614 | ||
19615 | tree array = node->simdclone->args[i].simd_array; | |
19616 | TREE_ADDRESSABLE (array) = 1; | |
19617 | tree ptr = build_fold_addr_expr (array); | |
19618 | phi = create_phi_node (iter1, body_bb); | |
19619 | add_phi_arg (phi, ptr, preheader_edge, UNKNOWN_LOCATION); | |
19620 | add_phi_arg (phi, iter2, latch_edge, UNKNOWN_LOCATION); | |
19621 | g = gimple_build_assign (iter2, POINTER_PLUS_EXPR, iter1, | |
19622 | TYPE_SIZE_UNIT (TREE_TYPE (iter3))); | |
19623 | gsi = gsi_last_bb (incr_bb); | |
19624 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
19625 | ||
19626 | phi = create_phi_node (iter4, body_bb); | |
19627 | add_phi_arg (phi, iter3, preheader_edge, UNKNOWN_LOCATION); | |
19628 | add_phi_arg (phi, iter5, latch_edge, UNKNOWN_LOCATION); | |
19629 | enum tree_code code = INTEGRAL_TYPE_P (TREE_TYPE (iter3)) | |
19630 | ? PLUS_EXPR : POINTER_PLUS_EXPR; | |
19631 | tree addtype = INTEGRAL_TYPE_P (TREE_TYPE (iter3)) | |
19632 | ? TREE_TYPE (iter3) : sizetype; | |
e01d41e5 JJ |
19633 | tree addcst = simd_clone_linear_addend (node, i, addtype, |
19634 | entry_bb); | |
d9a6bd32 JJ |
19635 | g = gimple_build_assign (iter5, code, iter4, addcst); |
19636 | gsi = gsi_last_bb (incr_bb); | |
19637 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
19638 | ||
19639 | g = gimple_build_assign (build_simple_mem_ref (iter1), iter4); | |
19640 | gsi = gsi_after_labels (body_bb); | |
19641 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
19642 | ||
19643 | imm_use_iterator iter; | |
19644 | use_operand_p use_p; | |
19645 | gimple *use_stmt; | |
19646 | FOR_EACH_IMM_USE_STMT (use_stmt, iter, def) | |
19647 | if (use_stmt == load) | |
19648 | continue; | |
19649 | else | |
19650 | FOR_EACH_IMM_USE_ON_STMT (use_p, iter) | |
19651 | SET_USE (use_p, iter1); | |
19652 | ||
19653 | if (!TYPE_READONLY (rtype)) | |
19654 | { | |
19655 | tree v = make_ssa_name (rtype); | |
19656 | tree aref = build4 (ARRAY_REF, rtype, array, | |
19657 | size_zero_node, NULL_TREE, | |
19658 | NULL_TREE); | |
19659 | gsi = gsi_after_labels (new_exit_bb); | |
19660 | g = gimple_build_assign (v, aref); | |
19661 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
19662 | g = gimple_build_assign (build_simple_mem_ref (def), v); | |
19663 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
19664 | } | |
19665 | } | |
19666 | } | |
0136f8f0 AH |
19667 | |
19668 | calculate_dominance_info (CDI_DOMINATORS); | |
19669 | add_loop (loop, loop->header->loop_father); | |
19670 | update_ssa (TODO_update_ssa); | |
19671 | ||
19672 | pop_cfun (); | |
19673 | } | |
19674 | ||
19675 | /* If the function in NODE is tagged as an elemental SIMD function, | |
19676 | create the appropriate SIMD clones. */ | |
19677 | ||
19678 | static void | |
19679 | expand_simd_clones (struct cgraph_node *node) | |
19680 | { | |
0136f8f0 AH |
19681 | tree attr = lookup_attribute ("omp declare simd", |
19682 | DECL_ATTRIBUTES (node->decl)); | |
e06f9964 JJ |
19683 | if (attr == NULL_TREE |
19684 | || node->global.inlined_to | |
19685 | || lookup_attribute ("noclone", DECL_ATTRIBUTES (node->decl))) | |
0136f8f0 | 19686 | return; |
e06f9964 | 19687 | |
0136f8f0 AH |
19688 | /* Ignore |
19689 | #pragma omp declare simd | |
19690 | extern int foo (); | |
19691 | in C, there we don't know the argument types at all. */ | |
19692 | if (!node->definition | |
19693 | && TYPE_ARG_TYPES (TREE_TYPE (node->decl)) == NULL_TREE) | |
19694 | return; | |
19695 | ||
9a784760 JJ |
19696 | /* Call this before creating clone_info, as it might ggc_collect. */ |
19697 | if (node->definition && node->has_gimple_body_p ()) | |
19698 | node->get_body (); | |
19699 | ||
0136f8f0 AH |
19700 | do |
19701 | { | |
19702 | /* Start with parsing the "omp declare simd" attribute(s). */ | |
19703 | bool inbranch_clause_specified; | |
19704 | struct cgraph_simd_clone *clone_info | |
19705 | = simd_clone_clauses_extract (node, TREE_VALUE (attr), | |
19706 | &inbranch_clause_specified); | |
19707 | if (clone_info == NULL) | |
19708 | continue; | |
19709 | ||
19710 | int orig_simdlen = clone_info->simdlen; | |
19711 | tree base_type = simd_clone_compute_base_data_type (node, clone_info); | |
19712 | /* The target can return 0 (no simd clones should be created), | |
19713 | 1 (just one ISA of simd clones should be created) or higher | |
19714 | count of ISA variants. In that case, clone_info is initialized | |
19715 | for the first ISA variant. */ | |
19716 | int count | |
19717 | = targetm.simd_clone.compute_vecsize_and_simdlen (node, clone_info, | |
19718 | base_type, 0); | |
19719 | if (count == 0) | |
19720 | continue; | |
19721 | ||
19722 | /* Loop over all COUNT ISA variants, and if !INBRANCH_CLAUSE_SPECIFIED, | |
19723 | also create one inbranch and one !inbranch clone of it. */ | |
19724 | for (int i = 0; i < count * 2; i++) | |
19725 | { | |
19726 | struct cgraph_simd_clone *clone = clone_info; | |
19727 | if (inbranch_clause_specified && (i & 1) != 0) | |
19728 | continue; | |
19729 | ||
19730 | if (i != 0) | |
19731 | { | |
19732 | clone = simd_clone_struct_alloc (clone_info->nargs | |
0136f8f0 AH |
19733 | + ((i & 1) != 0)); |
19734 | simd_clone_struct_copy (clone, clone_info); | |
19735 | /* Undo changes targetm.simd_clone.compute_vecsize_and_simdlen | |
19736 | and simd_clone_adjust_argument_types did to the first | |
19737 | clone's info. */ | |
19738 | clone->nargs -= clone_info->inbranch; | |
19739 | clone->simdlen = orig_simdlen; | |
19740 | /* And call the target hook again to get the right ISA. */ | |
19741 | targetm.simd_clone.compute_vecsize_and_simdlen (node, clone, | |
19742 | base_type, | |
19743 | i / 2); | |
19744 | if ((i & 1) != 0) | |
19745 | clone->inbranch = 1; | |
19746 | } | |
19747 | ||
19748 | /* simd_clone_mangle might fail if such a clone has been created | |
19749 | already. */ | |
19750 | tree id = simd_clone_mangle (node, clone); | |
19751 | if (id == NULL_TREE) | |
19752 | continue; | |
19753 | ||
19754 | /* Only when we are sure we want to create the clone actually | |
19755 | clone the function (or definitions) or create another | |
19756 | extern FUNCTION_DECL (for prototypes without definitions). */ | |
19757 | struct cgraph_node *n = simd_clone_create (node); | |
19758 | if (n == NULL) | |
19759 | continue; | |
19760 | ||
19761 | n->simdclone = clone; | |
19762 | clone->origin = node; | |
19763 | clone->next_clone = NULL; | |
19764 | if (node->simd_clones == NULL) | |
19765 | { | |
19766 | clone->prev_clone = n; | |
19767 | node->simd_clones = n; | |
19768 | } | |
19769 | else | |
19770 | { | |
19771 | clone->prev_clone = node->simd_clones->simdclone->prev_clone; | |
19772 | clone->prev_clone->simdclone->next_clone = n; | |
19773 | node->simd_clones->simdclone->prev_clone = n; | |
19774 | } | |
3dafb85c | 19775 | symtab->change_decl_assembler_name (n->decl, id); |
0136f8f0 AH |
19776 | /* And finally adjust the return type, parameters and for |
19777 | definitions also function body. */ | |
19778 | if (node->definition) | |
19779 | simd_clone_adjust (n); | |
19780 | else | |
19781 | { | |
19782 | simd_clone_adjust_return_type (n); | |
19783 | simd_clone_adjust_argument_types (n); | |
19784 | } | |
19785 | } | |
19786 | } | |
19787 | while ((attr = lookup_attribute ("omp declare simd", TREE_CHAIN (attr)))); | |
19788 | } | |
19789 | ||
19790 | /* Entry point for IPA simd clone creation pass. */ | |
19791 | ||
19792 | static unsigned int | |
19793 | ipa_omp_simd_clone (void) | |
19794 | { | |
19795 | struct cgraph_node *node; | |
19796 | FOR_EACH_FUNCTION (node) | |
19797 | expand_simd_clones (node); | |
19798 | return 0; | |
19799 | } | |
19800 | ||
17795822 TS |
19801 | namespace { |
19802 | ||
19803 | const pass_data pass_data_omp_simd_clone = | |
0136f8f0 AH |
19804 | { |
19805 | SIMPLE_IPA_PASS, /* type */ | |
19806 | "simdclone", /* name */ | |
19807 | OPTGROUP_NONE, /* optinfo_flags */ | |
0136f8f0 AH |
19808 | TV_NONE, /* tv_id */ |
19809 | ( PROP_ssa | PROP_cfg ), /* properties_required */ | |
19810 | 0, /* properties_provided */ | |
19811 | 0, /* properties_destroyed */ | |
19812 | 0, /* todo_flags_start */ | |
19813 | 0, /* todo_flags_finish */ | |
19814 | }; | |
19815 | ||
17795822 | 19816 | class pass_omp_simd_clone : public simple_ipa_opt_pass |
0136f8f0 AH |
19817 | { |
19818 | public: | |
19819 | pass_omp_simd_clone(gcc::context *ctxt) | |
19820 | : simple_ipa_opt_pass(pass_data_omp_simd_clone, ctxt) | |
19821 | {} | |
19822 | ||
19823 | /* opt_pass methods: */ | |
1a3d085c | 19824 | virtual bool gate (function *); |
be55bfe6 | 19825 | virtual unsigned int execute (function *) { return ipa_omp_simd_clone (); } |
0136f8f0 AH |
19826 | }; |
19827 | ||
1a3d085c TS |
19828 | bool |
19829 | pass_omp_simd_clone::gate (function *) | |
19830 | { | |
fff77217 | 19831 | return targetm.simd_clone.compute_vecsize_and_simdlen != NULL; |
1a3d085c TS |
19832 | } |
19833 | ||
17795822 TS |
19834 | } // anon namespace |
19835 | ||
0136f8f0 AH |
19836 | simple_ipa_opt_pass * |
19837 | make_pass_omp_simd_clone (gcc::context *ctxt) | |
19838 | { | |
19839 | return new pass_omp_simd_clone (ctxt); | |
19840 | } | |
27a4cd48 | 19841 | |
ec6fe917 IV |
19842 | /* Helper function for omp_finish_file routine. Takes decls from V_DECLS and |
19843 | adds their addresses and sizes to constructor-vector V_CTOR. */ | |
19844 | static void | |
19845 | add_decls_addresses_to_decl_constructor (vec<tree, va_gc> *v_decls, | |
19846 | vec<constructor_elt, va_gc> *v_ctor) | |
19847 | { | |
19848 | unsigned len = vec_safe_length (v_decls); | |
19849 | for (unsigned i = 0; i < len; i++) | |
19850 | { | |
19851 | tree it = (*v_decls)[i]; | |
4a38b02b IV |
19852 | bool is_var = TREE_CODE (it) == VAR_DECL; |
19853 | bool is_link_var | |
19854 | = is_var | |
19855 | #ifdef ACCEL_COMPILER | |
19856 | && DECL_HAS_VALUE_EXPR_P (it) | |
19857 | #endif | |
19858 | && lookup_attribute ("omp declare target link", DECL_ATTRIBUTES (it)); | |
ec6fe917 | 19859 | |
4a38b02b IV |
19860 | tree size = NULL_TREE; |
19861 | if (is_var) | |
19862 | size = fold_convert (const_ptr_type_node, DECL_SIZE_UNIT (it)); | |
19863 | ||
19864 | tree addr; | |
19865 | if (!is_link_var) | |
19866 | addr = build_fold_addr_expr (it); | |
19867 | else | |
19868 | { | |
19869 | #ifdef ACCEL_COMPILER | |
19870 | /* For "omp declare target link" vars add address of the pointer to | |
19871 | the target table, instead of address of the var. */ | |
19872 | tree value_expr = DECL_VALUE_EXPR (it); | |
19873 | tree link_ptr_decl = TREE_OPERAND (value_expr, 0); | |
19874 | varpool_node::finalize_decl (link_ptr_decl); | |
19875 | addr = build_fold_addr_expr (link_ptr_decl); | |
19876 | #else | |
19877 | addr = build_fold_addr_expr (it); | |
19878 | #endif | |
19879 | ||
19880 | /* Most significant bit of the size marks "omp declare target link" | |
19881 | vars in host and target tables. */ | |
19882 | unsigned HOST_WIDE_INT isize = tree_to_uhwi (size); | |
19883 | isize |= 1ULL << (int_size_in_bytes (const_ptr_type_node) | |
19884 | * BITS_PER_UNIT - 1); | |
19885 | size = wide_int_to_tree (const_ptr_type_node, isize); | |
19886 | } | |
19887 | ||
19888 | CONSTRUCTOR_APPEND_ELT (v_ctor, NULL_TREE, addr); | |
19889 | if (is_var) | |
19890 | CONSTRUCTOR_APPEND_ELT (v_ctor, NULL_TREE, size); | |
ec6fe917 IV |
19891 | } |
19892 | } | |
19893 | ||
19894 | /* Create new symbols containing (address, size) pairs for global variables, | |
19895 | marked with "omp declare target" attribute, as well as addresses for the | |
41dbbb37 | 19896 | functions, which are outlined offloading regions. */ |
ec6fe917 IV |
19897 | void |
19898 | omp_finish_file (void) | |
19899 | { | |
19900 | unsigned num_funcs = vec_safe_length (offload_funcs); | |
19901 | unsigned num_vars = vec_safe_length (offload_vars); | |
19902 | ||
19903 | if (num_funcs == 0 && num_vars == 0) | |
19904 | return; | |
19905 | ||
19906 | if (targetm_common.have_named_sections) | |
19907 | { | |
19908 | vec<constructor_elt, va_gc> *v_f, *v_v; | |
19909 | vec_alloc (v_f, num_funcs); | |
19910 | vec_alloc (v_v, num_vars * 2); | |
19911 | ||
19912 | add_decls_addresses_to_decl_constructor (offload_funcs, v_f); | |
19913 | add_decls_addresses_to_decl_constructor (offload_vars, v_v); | |
19914 | ||
19915 | tree vars_decl_type = build_array_type_nelts (pointer_sized_int_node, | |
19916 | num_vars * 2); | |
19917 | tree funcs_decl_type = build_array_type_nelts (pointer_sized_int_node, | |
19918 | num_funcs); | |
19919 | TYPE_ALIGN (vars_decl_type) = TYPE_ALIGN (pointer_sized_int_node); | |
19920 | TYPE_ALIGN (funcs_decl_type) = TYPE_ALIGN (pointer_sized_int_node); | |
19921 | tree ctor_v = build_constructor (vars_decl_type, v_v); | |
19922 | tree ctor_f = build_constructor (funcs_decl_type, v_f); | |
19923 | TREE_CONSTANT (ctor_v) = TREE_CONSTANT (ctor_f) = 1; | |
19924 | TREE_STATIC (ctor_v) = TREE_STATIC (ctor_f) = 1; | |
19925 | tree funcs_decl = build_decl (UNKNOWN_LOCATION, VAR_DECL, | |
19926 | get_identifier (".offload_func_table"), | |
19927 | funcs_decl_type); | |
19928 | tree vars_decl = build_decl (UNKNOWN_LOCATION, VAR_DECL, | |
19929 | get_identifier (".offload_var_table"), | |
19930 | vars_decl_type); | |
19931 | TREE_STATIC (funcs_decl) = TREE_STATIC (vars_decl) = 1; | |
19932 | /* Do not align tables more than TYPE_ALIGN (pointer_sized_int_node), | |
19933 | otherwise a joint table in a binary will contain padding between | |
19934 | tables from multiple object files. */ | |
19935 | DECL_USER_ALIGN (funcs_decl) = DECL_USER_ALIGN (vars_decl) = 1; | |
19936 | DECL_ALIGN (funcs_decl) = TYPE_ALIGN (funcs_decl_type); | |
19937 | DECL_ALIGN (vars_decl) = TYPE_ALIGN (vars_decl_type); | |
19938 | DECL_INITIAL (funcs_decl) = ctor_f; | |
19939 | DECL_INITIAL (vars_decl) = ctor_v; | |
19940 | set_decl_section_name (funcs_decl, OFFLOAD_FUNC_TABLE_SECTION_NAME); | |
19941 | set_decl_section_name (vars_decl, OFFLOAD_VAR_TABLE_SECTION_NAME); | |
19942 | ||
19943 | varpool_node::finalize_decl (vars_decl); | |
19944 | varpool_node::finalize_decl (funcs_decl); | |
844b0125 | 19945 | } |
ec6fe917 IV |
19946 | else |
19947 | { | |
19948 | for (unsigned i = 0; i < num_funcs; i++) | |
19949 | { | |
19950 | tree it = (*offload_funcs)[i]; | |
19951 | targetm.record_offload_symbol (it); | |
19952 | } | |
19953 | for (unsigned i = 0; i < num_vars; i++) | |
19954 | { | |
19955 | tree it = (*offload_vars)[i]; | |
19956 | targetm.record_offload_symbol (it); | |
19957 | } | |
19958 | } | |
19959 | } | |
19960 | ||
9bd46bc9 NS |
19961 | /* Find the number of threads (POS = false), or thread number (POS = |
19962 | true) for an OpenACC region partitioned as MASK. Setup code | |
19963 | required for the calculation is added to SEQ. */ | |
19964 | ||
19965 | static tree | |
19966 | oacc_thread_numbers (bool pos, int mask, gimple_seq *seq) | |
19967 | { | |
19968 | tree res = pos ? NULL_TREE : build_int_cst (unsigned_type_node, 1); | |
19969 | unsigned ix; | |
19970 | ||
19971 | /* Start at gang level, and examine relevant dimension indices. */ | |
19972 | for (ix = GOMP_DIM_GANG; ix != GOMP_DIM_MAX; ix++) | |
19973 | if (GOMP_DIM_MASK (ix) & mask) | |
19974 | { | |
19975 | tree arg = build_int_cst (unsigned_type_node, ix); | |
19976 | ||
19977 | if (res) | |
19978 | { | |
19979 | /* We had an outer index, so scale that by the size of | |
19980 | this dimension. */ | |
19981 | tree n = create_tmp_var (integer_type_node); | |
19982 | gimple *call | |
19983 | = gimple_build_call_internal (IFN_GOACC_DIM_SIZE, 1, arg); | |
19984 | ||
19985 | gimple_call_set_lhs (call, n); | |
19986 | gimple_seq_add_stmt (seq, call); | |
19987 | res = fold_build2 (MULT_EXPR, integer_type_node, res, n); | |
19988 | } | |
19989 | if (pos) | |
19990 | { | |
19991 | /* Determine index in this dimension. */ | |
19992 | tree id = create_tmp_var (integer_type_node); | |
19993 | gimple *call = gimple_build_call_internal | |
19994 | (IFN_GOACC_DIM_POS, 1, arg); | |
19995 | ||
19996 | gimple_call_set_lhs (call, id); | |
19997 | gimple_seq_add_stmt (seq, call); | |
19998 | if (res) | |
19999 | res = fold_build2 (PLUS_EXPR, integer_type_node, res, id); | |
20000 | else | |
20001 | res = id; | |
20002 | } | |
20003 | } | |
20004 | ||
20005 | if (res == NULL_TREE) | |
20006 | res = integer_zero_node; | |
20007 | ||
20008 | return res; | |
20009 | } | |
20010 | ||
20011 | /* Transform IFN_GOACC_LOOP calls to actual code. See | |
20012 | expand_oacc_for for where these are generated. At the vector | |
20013 | level, we stride loops, such that each member of a warp will | |
20014 | operate on adjacent iterations. At the worker and gang level, | |
20015 | each gang/warp executes a set of contiguous iterations. Chunking | |
20016 | can override this such that each iteration engine executes a | |
20017 | contiguous chunk, and then moves on to stride to the next chunk. */ | |
20018 | ||
20019 | static void | |
20020 | oacc_xform_loop (gcall *call) | |
20021 | { | |
20022 | gimple_stmt_iterator gsi = gsi_for_stmt (call); | |
20023 | enum ifn_goacc_loop_kind code | |
20024 | = (enum ifn_goacc_loop_kind) TREE_INT_CST_LOW (gimple_call_arg (call, 0)); | |
20025 | tree dir = gimple_call_arg (call, 1); | |
20026 | tree range = gimple_call_arg (call, 2); | |
20027 | tree step = gimple_call_arg (call, 3); | |
20028 | tree chunk_size = NULL_TREE; | |
20029 | unsigned mask = (unsigned) TREE_INT_CST_LOW (gimple_call_arg (call, 5)); | |
20030 | tree lhs = gimple_call_lhs (call); | |
20031 | tree type = TREE_TYPE (lhs); | |
20032 | tree diff_type = TREE_TYPE (range); | |
20033 | tree r = NULL_TREE; | |
20034 | gimple_seq seq = NULL; | |
20035 | bool chunking = false, striding = true; | |
20036 | unsigned outer_mask = mask & (~mask + 1); // Outermost partitioning | |
20037 | unsigned inner_mask = mask & ~outer_mask; // Inner partitioning (if any) | |
20038 | ||
20039 | #ifdef ACCEL_COMPILER | |
20040 | chunk_size = gimple_call_arg (call, 4); | |
20041 | if (integer_minus_onep (chunk_size) /* Force static allocation. */ | |
20042 | || integer_zerop (chunk_size)) /* Default (also static). */ | |
20043 | { | |
20044 | /* If we're at the gang level, we want each to execute a | |
20045 | contiguous run of iterations. Otherwise we want each element | |
20046 | to stride. */ | |
20047 | striding = !(outer_mask & GOMP_DIM_MASK (GOMP_DIM_GANG)); | |
20048 | chunking = false; | |
20049 | } | |
20050 | else | |
20051 | { | |
20052 | /* Chunk of size 1 is striding. */ | |
20053 | striding = integer_onep (chunk_size); | |
20054 | chunking = !striding; | |
20055 | } | |
20056 | #endif | |
20057 | ||
20058 | /* striding=true, chunking=true | |
20059 | -> invalid. | |
20060 | striding=true, chunking=false | |
20061 | -> chunks=1 | |
20062 | striding=false,chunking=true | |
20063 | -> chunks=ceil (range/(chunksize*threads*step)) | |
20064 | striding=false,chunking=false | |
20065 | -> chunk_size=ceil(range/(threads*step)),chunks=1 */ | |
20066 | push_gimplify_context (true); | |
20067 | ||
20068 | switch (code) | |
20069 | { | |
20070 | default: gcc_unreachable (); | |
20071 | ||
20072 | case IFN_GOACC_LOOP_CHUNKS: | |
20073 | if (!chunking) | |
20074 | r = build_int_cst (type, 1); | |
20075 | else | |
20076 | { | |
20077 | /* chunk_max | |
20078 | = (range - dir) / (chunks * step * num_threads) + dir */ | |
20079 | tree per = oacc_thread_numbers (false, mask, &seq); | |
20080 | per = fold_convert (type, per); | |
20081 | chunk_size = fold_convert (type, chunk_size); | |
20082 | per = fold_build2 (MULT_EXPR, type, per, chunk_size); | |
20083 | per = fold_build2 (MULT_EXPR, type, per, step); | |
20084 | r = build2 (MINUS_EXPR, type, range, dir); | |
20085 | r = build2 (PLUS_EXPR, type, r, per); | |
20086 | r = build2 (TRUNC_DIV_EXPR, type, r, per); | |
20087 | } | |
20088 | break; | |
20089 | ||
20090 | case IFN_GOACC_LOOP_STEP: | |
20091 | { | |
20092 | /* If striding, step by the entire compute volume, otherwise | |
20093 | step by the inner volume. */ | |
20094 | unsigned volume = striding ? mask : inner_mask; | |
20095 | ||
20096 | r = oacc_thread_numbers (false, volume, &seq); | |
20097 | r = build2 (MULT_EXPR, type, fold_convert (type, r), step); | |
20098 | } | |
20099 | break; | |
20100 | ||
20101 | case IFN_GOACC_LOOP_OFFSET: | |
20102 | if (striding) | |
20103 | { | |
20104 | r = oacc_thread_numbers (true, mask, &seq); | |
20105 | r = fold_convert (diff_type, r); | |
20106 | } | |
20107 | else | |
20108 | { | |
20109 | tree inner_size = oacc_thread_numbers (false, inner_mask, &seq); | |
20110 | tree outer_size = oacc_thread_numbers (false, outer_mask, &seq); | |
20111 | tree volume = fold_build2 (MULT_EXPR, TREE_TYPE (inner_size), | |
20112 | inner_size, outer_size); | |
20113 | ||
20114 | volume = fold_convert (diff_type, volume); | |
20115 | if (chunking) | |
20116 | chunk_size = fold_convert (diff_type, chunk_size); | |
20117 | else | |
20118 | { | |
20119 | tree per = fold_build2 (MULT_EXPR, diff_type, volume, step); | |
20120 | ||
20121 | chunk_size = build2 (MINUS_EXPR, diff_type, range, dir); | |
20122 | chunk_size = build2 (PLUS_EXPR, diff_type, chunk_size, per); | |
20123 | chunk_size = build2 (TRUNC_DIV_EXPR, diff_type, chunk_size, per); | |
20124 | } | |
20125 | ||
20126 | tree span = build2 (MULT_EXPR, diff_type, chunk_size, | |
20127 | fold_convert (diff_type, inner_size)); | |
20128 | r = oacc_thread_numbers (true, outer_mask, &seq); | |
20129 | r = fold_convert (diff_type, r); | |
20130 | r = build2 (MULT_EXPR, diff_type, r, span); | |
20131 | ||
20132 | tree inner = oacc_thread_numbers (true, inner_mask, &seq); | |
20133 | inner = fold_convert (diff_type, inner); | |
20134 | r = fold_build2 (PLUS_EXPR, diff_type, r, inner); | |
20135 | ||
20136 | if (chunking) | |
20137 | { | |
20138 | tree chunk = fold_convert (diff_type, gimple_call_arg (call, 6)); | |
20139 | tree per | |
20140 | = fold_build2 (MULT_EXPR, diff_type, volume, chunk_size); | |
20141 | per = build2 (MULT_EXPR, diff_type, per, chunk); | |
20142 | ||
20143 | r = build2 (PLUS_EXPR, diff_type, r, per); | |
20144 | } | |
20145 | } | |
20146 | r = fold_build2 (MULT_EXPR, diff_type, r, step); | |
20147 | if (type != diff_type) | |
20148 | r = fold_convert (type, r); | |
20149 | break; | |
20150 | ||
20151 | case IFN_GOACC_LOOP_BOUND: | |
20152 | if (striding) | |
20153 | r = range; | |
20154 | else | |
20155 | { | |
20156 | tree inner_size = oacc_thread_numbers (false, inner_mask, &seq); | |
20157 | tree outer_size = oacc_thread_numbers (false, outer_mask, &seq); | |
20158 | tree volume = fold_build2 (MULT_EXPR, TREE_TYPE (inner_size), | |
20159 | inner_size, outer_size); | |
20160 | ||
20161 | volume = fold_convert (diff_type, volume); | |
20162 | if (chunking) | |
20163 | chunk_size = fold_convert (diff_type, chunk_size); | |
20164 | else | |
20165 | { | |
20166 | tree per = fold_build2 (MULT_EXPR, diff_type, volume, step); | |
20167 | ||
20168 | chunk_size = build2 (MINUS_EXPR, diff_type, range, dir); | |
20169 | chunk_size = build2 (PLUS_EXPR, diff_type, chunk_size, per); | |
20170 | chunk_size = build2 (TRUNC_DIV_EXPR, diff_type, chunk_size, per); | |
20171 | } | |
20172 | ||
20173 | tree span = build2 (MULT_EXPR, diff_type, chunk_size, | |
20174 | fold_convert (diff_type, inner_size)); | |
20175 | ||
20176 | r = fold_build2 (MULT_EXPR, diff_type, span, step); | |
20177 | ||
20178 | tree offset = gimple_call_arg (call, 6); | |
20179 | r = build2 (PLUS_EXPR, diff_type, r, | |
20180 | fold_convert (diff_type, offset)); | |
20181 | r = build2 (integer_onep (dir) ? MIN_EXPR : MAX_EXPR, | |
20182 | diff_type, r, range); | |
20183 | } | |
20184 | if (diff_type != type) | |
20185 | r = fold_convert (type, r); | |
20186 | break; | |
20187 | } | |
20188 | ||
20189 | gimplify_assign (lhs, r, &seq); | |
20190 | ||
20191 | pop_gimplify_context (NULL); | |
20192 | ||
20193 | gsi_replace_with_seq (&gsi, seq, true); | |
20194 | } | |
20195 | ||
94829f87 NS |
20196 | /* Validate and update the dimensions for offloaded FN. ATTRS is the |
20197 | raw attribute. DIMS is an array of dimensions, which is returned. | |
20198 | Returns the function level dimensionality -- the level at which an | |
20199 | offload routine wishes to partition a loop. */ | |
20200 | ||
20201 | static int | |
20202 | oacc_validate_dims (tree fn, tree attrs, int *dims) | |
20203 | { | |
20204 | tree purpose[GOMP_DIM_MAX]; | |
20205 | unsigned ix; | |
20206 | tree pos = TREE_VALUE (attrs); | |
20207 | int fn_level = -1; | |
20208 | ||
20209 | /* Make sure the attribute creator attached the dimension | |
20210 | information. */ | |
20211 | gcc_assert (pos); | |
20212 | ||
20213 | for (ix = 0; ix != GOMP_DIM_MAX; ix++) | |
20214 | { | |
20215 | purpose[ix] = TREE_PURPOSE (pos); | |
20216 | ||
20217 | if (purpose[ix]) | |
20218 | { | |
20219 | if (integer_zerop (purpose[ix])) | |
20220 | fn_level = ix + 1; | |
20221 | else if (fn_level < 0) | |
20222 | fn_level = ix; | |
20223 | } | |
20224 | ||
20225 | tree val = TREE_VALUE (pos); | |
20226 | dims[ix] = val ? TREE_INT_CST_LOW (val) : -1; | |
20227 | pos = TREE_CHAIN (pos); | |
20228 | } | |
20229 | ||
20230 | bool changed = targetm.goacc.validate_dims (fn, dims, fn_level); | |
20231 | ||
20232 | /* Default anything left to 1. */ | |
20233 | for (ix = 0; ix != GOMP_DIM_MAX; ix++) | |
20234 | if (dims[ix] < 0) | |
20235 | { | |
20236 | dims[ix] = 1; | |
20237 | changed = true; | |
20238 | } | |
20239 | ||
20240 | if (changed) | |
20241 | { | |
20242 | /* Replace the attribute with new values. */ | |
20243 | pos = NULL_TREE; | |
20244 | for (ix = GOMP_DIM_MAX; ix--;) | |
20245 | pos = tree_cons (purpose[ix], | |
20246 | build_int_cst (integer_type_node, dims[ix]), | |
20247 | pos); | |
20248 | replace_oacc_fn_attrib (fn, pos); | |
20249 | } | |
20250 | ||
20251 | return fn_level; | |
20252 | } | |
20253 | ||
9bd46bc9 NS |
20254 | /* Create an empty OpenACC loop structure at LOC. */ |
20255 | ||
20256 | static oacc_loop * | |
20257 | new_oacc_loop_raw (oacc_loop *parent, location_t loc) | |
20258 | { | |
20259 | oacc_loop *loop = XCNEW (oacc_loop); | |
20260 | ||
20261 | loop->parent = parent; | |
20262 | loop->child = loop->sibling = NULL; | |
20263 | ||
20264 | if (parent) | |
20265 | { | |
20266 | loop->sibling = parent->child; | |
20267 | parent->child = loop; | |
20268 | } | |
20269 | ||
20270 | loop->loc = loc; | |
20271 | loop->marker = NULL; | |
20272 | memset (loop->heads, 0, sizeof (loop->heads)); | |
20273 | memset (loop->tails, 0, sizeof (loop->tails)); | |
20274 | loop->routine = NULL_TREE; | |
20275 | ||
20276 | loop->mask = loop->flags = 0; | |
20277 | loop->chunk_size = 0; | |
20278 | loop->head_end = NULL; | |
20279 | ||
20280 | return loop; | |
20281 | } | |
20282 | ||
20283 | /* Create an outermost, dummy OpenACC loop for offloaded function | |
20284 | DECL. */ | |
20285 | ||
20286 | static oacc_loop * | |
20287 | new_oacc_loop_outer (tree decl) | |
20288 | { | |
20289 | return new_oacc_loop_raw (NULL, DECL_SOURCE_LOCATION (decl)); | |
20290 | } | |
20291 | ||
20292 | /* Start a new OpenACC loop structure beginning at head marker HEAD. | |
20293 | Link into PARENT loop. Return the new loop. */ | |
20294 | ||
20295 | static oacc_loop * | |
20296 | new_oacc_loop (oacc_loop *parent, gcall *marker) | |
20297 | { | |
20298 | oacc_loop *loop = new_oacc_loop_raw (parent, gimple_location (marker)); | |
20299 | ||
20300 | loop->marker = marker; | |
20301 | ||
20302 | /* TODO: This is where device_type flattening would occur for the loop | |
20303 | flags. */ | |
20304 | ||
20305 | loop->flags = TREE_INT_CST_LOW (gimple_call_arg (marker, 3)); | |
20306 | ||
20307 | tree chunk_size = integer_zero_node; | |
20308 | if (loop->flags & OLF_GANG_STATIC) | |
20309 | chunk_size = gimple_call_arg (marker, 4); | |
20310 | loop->chunk_size = chunk_size; | |
20311 | ||
20312 | return loop; | |
20313 | } | |
20314 | ||
20315 | /* Create a dummy loop encompassing a call to a openACC routine. | |
20316 | Extract the routine's partitioning requirements. */ | |
20317 | ||
20318 | static void | |
20319 | new_oacc_loop_routine (oacc_loop *parent, gcall *call, tree decl, tree attrs) | |
20320 | { | |
20321 | oacc_loop *loop = new_oacc_loop_raw (parent, gimple_location (call)); | |
20322 | int dims[GOMP_DIM_MAX]; | |
20323 | int level = oacc_validate_dims (decl, attrs, dims); | |
20324 | ||
20325 | gcc_assert (level >= 0); | |
20326 | ||
20327 | loop->marker = call; | |
20328 | loop->routine = decl; | |
20329 | loop->mask = ((GOMP_DIM_MASK (GOMP_DIM_MAX) - 1) | |
20330 | ^ (GOMP_DIM_MASK (level) - 1)); | |
20331 | } | |
20332 | ||
20333 | /* Finish off the current OpenACC loop ending at tail marker TAIL. | |
20334 | Return the parent loop. */ | |
20335 | ||
20336 | static oacc_loop * | |
20337 | finish_oacc_loop (oacc_loop *loop) | |
20338 | { | |
20339 | return loop->parent; | |
20340 | } | |
20341 | ||
20342 | /* Free all OpenACC loop structures within LOOP (inclusive). */ | |
20343 | ||
20344 | static void | |
20345 | free_oacc_loop (oacc_loop *loop) | |
20346 | { | |
20347 | if (loop->sibling) | |
20348 | free_oacc_loop (loop->sibling); | |
20349 | if (loop->child) | |
20350 | free_oacc_loop (loop->child); | |
20351 | ||
20352 | free (loop); | |
20353 | } | |
20354 | ||
20355 | /* Dump out the OpenACC loop head or tail beginning at FROM. */ | |
20356 | ||
20357 | static void | |
20358 | dump_oacc_loop_part (FILE *file, gcall *from, int depth, | |
20359 | const char *title, int level) | |
20360 | { | |
20361 | enum ifn_unique_kind kind | |
20362 | = (enum ifn_unique_kind) TREE_INT_CST_LOW (gimple_call_arg (from, 0)); | |
20363 | ||
20364 | fprintf (file, "%*s%s-%d:\n", depth * 2, "", title, level); | |
20365 | for (gimple_stmt_iterator gsi = gsi_for_stmt (from);;) | |
20366 | { | |
20367 | gimple *stmt = gsi_stmt (gsi); | |
20368 | ||
20369 | if (is_gimple_call (stmt) | |
20370 | && gimple_call_internal_p (stmt) | |
20371 | && gimple_call_internal_fn (stmt) == IFN_UNIQUE) | |
20372 | { | |
20373 | enum ifn_unique_kind k | |
20374 | = ((enum ifn_unique_kind) TREE_INT_CST_LOW | |
20375 | (gimple_call_arg (stmt, 0))); | |
20376 | ||
20377 | if (k == kind && stmt != from) | |
20378 | break; | |
20379 | } | |
20380 | print_gimple_stmt (file, stmt, depth * 2 + 2, 0); | |
20381 | ||
20382 | gsi_next (&gsi); | |
20383 | while (gsi_end_p (gsi)) | |
20384 | gsi = gsi_start_bb (single_succ (gsi_bb (gsi))); | |
20385 | } | |
20386 | } | |
20387 | ||
20388 | /* Dump OpenACC loops LOOP, its siblings and its children. */ | |
20389 | ||
20390 | static void | |
20391 | dump_oacc_loop (FILE *file, oacc_loop *loop, int depth) | |
20392 | { | |
20393 | int ix; | |
20394 | ||
20395 | fprintf (file, "%*sLoop %x(%x) %s:%u\n", depth * 2, "", | |
20396 | loop->flags, loop->mask, | |
20397 | LOCATION_FILE (loop->loc), LOCATION_LINE (loop->loc)); | |
20398 | ||
20399 | if (loop->marker) | |
20400 | print_gimple_stmt (file, loop->marker, depth * 2, 0); | |
20401 | ||
20402 | if (loop->routine) | |
20403 | fprintf (file, "%*sRoutine %s:%u:%s\n", | |
20404 | depth * 2, "", DECL_SOURCE_FILE (loop->routine), | |
20405 | DECL_SOURCE_LINE (loop->routine), | |
20406 | IDENTIFIER_POINTER (DECL_NAME (loop->routine))); | |
20407 | ||
20408 | for (ix = GOMP_DIM_GANG; ix != GOMP_DIM_MAX; ix++) | |
20409 | if (loop->heads[ix]) | |
20410 | dump_oacc_loop_part (file, loop->heads[ix], depth, "Head", ix); | |
20411 | for (ix = GOMP_DIM_MAX; ix--;) | |
20412 | if (loop->tails[ix]) | |
20413 | dump_oacc_loop_part (file, loop->tails[ix], depth, "Tail", ix); | |
20414 | ||
20415 | if (loop->child) | |
20416 | dump_oacc_loop (file, loop->child, depth + 1); | |
20417 | if (loop->sibling) | |
20418 | dump_oacc_loop (file, loop->sibling, depth); | |
20419 | } | |
20420 | ||
20421 | void debug_oacc_loop (oacc_loop *); | |
20422 | ||
20423 | /* Dump loops to stderr. */ | |
20424 | ||
20425 | DEBUG_FUNCTION void | |
20426 | debug_oacc_loop (oacc_loop *loop) | |
20427 | { | |
20428 | dump_oacc_loop (stderr, loop, 0); | |
20429 | } | |
20430 | ||
20431 | /* DFS walk of basic blocks BB onwards, creating OpenACC loop | |
20432 | structures as we go. By construction these loops are properly | |
20433 | nested. */ | |
20434 | ||
20435 | static void | |
20436 | oacc_loop_discover_walk (oacc_loop *loop, basic_block bb) | |
20437 | { | |
20438 | int marker = 0; | |
20439 | int remaining = 0; | |
20440 | ||
20441 | if (bb->flags & BB_VISITED) | |
20442 | return; | |
20443 | ||
20444 | follow: | |
20445 | bb->flags |= BB_VISITED; | |
20446 | ||
20447 | /* Scan for loop markers. */ | |
20448 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi); | |
20449 | gsi_next (&gsi)) | |
20450 | { | |
20451 | gimple *stmt = gsi_stmt (gsi); | |
20452 | ||
20453 | if (!is_gimple_call (stmt)) | |
20454 | continue; | |
20455 | ||
20456 | gcall *call = as_a <gcall *> (stmt); | |
20457 | ||
20458 | /* If this is a routine, make a dummy loop for it. */ | |
20459 | if (tree decl = gimple_call_fndecl (call)) | |
20460 | if (tree attrs = get_oacc_fn_attrib (decl)) | |
20461 | { | |
20462 | gcc_assert (!marker); | |
20463 | new_oacc_loop_routine (loop, call, decl, attrs); | |
20464 | } | |
20465 | ||
20466 | if (!gimple_call_internal_p (call)) | |
20467 | continue; | |
20468 | ||
20469 | if (gimple_call_internal_fn (call) != IFN_UNIQUE) | |
20470 | continue; | |
20471 | ||
20472 | enum ifn_unique_kind kind | |
20473 | = (enum ifn_unique_kind) TREE_INT_CST_LOW (gimple_call_arg (call, 0)); | |
20474 | if (kind == IFN_UNIQUE_OACC_HEAD_MARK | |
20475 | || kind == IFN_UNIQUE_OACC_TAIL_MARK) | |
20476 | { | |
20477 | if (gimple_call_num_args (call) == 2) | |
20478 | { | |
20479 | gcc_assert (marker && !remaining); | |
20480 | marker = 0; | |
20481 | if (kind == IFN_UNIQUE_OACC_TAIL_MARK) | |
20482 | loop = finish_oacc_loop (loop); | |
20483 | else | |
20484 | loop->head_end = call; | |
20485 | } | |
20486 | else | |
20487 | { | |
20488 | int count = TREE_INT_CST_LOW (gimple_call_arg (call, 2)); | |
20489 | ||
20490 | if (!marker) | |
20491 | { | |
20492 | if (kind == IFN_UNIQUE_OACC_HEAD_MARK) | |
20493 | loop = new_oacc_loop (loop, call); | |
20494 | remaining = count; | |
20495 | } | |
20496 | gcc_assert (count == remaining); | |
20497 | if (remaining) | |
20498 | { | |
20499 | remaining--; | |
20500 | if (kind == IFN_UNIQUE_OACC_HEAD_MARK) | |
20501 | loop->heads[marker] = call; | |
20502 | else | |
20503 | loop->tails[remaining] = call; | |
20504 | } | |
20505 | marker++; | |
20506 | } | |
20507 | } | |
20508 | } | |
20509 | if (remaining || marker) | |
20510 | { | |
20511 | bb = single_succ (bb); | |
20512 | gcc_assert (single_pred_p (bb) && !(bb->flags & BB_VISITED)); | |
20513 | goto follow; | |
20514 | } | |
20515 | ||
20516 | /* Walk successor blocks. */ | |
20517 | edge e; | |
20518 | edge_iterator ei; | |
20519 | ||
20520 | FOR_EACH_EDGE (e, ei, bb->succs) | |
20521 | oacc_loop_discover_walk (loop, e->dest); | |
20522 | } | |
20523 | ||
20524 | /* LOOP is the first sibling. Reverse the order in place and return | |
20525 | the new first sibling. Recurse to child loops. */ | |
20526 | ||
20527 | static oacc_loop * | |
20528 | oacc_loop_sibling_nreverse (oacc_loop *loop) | |
20529 | { | |
20530 | oacc_loop *last = NULL; | |
20531 | do | |
20532 | { | |
20533 | if (loop->child) | |
20534 | loop->child = oacc_loop_sibling_nreverse (loop->child); | |
20535 | ||
20536 | oacc_loop *next = loop->sibling; | |
20537 | loop->sibling = last; | |
20538 | last = loop; | |
20539 | loop = next; | |
20540 | } | |
20541 | while (loop); | |
20542 | ||
20543 | return last; | |
20544 | } | |
20545 | ||
20546 | /* Discover the OpenACC loops marked up by HEAD and TAIL markers for | |
20547 | the current function. */ | |
20548 | ||
20549 | static oacc_loop * | |
20550 | oacc_loop_discovery () | |
20551 | { | |
20552 | basic_block bb; | |
20553 | ||
20554 | oacc_loop *top = new_oacc_loop_outer (current_function_decl); | |
20555 | oacc_loop_discover_walk (top, ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
20556 | ||
20557 | /* The siblings were constructed in reverse order, reverse them so | |
20558 | that diagnostics come out in an unsurprising order. */ | |
20559 | top = oacc_loop_sibling_nreverse (top); | |
20560 | ||
20561 | /* Reset the visited flags. */ | |
20562 | FOR_ALL_BB_FN (bb, cfun) | |
20563 | bb->flags &= ~BB_VISITED; | |
20564 | ||
20565 | return top; | |
20566 | } | |
20567 | ||
20568 | /* Transform the abstract internal function markers starting at FROM | |
20569 | to be for partitioning level LEVEL. Stop when we meet another HEAD | |
20570 | or TAIL marker. */ | |
20571 | ||
20572 | static void | |
20573 | oacc_loop_xform_head_tail (gcall *from, int level) | |
20574 | { | |
20575 | enum ifn_unique_kind kind | |
20576 | = (enum ifn_unique_kind) TREE_INT_CST_LOW (gimple_call_arg (from, 0)); | |
20577 | tree replacement = build_int_cst (unsigned_type_node, level); | |
20578 | ||
20579 | for (gimple_stmt_iterator gsi = gsi_for_stmt (from);;) | |
20580 | { | |
20581 | gimple *stmt = gsi_stmt (gsi); | |
20582 | ||
20583 | if (is_gimple_call (stmt) | |
20584 | && gimple_call_internal_p (stmt) | |
20585 | && gimple_call_internal_fn (stmt) == IFN_UNIQUE) | |
20586 | { | |
20587 | enum ifn_unique_kind k | |
20588 | = ((enum ifn_unique_kind) | |
20589 | TREE_INT_CST_LOW (gimple_call_arg (stmt, 0))); | |
20590 | ||
20591 | if (k == IFN_UNIQUE_OACC_FORK || k == IFN_UNIQUE_OACC_JOIN) | |
20592 | *gimple_call_arg_ptr (stmt, 2) = replacement; | |
20593 | else if (k == kind && stmt != from) | |
20594 | break; | |
20595 | } | |
e5014671 NS |
20596 | else if (is_gimple_call (stmt) |
20597 | && gimple_call_internal_p (stmt) | |
20598 | && gimple_call_internal_fn (stmt) == IFN_GOACC_REDUCTION) | |
20599 | *gimple_call_arg_ptr (stmt, 3) = replacement; | |
20600 | ||
9bd46bc9 NS |
20601 | gsi_next (&gsi); |
20602 | while (gsi_end_p (gsi)) | |
20603 | gsi = gsi_start_bb (single_succ (gsi_bb (gsi))); | |
20604 | } | |
20605 | } | |
20606 | ||
20607 | /* Transform the IFN_GOACC_LOOP internal functions by providing the | |
20608 | determined partitioning mask and chunking argument. */ | |
20609 | ||
20610 | static void | |
20611 | oacc_loop_xform_loop (gcall *end_marker, tree mask_arg, tree chunk_arg) | |
20612 | { | |
20613 | gimple_stmt_iterator gsi = gsi_for_stmt (end_marker); | |
20614 | ||
20615 | for (;;) | |
20616 | { | |
20617 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) | |
20618 | { | |
20619 | gimple *stmt = gsi_stmt (gsi); | |
20620 | ||
20621 | if (!is_gimple_call (stmt)) | |
20622 | continue; | |
20623 | ||
20624 | gcall *call = as_a <gcall *> (stmt); | |
20625 | ||
20626 | if (!gimple_call_internal_p (call)) | |
20627 | continue; | |
20628 | ||
20629 | if (gimple_call_internal_fn (call) != IFN_GOACC_LOOP) | |
20630 | continue; | |
20631 | ||
20632 | *gimple_call_arg_ptr (call, 5) = mask_arg; | |
20633 | *gimple_call_arg_ptr (call, 4) = chunk_arg; | |
20634 | if (TREE_INT_CST_LOW (gimple_call_arg (call, 0)) | |
20635 | == IFN_GOACC_LOOP_BOUND) | |
20636 | return; | |
20637 | } | |
20638 | ||
20639 | /* If we didn't see LOOP_BOUND, it should be in the single | |
20640 | successor block. */ | |
20641 | basic_block bb = single_succ (gsi_bb (gsi)); | |
20642 | gsi = gsi_start_bb (bb); | |
20643 | } | |
20644 | } | |
20645 | ||
20646 | /* Process the discovered OpenACC loops, setting the correct | |
20647 | partitioning level etc. */ | |
20648 | ||
20649 | static void | |
20650 | oacc_loop_process (oacc_loop *loop) | |
20651 | { | |
20652 | if (loop->child) | |
20653 | oacc_loop_process (loop->child); | |
20654 | ||
20655 | if (loop->mask && !loop->routine) | |
20656 | { | |
20657 | int ix; | |
20658 | unsigned mask = loop->mask; | |
20659 | unsigned dim = GOMP_DIM_GANG; | |
20660 | tree mask_arg = build_int_cst (unsigned_type_node, mask); | |
20661 | tree chunk_arg = loop->chunk_size; | |
20662 | ||
20663 | oacc_loop_xform_loop (loop->head_end, mask_arg, chunk_arg); | |
20664 | ||
20665 | for (ix = 0; ix != GOMP_DIM_MAX && loop->heads[ix]; ix++) | |
20666 | { | |
20667 | gcc_assert (mask); | |
20668 | ||
20669 | while (!(GOMP_DIM_MASK (dim) & mask)) | |
20670 | dim++; | |
20671 | ||
20672 | oacc_loop_xform_head_tail (loop->heads[ix], dim); | |
20673 | oacc_loop_xform_head_tail (loop->tails[ix], dim); | |
20674 | ||
20675 | mask ^= GOMP_DIM_MASK (dim); | |
20676 | } | |
20677 | } | |
20678 | ||
20679 | if (loop->sibling) | |
20680 | oacc_loop_process (loop->sibling); | |
20681 | } | |
20682 | ||
20683 | /* Walk the OpenACC loop heirarchy checking and assigning the | |
20684 | programmer-specified partitionings. OUTER_MASK is the partitioning | |
c5a64cfe NS |
20685 | this loop is contained within. Return true if we contain an |
20686 | auto-partitionable loop. */ | |
9bd46bc9 | 20687 | |
c5a64cfe | 20688 | static bool |
9bd46bc9 NS |
20689 | oacc_loop_fixed_partitions (oacc_loop *loop, unsigned outer_mask) |
20690 | { | |
20691 | unsigned this_mask = loop->mask; | |
20692 | bool has_auto = false; | |
20693 | bool noisy = true; | |
20694 | ||
20695 | #ifdef ACCEL_COMPILER | |
20696 | /* When device_type is supported, we want the device compiler to be | |
20697 | noisy, if the loop parameters are device_type-specific. */ | |
20698 | noisy = false; | |
20699 | #endif | |
20700 | ||
20701 | if (!loop->routine) | |
20702 | { | |
20703 | bool auto_par = (loop->flags & OLF_AUTO) != 0; | |
20704 | bool seq_par = (loop->flags & OLF_SEQ) != 0; | |
20705 | ||
20706 | this_mask = ((loop->flags >> OLF_DIM_BASE) | |
20707 | & (GOMP_DIM_MASK (GOMP_DIM_MAX) - 1)); | |
20708 | ||
20709 | if ((this_mask != 0) + auto_par + seq_par > 1) | |
20710 | { | |
20711 | if (noisy) | |
20712 | error_at (loop->loc, | |
20713 | seq_par | |
20714 | ? "%<seq%> overrides other OpenACC loop specifiers" | |
20715 | : "%<auto%> conflicts with other OpenACC loop specifiers"); | |
20716 | auto_par = false; | |
20717 | loop->flags &= ~OLF_AUTO; | |
20718 | if (seq_par) | |
20719 | { | |
20720 | loop->flags &= | |
20721 | ~((GOMP_DIM_MASK (GOMP_DIM_MAX) - 1) << OLF_DIM_BASE); | |
20722 | this_mask = 0; | |
20723 | } | |
20724 | } | |
20725 | if (auto_par && (loop->flags & OLF_INDEPENDENT)) | |
20726 | has_auto = true; | |
20727 | } | |
20728 | ||
20729 | if (this_mask & outer_mask) | |
20730 | { | |
20731 | const oacc_loop *outer; | |
20732 | for (outer = loop->parent; outer; outer = outer->parent) | |
20733 | if (outer->mask & this_mask) | |
20734 | break; | |
20735 | ||
20736 | if (noisy) | |
20737 | { | |
20738 | if (outer) | |
20739 | { | |
20740 | error_at (loop->loc, | |
20741 | "%s uses same OpenACC parallelism as containing loop", | |
20742 | loop->routine ? "routine call" : "inner loop"); | |
20743 | inform (outer->loc, "containing loop here"); | |
20744 | } | |
20745 | else | |
20746 | error_at (loop->loc, | |
20747 | "%s uses OpenACC parallelism disallowed by containing routine", | |
20748 | loop->routine ? "routine call" : "loop"); | |
20749 | ||
20750 | if (loop->routine) | |
20751 | inform (DECL_SOURCE_LOCATION (loop->routine), | |
20752 | "routine %qD declared here", loop->routine); | |
20753 | } | |
20754 | this_mask &= ~outer_mask; | |
20755 | } | |
20756 | else | |
20757 | { | |
20758 | unsigned outermost = this_mask & -this_mask; | |
20759 | ||
20760 | if (outermost && outermost <= outer_mask) | |
20761 | { | |
20762 | if (noisy) | |
20763 | { | |
20764 | error_at (loop->loc, | |
20765 | "incorrectly nested OpenACC loop parallelism"); | |
20766 | ||
20767 | const oacc_loop *outer; | |
20768 | for (outer = loop->parent; | |
20769 | outer->flags && outer->flags < outermost; | |
20770 | outer = outer->parent) | |
20771 | continue; | |
20772 | inform (outer->loc, "containing loop here"); | |
20773 | } | |
20774 | ||
20775 | this_mask &= ~outermost; | |
20776 | } | |
20777 | } | |
20778 | ||
20779 | loop->mask = this_mask; | |
20780 | ||
20781 | if (loop->child | |
20782 | && oacc_loop_fixed_partitions (loop->child, outer_mask | this_mask)) | |
20783 | has_auto = true; | |
20784 | ||
20785 | if (loop->sibling | |
20786 | && oacc_loop_fixed_partitions (loop->sibling, outer_mask)) | |
20787 | has_auto = true; | |
20788 | ||
20789 | return has_auto; | |
20790 | } | |
20791 | ||
c5a64cfe NS |
20792 | /* Walk the OpenACC loop heirarchy to assign auto-partitioned loops. |
20793 | OUTER_MASK is the partitioning this loop is contained within. | |
20794 | Return the cumulative partitioning used by this loop, siblings and | |
20795 | children. */ | |
20796 | ||
20797 | static unsigned | |
20798 | oacc_loop_auto_partitions (oacc_loop *loop, unsigned outer_mask) | |
20799 | { | |
20800 | unsigned inner_mask = 0; | |
20801 | bool noisy = true; | |
20802 | ||
20803 | #ifdef ACCEL_COMPILER | |
20804 | /* When device_type is supported, we want the device compiler to be | |
20805 | noisy, if the loop parameters are device_type-specific. */ | |
20806 | noisy = false; | |
20807 | #endif | |
20808 | ||
20809 | if (loop->child) | |
20810 | inner_mask |= oacc_loop_auto_partitions (loop->child, | |
20811 | outer_mask | loop->mask); | |
20812 | ||
20813 | if ((loop->flags & OLF_AUTO) && (loop->flags & OLF_INDEPENDENT)) | |
20814 | { | |
20815 | unsigned this_mask = 0; | |
20816 | ||
20817 | /* Determine the outermost partitioning used within this loop. */ | |
20818 | this_mask = inner_mask | GOMP_DIM_MASK (GOMP_DIM_MAX); | |
20819 | this_mask = (this_mask & -this_mask); | |
20820 | ||
20821 | /* Pick the partitioning just inside that one. */ | |
20822 | this_mask >>= 1; | |
20823 | ||
20824 | /* And avoid picking one use by an outer loop. */ | |
20825 | this_mask &= ~outer_mask; | |
20826 | ||
20827 | if (!this_mask && noisy) | |
20828 | warning_at (loop->loc, 0, | |
20829 | "insufficient partitioning available to parallelize loop"); | |
20830 | ||
20831 | loop->mask = this_mask; | |
20832 | } | |
20833 | inner_mask |= loop->mask; | |
20834 | ||
20835 | if (loop->sibling) | |
20836 | inner_mask |= oacc_loop_auto_partitions (loop->sibling, outer_mask); | |
20837 | ||
20838 | return inner_mask; | |
20839 | } | |
20840 | ||
9bd46bc9 NS |
20841 | /* Walk the OpenACC loop heirarchy to check and assign partitioning |
20842 | axes. */ | |
20843 | ||
20844 | static void | |
c5a64cfe | 20845 | oacc_loop_partition (oacc_loop *loop, unsigned outer_mask) |
9bd46bc9 | 20846 | { |
c5a64cfe NS |
20847 | if (oacc_loop_fixed_partitions (loop, outer_mask)) |
20848 | oacc_loop_auto_partitions (loop, outer_mask); | |
9bd46bc9 NS |
20849 | } |
20850 | ||
6e91acf8 NS |
20851 | /* Default fork/join early expander. Delete the function calls if |
20852 | there is no RTL expander. */ | |
20853 | ||
20854 | bool | |
20855 | default_goacc_fork_join (gcall *ARG_UNUSED (call), | |
20856 | const int *ARG_UNUSED (dims), bool is_fork) | |
20857 | { | |
20858 | if (is_fork) | |
20859 | return targetm.have_oacc_fork (); | |
20860 | else | |
20861 | return targetm.have_oacc_join (); | |
20862 | } | |
20863 | ||
e5014671 NS |
20864 | /* Default goacc.reduction early expander. |
20865 | ||
20866 | LHS-opt = IFN_REDUCTION (KIND, RES_PTR, VAR, LEVEL, OP, OFFSET) | |
20867 | If RES_PTR is not integer-zerop: | |
20868 | SETUP - emit 'LHS = *RES_PTR', LHS = NULL | |
20869 | TEARDOWN - emit '*RES_PTR = VAR' | |
20870 | If LHS is not NULL | |
20871 | emit 'LHS = VAR' */ | |
20872 | ||
20873 | void | |
20874 | default_goacc_reduction (gcall *call) | |
20875 | { | |
20876 | unsigned code = (unsigned)TREE_INT_CST_LOW (gimple_call_arg (call, 0)); | |
20877 | gimple_stmt_iterator gsi = gsi_for_stmt (call); | |
20878 | tree lhs = gimple_call_lhs (call); | |
20879 | tree var = gimple_call_arg (call, 2); | |
20880 | gimple_seq seq = NULL; | |
20881 | ||
20882 | if (code == IFN_GOACC_REDUCTION_SETUP | |
20883 | || code == IFN_GOACC_REDUCTION_TEARDOWN) | |
20884 | { | |
20885 | /* Setup and Teardown need to copy from/to the receiver object, | |
20886 | if there is one. */ | |
20887 | tree ref_to_res = gimple_call_arg (call, 1); | |
20888 | ||
20889 | if (!integer_zerop (ref_to_res)) | |
20890 | { | |
20891 | tree dst = build_simple_mem_ref (ref_to_res); | |
20892 | tree src = var; | |
20893 | ||
20894 | if (code == IFN_GOACC_REDUCTION_SETUP) | |
20895 | { | |
20896 | src = dst; | |
20897 | dst = lhs; | |
20898 | lhs = NULL; | |
20899 | } | |
20900 | gimple_seq_add_stmt (&seq, gimple_build_assign (dst, src)); | |
20901 | } | |
20902 | } | |
20903 | ||
20904 | /* Copy VAR to LHS, if there is an LHS. */ | |
20905 | if (lhs) | |
20906 | gimple_seq_add_stmt (&seq, gimple_build_assign (lhs, var)); | |
20907 | ||
20908 | gsi_replace_with_seq (&gsi, seq, true); | |
20909 | } | |
20910 | ||
94829f87 NS |
20911 | /* Main entry point for oacc transformations which run on the device |
20912 | compiler after LTO, so we know what the target device is at this | |
20913 | point (including the host fallback). */ | |
20914 | ||
20915 | static unsigned int | |
20916 | execute_oacc_device_lower () | |
20917 | { | |
20918 | tree attrs = get_oacc_fn_attrib (current_function_decl); | |
20919 | int dims[GOMP_DIM_MAX]; | |
20920 | ||
20921 | if (!attrs) | |
20922 | /* Not an offloaded function. */ | |
20923 | return 0; | |
20924 | ||
9bd46bc9 NS |
20925 | int fn_level = oacc_validate_dims (current_function_decl, attrs, dims); |
20926 | ||
20927 | /* Discover, partition and process the loops. */ | |
20928 | oacc_loop *loops = oacc_loop_discovery (); | |
c5a64cfe NS |
20929 | unsigned outer_mask = fn_level >= 0 ? GOMP_DIM_MASK (fn_level) - 1 : 0; |
20930 | oacc_loop_partition (loops, outer_mask); | |
9bd46bc9 NS |
20931 | oacc_loop_process (loops); |
20932 | if (dump_file) | |
20933 | { | |
20934 | fprintf (dump_file, "OpenACC loops\n"); | |
20935 | dump_oacc_loop (dump_file, loops, 0); | |
20936 | fprintf (dump_file, "\n"); | |
20937 | } | |
20938 | ||
e5014671 NS |
20939 | /* Offloaded targets may introduce new basic blocks, which require |
20940 | dominance information to update SSA. */ | |
20941 | calculate_dominance_info (CDI_DOMINATORS); | |
20942 | ||
9bd46bc9 NS |
20943 | /* Now lower internal loop functions to target-specific code |
20944 | sequences. */ | |
20945 | basic_block bb; | |
20946 | FOR_ALL_BB_FN (bb, cfun) | |
20947 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi);) | |
20948 | { | |
20949 | gimple *stmt = gsi_stmt (gsi); | |
20950 | if (!is_gimple_call (stmt)) | |
20951 | { | |
20952 | gsi_next (&gsi); | |
20953 | continue; | |
20954 | } | |
20955 | ||
20956 | gcall *call = as_a <gcall *> (stmt); | |
20957 | if (!gimple_call_internal_p (call)) | |
20958 | { | |
20959 | gsi_next (&gsi); | |
20960 | continue; | |
20961 | } | |
20962 | ||
20963 | /* Rewind to allow rescan. */ | |
20964 | gsi_prev (&gsi); | |
20965 | bool rescan = false, remove = false; | |
20966 | enum internal_fn ifn_code = gimple_call_internal_fn (call); | |
20967 | ||
20968 | switch (ifn_code) | |
20969 | { | |
20970 | default: break; | |
20971 | ||
20972 | case IFN_GOACC_LOOP: | |
20973 | oacc_xform_loop (call); | |
20974 | rescan = true; | |
20975 | break; | |
20976 | ||
e5014671 NS |
20977 | case IFN_GOACC_REDUCTION: |
20978 | /* Mark the function for SSA renaming. */ | |
20979 | mark_virtual_operands_for_renaming (cfun); | |
20980 | ||
20981 | /* If the level is -1, this ended up being an unused | |
20982 | axis. Handle as a default. */ | |
20983 | if (integer_minus_onep (gimple_call_arg (call, 3))) | |
20984 | default_goacc_reduction (call); | |
20985 | else | |
20986 | targetm.goacc.reduction (call); | |
20987 | rescan = true; | |
20988 | break; | |
20989 | ||
9bd46bc9 NS |
20990 | case IFN_UNIQUE: |
20991 | { | |
20992 | enum ifn_unique_kind kind | |
20993 | = ((enum ifn_unique_kind) | |
20994 | TREE_INT_CST_LOW (gimple_call_arg (call, 0))); | |
20995 | ||
20996 | switch (kind) | |
20997 | { | |
20998 | default: | |
20999 | gcc_unreachable (); | |
21000 | ||
21001 | case IFN_UNIQUE_OACC_FORK: | |
21002 | case IFN_UNIQUE_OACC_JOIN: | |
21003 | if (integer_minus_onep (gimple_call_arg (call, 2))) | |
21004 | remove = true; | |
21005 | else if (!targetm.goacc.fork_join | |
21006 | (call, dims, kind == IFN_UNIQUE_OACC_FORK)) | |
21007 | remove = true; | |
21008 | break; | |
21009 | ||
21010 | case IFN_UNIQUE_OACC_HEAD_MARK: | |
21011 | case IFN_UNIQUE_OACC_TAIL_MARK: | |
21012 | remove = true; | |
21013 | break; | |
21014 | } | |
21015 | break; | |
21016 | } | |
21017 | } | |
21018 | ||
21019 | if (gsi_end_p (gsi)) | |
21020 | /* We rewound past the beginning of the BB. */ | |
21021 | gsi = gsi_start_bb (bb); | |
21022 | else | |
21023 | /* Undo the rewind. */ | |
21024 | gsi_next (&gsi); | |
21025 | ||
21026 | if (remove) | |
21027 | { | |
21028 | if (gimple_vdef (call)) | |
21029 | replace_uses_by (gimple_vdef (call), gimple_vuse (call)); | |
21030 | if (gimple_call_lhs (call)) | |
21031 | { | |
21032 | /* Propagate the data dependency var. */ | |
21033 | gimple *ass = gimple_build_assign (gimple_call_lhs (call), | |
21034 | gimple_call_arg (call, 1)); | |
21035 | gsi_replace (&gsi, ass, false); | |
21036 | } | |
21037 | else | |
21038 | gsi_remove (&gsi, true); | |
21039 | } | |
21040 | else if (!rescan) | |
21041 | /* If not rescanning, advance over the call. */ | |
21042 | gsi_next (&gsi); | |
21043 | } | |
21044 | ||
21045 | free_oacc_loop (loops); | |
21046 | ||
94829f87 NS |
21047 | return 0; |
21048 | } | |
21049 | ||
21050 | /* Default launch dimension validator. Force everything to 1. A | |
21051 | backend that wants to provide larger dimensions must override this | |
21052 | hook. */ | |
21053 | ||
21054 | bool | |
21055 | default_goacc_validate_dims (tree ARG_UNUSED (decl), int *dims, | |
21056 | int ARG_UNUSED (fn_level)) | |
21057 | { | |
21058 | bool changed = false; | |
21059 | ||
21060 | for (unsigned ix = 0; ix != GOMP_DIM_MAX; ix++) | |
21061 | { | |
21062 | if (dims[ix] != 1) | |
21063 | { | |
21064 | dims[ix] = 1; | |
21065 | changed = true; | |
21066 | } | |
21067 | } | |
21068 | ||
21069 | return changed; | |
21070 | } | |
21071 | ||
bd751975 NS |
21072 | /* Default dimension bound is unknown on accelerator and 1 on host. */ |
21073 | ||
21074 | int | |
21075 | default_goacc_dim_limit (int ARG_UNUSED (axis)) | |
21076 | { | |
21077 | #ifdef ACCEL_COMPILER | |
21078 | return 0; | |
21079 | #else | |
21080 | return 1; | |
21081 | #endif | |
21082 | } | |
21083 | ||
94829f87 NS |
21084 | namespace { |
21085 | ||
21086 | const pass_data pass_data_oacc_device_lower = | |
21087 | { | |
21088 | GIMPLE_PASS, /* type */ | |
21089 | "oaccdevlow", /* name */ | |
21090 | OPTGROUP_NONE, /* optinfo_flags */ | |
21091 | TV_NONE, /* tv_id */ | |
21092 | PROP_cfg, /* properties_required */ | |
21093 | 0 /* Possibly PROP_gimple_eomp. */, /* properties_provided */ | |
21094 | 0, /* properties_destroyed */ | |
21095 | 0, /* todo_flags_start */ | |
21096 | TODO_update_ssa | TODO_cleanup_cfg, /* todo_flags_finish */ | |
21097 | }; | |
21098 | ||
21099 | class pass_oacc_device_lower : public gimple_opt_pass | |
21100 | { | |
21101 | public: | |
21102 | pass_oacc_device_lower (gcc::context *ctxt) | |
21103 | : gimple_opt_pass (pass_data_oacc_device_lower, ctxt) | |
21104 | {} | |
21105 | ||
21106 | /* opt_pass methods: */ | |
21107 | virtual unsigned int execute (function *) | |
21108 | { | |
adc2b4d7 | 21109 | bool gate = flag_openacc != 0; |
94829f87 NS |
21110 | |
21111 | if (!gate) | |
21112 | return 0; | |
21113 | ||
21114 | return execute_oacc_device_lower (); | |
21115 | } | |
21116 | ||
374d0225 | 21117 | }; // class pass_oacc_device_lower |
94829f87 NS |
21118 | |
21119 | } // anon namespace | |
21120 | ||
21121 | gimple_opt_pass * | |
21122 | make_pass_oacc_device_lower (gcc::context *ctxt) | |
21123 | { | |
21124 | return new pass_oacc_device_lower (ctxt); | |
21125 | } | |
21126 | ||
4a38b02b IV |
21127 | /* "omp declare target link" handling pass. */ |
21128 | ||
21129 | namespace { | |
21130 | ||
21131 | const pass_data pass_data_omp_target_link = | |
21132 | { | |
21133 | GIMPLE_PASS, /* type */ | |
21134 | "omptargetlink", /* name */ | |
21135 | OPTGROUP_NONE, /* optinfo_flags */ | |
21136 | TV_NONE, /* tv_id */ | |
21137 | PROP_ssa, /* properties_required */ | |
21138 | 0, /* properties_provided */ | |
21139 | 0, /* properties_destroyed */ | |
21140 | 0, /* todo_flags_start */ | |
21141 | TODO_update_ssa, /* todo_flags_finish */ | |
21142 | }; | |
21143 | ||
21144 | class pass_omp_target_link : public gimple_opt_pass | |
21145 | { | |
21146 | public: | |
21147 | pass_omp_target_link (gcc::context *ctxt) | |
21148 | : gimple_opt_pass (pass_data_omp_target_link, ctxt) | |
21149 | {} | |
21150 | ||
21151 | /* opt_pass methods: */ | |
21152 | virtual bool gate (function *fun) | |
21153 | { | |
21154 | #ifdef ACCEL_COMPILER | |
21155 | tree attrs = DECL_ATTRIBUTES (fun->decl); | |
21156 | return lookup_attribute ("omp declare target", attrs) | |
21157 | || lookup_attribute ("omp target entrypoint", attrs); | |
21158 | #else | |
21159 | (void) fun; | |
21160 | return false; | |
21161 | #endif | |
21162 | } | |
21163 | ||
21164 | virtual unsigned execute (function *); | |
21165 | }; | |
21166 | ||
21167 | /* Callback for walk_gimple_stmt used to scan for link var operands. */ | |
21168 | ||
21169 | static tree | |
21170 | find_link_var_op (tree *tp, int *walk_subtrees, void *) | |
21171 | { | |
21172 | tree t = *tp; | |
21173 | ||
21174 | if (TREE_CODE (t) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (t) | |
21175 | && lookup_attribute ("omp declare target link", DECL_ATTRIBUTES (t))) | |
21176 | { | |
21177 | *walk_subtrees = 0; | |
21178 | return t; | |
21179 | } | |
21180 | ||
21181 | return NULL_TREE; | |
21182 | } | |
21183 | ||
21184 | unsigned | |
21185 | pass_omp_target_link::execute (function *fun) | |
21186 | { | |
21187 | basic_block bb; | |
21188 | FOR_EACH_BB_FN (bb, fun) | |
21189 | { | |
21190 | gimple_stmt_iterator gsi; | |
21191 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
21192 | if (walk_gimple_stmt (&gsi, NULL, find_link_var_op, NULL)) | |
21193 | gimple_regimplify_operands (gsi_stmt (gsi), &gsi); | |
21194 | } | |
21195 | ||
21196 | return 0; | |
21197 | } | |
21198 | ||
21199 | } // anon namespace | |
21200 | ||
21201 | gimple_opt_pass * | |
21202 | make_pass_omp_target_link (gcc::context *ctxt) | |
21203 | { | |
21204 | return new pass_omp_target_link (ctxt); | |
21205 | } | |
21206 | ||
953ff289 | 21207 | #include "gt-omp-low.h" |