]>
Commit | Line | Data |
---|---|---|
953ff289 DN |
1 | /* Lowering pass for OpenMP directives. Converts OpenMP directives |
2 | into explicit calls to the runtime library (libgomp) and data | |
3 | marshalling to implement data sharing and copying clauses. | |
4 | Contributed by Diego Novillo <dnovillo@redhat.com> | |
5 | ||
6 | Copyright (C) 2005 Free Software Foundation, Inc. | |
7 | ||
8 | This file is part of GCC. | |
9 | ||
10 | GCC is free software; you can redistribute it and/or modify it under | |
11 | the terms of the GNU General Public License as published by the Free | |
12 | Software Foundation; either version 2, or (at your option) any later | |
13 | version. | |
14 | ||
15 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
16 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
17 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
18 | for more details. | |
19 | ||
20 | You should have received a copy of the GNU General Public License | |
21 | along with GCC; see the file COPYING. If not, write to the Free | |
22 | Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA | |
23 | 02110-1301, USA. */ | |
24 | ||
25 | #include "config.h" | |
26 | #include "system.h" | |
27 | #include "coretypes.h" | |
28 | #include "tm.h" | |
29 | #include "tree.h" | |
30 | #include "rtl.h" | |
31 | #include "tree-gimple.h" | |
32 | #include "tree-inline.h" | |
33 | #include "langhooks.h" | |
34 | #include "diagnostic.h" | |
35 | #include "tree-flow.h" | |
36 | #include "timevar.h" | |
37 | #include "flags.h" | |
38 | #include "function.h" | |
39 | #include "expr.h" | |
40 | #include "toplev.h" | |
41 | #include "tree-pass.h" | |
42 | #include "ggc.h" | |
43 | #include "except.h" | |
44 | ||
45 | ||
46 | /* Lowering of OpenMP parallel and workshare constructs proceeds in two | |
47 | phases. The first phase scans the function looking for OMP statements | |
48 | and then for variables that must be replaced to satisfy data sharing | |
49 | clauses. The second phase expands code for the constructs, as well as | |
50 | re-gimplifing things when variables have been replaced with complex | |
51 | expressions. | |
52 | ||
7ebaeab5 DN |
53 | Final code generation is done by pass_expand_omp. The flowgraph is |
54 | scanned for parallel regions which are then moved to a new | |
55 | function, to be invoked by the thread library. */ | |
953ff289 | 56 | |
50674e96 DN |
57 | /* Parallel region information. Every parallel and workshare |
58 | directive is enclosed between two markers, the OMP_* directive | |
59 | and a corresponding OMP_RETURN_EXPR statement. */ | |
60 | ||
61 | struct omp_region GTY(()) | |
62 | { | |
63 | /* The enclosing region. */ | |
64 | struct omp_region *outer; | |
65 | ||
66 | /* First child region. */ | |
67 | struct omp_region *inner; | |
68 | ||
69 | /* Next peer region. */ | |
70 | struct omp_region *next; | |
71 | ||
72 | /* Entry point to this region. */ | |
73 | tree entry; | |
74 | ||
75 | /* Exit label from this region. */ | |
76 | tree exit; | |
77 | ||
78 | /* Region number. */ | |
79 | int num; | |
80 | ||
81 | /* True if this is a combined parallel+workshare region. */ | |
82 | bool is_combined_parallel; | |
83 | ||
84 | /* If this is a combined parallel+workshare region, this is a list | |
85 | of additional arguments needed by the combined parallel+workshare | |
86 | library call. */ | |
87 | tree ws_args; | |
88 | }; | |
89 | ||
90 | ||
953ff289 DN |
91 | /* Context structure. Used to store information about each parallel |
92 | directive in the code. */ | |
93 | ||
94 | typedef struct omp_context | |
95 | { | |
96 | /* This field must be at the beginning, as we do "inheritance": Some | |
97 | callback functions for tree-inline.c (e.g., omp_copy_decl) | |
98 | receive a copy_body_data pointer that is up-casted to an | |
99 | omp_context pointer. */ | |
100 | copy_body_data cb; | |
101 | ||
102 | /* The tree of contexts corresponding to the encountered constructs. */ | |
103 | struct omp_context *outer; | |
104 | tree stmt; | |
105 | ||
106 | /* Map variables to fields in a structure that allows communication | |
107 | between sending and receiving threads. */ | |
108 | splay_tree field_map; | |
109 | tree record_type; | |
110 | tree sender_decl; | |
111 | tree receiver_decl; | |
112 | ||
113 | /* A chain of variables to add to the top-level block surrounding the | |
114 | construct. In the case of a parallel, this is in the child function. */ | |
115 | tree block_vars; | |
116 | ||
117 | /* What to do with variables with implicitly determined sharing | |
118 | attributes. */ | |
119 | enum omp_clause_default_kind default_kind; | |
120 | ||
121 | /* Nesting depth of this context. Used to beautify error messages re | |
122 | invalid gotos. The outermost ctx is depth 1, with depth 0 being | |
123 | reserved for the main body of the function. */ | |
124 | int depth; | |
125 | ||
953ff289 DN |
126 | /* True if this parallel directive is nested within another. */ |
127 | bool is_nested; | |
953ff289 DN |
128 | } omp_context; |
129 | ||
130 | ||
50674e96 | 131 | /* A structure describing the main elements of a parallel loop. */ |
953ff289 | 132 | |
50674e96 | 133 | struct omp_for_data |
953ff289 DN |
134 | { |
135 | tree v, n1, n2, step, chunk_size, for_stmt; | |
136 | enum tree_code cond_code; | |
137 | tree pre; | |
953ff289 DN |
138 | bool have_nowait, have_ordered; |
139 | enum omp_clause_schedule_kind sched_kind; | |
140 | }; | |
141 | ||
50674e96 | 142 | |
953ff289 DN |
143 | static splay_tree all_contexts; |
144 | static int parallel_nesting_level; | |
50674e96 DN |
145 | static splay_tree omp_regions; |
146 | static struct omp_region *root_omp_region; | |
953ff289 DN |
147 | |
148 | static void scan_omp (tree *, omp_context *); | |
50674e96 | 149 | static void lower_omp (tree *, omp_context *); |
953ff289 DN |
150 | |
151 | /* Find an OpenMP clause of type KIND within CLAUSES. */ | |
152 | ||
50674e96 | 153 | static tree |
953ff289 DN |
154 | find_omp_clause (tree clauses, enum tree_code kind) |
155 | { | |
156 | for (; clauses ; clauses = OMP_CLAUSE_CHAIN (clauses)) | |
aaf46ef9 | 157 | if (OMP_CLAUSE_CODE (clauses) == kind) |
953ff289 DN |
158 | return clauses; |
159 | ||
160 | return NULL_TREE; | |
161 | } | |
162 | ||
163 | /* Return true if CTX is for an omp parallel. */ | |
164 | ||
165 | static inline bool | |
166 | is_parallel_ctx (omp_context *ctx) | |
167 | { | |
50674e96 | 168 | return TREE_CODE (ctx->stmt) == OMP_PARALLEL; |
953ff289 DN |
169 | } |
170 | ||
50674e96 DN |
171 | |
172 | /* Return true if REGION is a combined parallel+workshare region. */ | |
953ff289 DN |
173 | |
174 | static inline bool | |
50674e96 DN |
175 | is_combined_parallel (struct omp_region *region) |
176 | { | |
177 | return region->is_combined_parallel; | |
178 | } | |
179 | ||
180 | ||
181 | /* Extract the header elements of parallel loop FOR_STMT and store | |
182 | them into *FD. */ | |
183 | ||
184 | static void | |
185 | extract_omp_for_data (tree for_stmt, struct omp_for_data *fd) | |
186 | { | |
187 | tree t; | |
188 | ||
189 | fd->for_stmt = for_stmt; | |
190 | fd->pre = NULL; | |
191 | ||
192 | t = OMP_FOR_INIT (for_stmt); | |
193 | gcc_assert (TREE_CODE (t) == MODIFY_EXPR); | |
194 | fd->v = TREE_OPERAND (t, 0); | |
195 | gcc_assert (DECL_P (fd->v)); | |
196 | gcc_assert (TREE_CODE (TREE_TYPE (fd->v)) == INTEGER_TYPE); | |
197 | fd->n1 = TREE_OPERAND (t, 1); | |
198 | ||
199 | t = OMP_FOR_COND (for_stmt); | |
200 | fd->cond_code = TREE_CODE (t); | |
201 | gcc_assert (TREE_OPERAND (t, 0) == fd->v); | |
202 | fd->n2 = TREE_OPERAND (t, 1); | |
203 | switch (fd->cond_code) | |
204 | { | |
205 | case LT_EXPR: | |
206 | case GT_EXPR: | |
207 | break; | |
208 | case LE_EXPR: | |
209 | fd->n2 = fold_build2 (PLUS_EXPR, TREE_TYPE (fd->n2), fd->n2, | |
210 | build_int_cst (TREE_TYPE (fd->n2), 1)); | |
211 | fd->cond_code = LT_EXPR; | |
212 | break; | |
213 | case GE_EXPR: | |
214 | fd->n2 = fold_build2 (MINUS_EXPR, TREE_TYPE (fd->n2), fd->n2, | |
215 | build_int_cst (TREE_TYPE (fd->n2), 1)); | |
216 | fd->cond_code = GT_EXPR; | |
217 | break; | |
218 | default: | |
219 | gcc_unreachable (); | |
220 | } | |
221 | ||
222 | t = OMP_FOR_INCR (fd->for_stmt); | |
223 | gcc_assert (TREE_CODE (t) == MODIFY_EXPR); | |
224 | gcc_assert (TREE_OPERAND (t, 0) == fd->v); | |
225 | t = TREE_OPERAND (t, 1); | |
226 | gcc_assert (TREE_OPERAND (t, 0) == fd->v); | |
227 | switch (TREE_CODE (t)) | |
228 | { | |
229 | case PLUS_EXPR: | |
230 | fd->step = TREE_OPERAND (t, 1); | |
231 | break; | |
232 | case MINUS_EXPR: | |
233 | fd->step = TREE_OPERAND (t, 1); | |
234 | fd->step = fold_build1 (NEGATE_EXPR, TREE_TYPE (fd->step), fd->step); | |
235 | break; | |
236 | default: | |
237 | gcc_unreachable (); | |
238 | } | |
239 | ||
240 | fd->have_nowait = fd->have_ordered = false; | |
241 | fd->sched_kind = OMP_CLAUSE_SCHEDULE_STATIC; | |
242 | fd->chunk_size = NULL_TREE; | |
243 | ||
244 | for (t = OMP_FOR_CLAUSES (for_stmt); t ; t = OMP_CLAUSE_CHAIN (t)) | |
aaf46ef9 | 245 | switch (OMP_CLAUSE_CODE (t)) |
50674e96 DN |
246 | { |
247 | case OMP_CLAUSE_NOWAIT: | |
248 | fd->have_nowait = true; | |
249 | break; | |
250 | case OMP_CLAUSE_ORDERED: | |
251 | fd->have_ordered = true; | |
252 | break; | |
253 | case OMP_CLAUSE_SCHEDULE: | |
254 | fd->sched_kind = OMP_CLAUSE_SCHEDULE_KIND (t); | |
255 | fd->chunk_size = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (t); | |
256 | break; | |
257 | default: | |
258 | break; | |
259 | } | |
260 | ||
261 | if (fd->sched_kind == OMP_CLAUSE_SCHEDULE_RUNTIME) | |
262 | gcc_assert (fd->chunk_size == NULL); | |
263 | else if (fd->chunk_size == NULL) | |
264 | { | |
265 | /* We only need to compute a default chunk size for ordered | |
266 | static loops and dynamic loops. */ | |
267 | if (fd->sched_kind != OMP_CLAUSE_SCHEDULE_STATIC || fd->have_ordered) | |
268 | fd->chunk_size = (fd->sched_kind == OMP_CLAUSE_SCHEDULE_STATIC) | |
269 | ? integer_zero_node : integer_one_node; | |
270 | } | |
271 | } | |
272 | ||
273 | ||
274 | /* Given two blocks PAR_ENTRY_BB and WS_ENTRY_BB such that WS_ENTRY_BB | |
275 | is the immediate dominator of PAR_ENTRY_BB, return true if there | |
276 | are no data dependencies that would prevent expanding the parallel | |
277 | directive at PAR_ENTRY_BB as a combined parallel+workshare region. | |
278 | ||
279 | When expanding a combined parallel+workshare region, the call to | |
280 | the child function may need additional arguments in the case of | |
281 | OMP_FOR regions. In some cases, these arguments are computed out | |
282 | of variables passed in from the parent to the child via 'struct | |
283 | .omp_data_s'. For instance: | |
284 | ||
285 | #pragma omp parallel for schedule (guided, i * 4) | |
286 | for (j ...) | |
287 | ||
288 | Is lowered into: | |
289 | ||
290 | # BLOCK 2 (PAR_ENTRY_BB) | |
291 | .omp_data_o.i = i; | |
292 | #pragma omp parallel [child fn: bar.omp_fn.0 ( ..., D.1598) | |
293 | ||
294 | # BLOCK 3 (WS_ENTRY_BB) | |
295 | .omp_data_i = &.omp_data_o; | |
296 | D.1667 = .omp_data_i->i; | |
297 | D.1598 = D.1667 * 4; | |
298 | #pragma omp for schedule (guided, D.1598) | |
299 | ||
300 | When we outline the parallel region, the call to the child function | |
301 | 'bar.omp_fn.0' will need the value D.1598 in its argument list, but | |
302 | that value is computed *after* the call site. So, in principle we | |
303 | cannot do the transformation. | |
304 | ||
305 | To see whether the code in WS_ENTRY_BB blocks the combined | |
306 | parallel+workshare call, we collect all the variables used in the | |
307 | OMP_FOR header check whether they appear on the LHS of any | |
308 | statement in WS_ENTRY_BB. If so, then we cannot emit the combined | |
309 | call. | |
310 | ||
311 | FIXME. If we had the SSA form built at this point, we could merely | |
312 | hoist the code in block 3 into block 2 and be done with it. But at | |
313 | this point we don't have dataflow information and though we could | |
314 | hack something up here, it is really not worth the aggravation. */ | |
315 | ||
316 | static bool | |
317 | workshare_safe_to_combine_p (basic_block par_entry_bb, basic_block ws_entry_bb) | |
318 | { | |
319 | struct omp_for_data fd; | |
320 | tree par_stmt, ws_stmt; | |
321 | ||
322 | par_stmt = last_stmt (par_entry_bb); | |
323 | ws_stmt = last_stmt (ws_entry_bb); | |
324 | ||
325 | if (TREE_CODE (ws_stmt) == OMP_SECTIONS) | |
326 | return true; | |
327 | ||
328 | gcc_assert (TREE_CODE (ws_stmt) == OMP_FOR); | |
329 | ||
330 | extract_omp_for_data (ws_stmt, &fd); | |
331 | ||
332 | /* FIXME. We give up too easily here. If any of these arguments | |
333 | are not constants, they will likely involve variables that have | |
334 | been mapped into fields of .omp_data_s for sharing with the child | |
335 | function. With appropriate data flow, it would be possible to | |
336 | see through this. */ | |
337 | if (!is_gimple_min_invariant (fd.n1) | |
338 | || !is_gimple_min_invariant (fd.n2) | |
339 | || !is_gimple_min_invariant (fd.step) | |
340 | || (fd.chunk_size && !is_gimple_min_invariant (fd.chunk_size))) | |
341 | return false; | |
342 | ||
343 | return true; | |
344 | } | |
345 | ||
346 | ||
347 | /* Collect additional arguments needed to emit a combined | |
348 | parallel+workshare call. WS_STMT is the workshare directive being | |
349 | expanded. */ | |
350 | ||
351 | static tree | |
352 | get_ws_args_for (tree ws_stmt) | |
353 | { | |
354 | tree t; | |
355 | ||
356 | if (TREE_CODE (ws_stmt) == OMP_FOR) | |
357 | { | |
358 | struct omp_for_data fd; | |
359 | tree ws_args; | |
360 | ||
361 | extract_omp_for_data (ws_stmt, &fd); | |
362 | ||
363 | ws_args = NULL_TREE; | |
364 | if (fd.chunk_size) | |
365 | { | |
366 | t = fold_convert (long_integer_type_node, fd.chunk_size); | |
367 | ws_args = tree_cons (NULL, t, ws_args); | |
368 | } | |
369 | ||
370 | t = fold_convert (long_integer_type_node, fd.step); | |
371 | ws_args = tree_cons (NULL, t, ws_args); | |
372 | ||
373 | t = fold_convert (long_integer_type_node, fd.n2); | |
374 | ws_args = tree_cons (NULL, t, ws_args); | |
375 | ||
376 | t = fold_convert (long_integer_type_node, fd.n1); | |
377 | ws_args = tree_cons (NULL, t, ws_args); | |
378 | ||
379 | return ws_args; | |
380 | } | |
381 | else if (TREE_CODE (ws_stmt) == OMP_SECTIONS) | |
382 | { | |
383 | basic_block bb = bb_for_stmt (ws_stmt); | |
384 | t = build_int_cst (unsigned_type_node, EDGE_COUNT (bb->succs)); | |
385 | t = tree_cons (NULL, t, NULL); | |
386 | return t; | |
387 | } | |
388 | ||
389 | gcc_unreachable (); | |
390 | } | |
391 | ||
392 | ||
393 | /* Discover whether REGION is a combined parallel+workshare region. */ | |
394 | ||
395 | static void | |
396 | determine_parallel_type (struct omp_region *region) | |
953ff289 | 397 | { |
50674e96 DN |
398 | basic_block par_entry_bb, par_exit_bb; |
399 | basic_block ws_entry_bb, ws_exit_bb; | |
400 | ||
401 | if (region == NULL || region->inner == NULL) | |
402 | return; | |
403 | ||
404 | /* We only support parallel+for and parallel+sections. */ | |
405 | if (TREE_CODE (region->entry) != OMP_PARALLEL | |
406 | || (TREE_CODE (region->inner->entry) != OMP_FOR | |
407 | && TREE_CODE (region->inner->entry) != OMP_SECTIONS)) | |
408 | return; | |
409 | ||
410 | /* Check for perfect nesting PAR_ENTRY_BB -> WS_ENTRY_BB and | |
411 | WS_EXIT_BB -> PAR_EXIT_BB. */ | |
412 | par_entry_bb = bb_for_stmt (region->entry); | |
413 | par_exit_bb = bb_for_stmt (region->exit); | |
414 | ||
415 | ws_entry_bb = bb_for_stmt (region->inner->entry); | |
416 | ws_exit_bb = bb_for_stmt (region->inner->exit); | |
417 | ||
418 | if (single_succ (par_entry_bb) == ws_entry_bb | |
419 | && single_succ (ws_exit_bb) == par_exit_bb | |
420 | && workshare_safe_to_combine_p (par_entry_bb, ws_entry_bb)) | |
421 | { | |
422 | if (TREE_CODE (region->inner->entry) == OMP_FOR) | |
423 | { | |
424 | /* If this is a combined parallel loop, we need to determine | |
425 | whether or not to use the combined library calls. There | |
426 | are two cases where we do not apply the transformation: | |
427 | static loops and any kind of ordered loop. In the first | |
428 | case, we already open code the loop so there is no need | |
429 | to do anything else. In the latter case, the combined | |
430 | parallel loop call would still need extra synchronization | |
431 | to implement ordered semantics, so there would not be any | |
432 | gain in using the combined call. */ | |
433 | tree clauses = OMP_FOR_CLAUSES (region->inner->entry); | |
434 | tree c = find_omp_clause (clauses, OMP_CLAUSE_SCHEDULE); | |
435 | if (c == NULL | |
436 | || OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_STATIC | |
437 | || find_omp_clause (clauses, OMP_CLAUSE_ORDERED)) | |
438 | { | |
439 | region->is_combined_parallel = false; | |
440 | region->inner->is_combined_parallel = false; | |
441 | return; | |
442 | } | |
443 | } | |
444 | ||
445 | region->is_combined_parallel = true; | |
446 | region->inner->is_combined_parallel = true; | |
447 | region->ws_args = get_ws_args_for (region->inner->entry); | |
448 | } | |
953ff289 DN |
449 | } |
450 | ||
50674e96 | 451 | |
953ff289 DN |
452 | /* Return true if EXPR is variable sized. */ |
453 | ||
454 | static inline bool | |
455 | is_variable_sized (tree expr) | |
456 | { | |
457 | return !TREE_CONSTANT (TYPE_SIZE_UNIT (TREE_TYPE (expr))); | |
458 | } | |
459 | ||
460 | /* Return true if DECL is a reference type. */ | |
461 | ||
462 | static inline bool | |
463 | is_reference (tree decl) | |
464 | { | |
465 | return lang_hooks.decls.omp_privatize_by_reference (decl); | |
466 | } | |
467 | ||
468 | /* Lookup variables in the decl or field splay trees. The "maybe" form | |
469 | allows for the variable form to not have been entered, otherwise we | |
470 | assert that the variable must have been entered. */ | |
471 | ||
472 | static inline tree | |
473 | lookup_decl (tree var, omp_context *ctx) | |
474 | { | |
475 | splay_tree_node n; | |
476 | n = splay_tree_lookup (ctx->cb.decl_map, (splay_tree_key) var); | |
477 | return (tree) n->value; | |
478 | } | |
479 | ||
480 | static inline tree | |
481 | maybe_lookup_decl (tree var, omp_context *ctx) | |
482 | { | |
483 | splay_tree_node n; | |
484 | n = splay_tree_lookup (ctx->cb.decl_map, (splay_tree_key) var); | |
485 | return n ? (tree) n->value : NULL_TREE; | |
486 | } | |
487 | ||
488 | static inline tree | |
489 | lookup_field (tree var, omp_context *ctx) | |
490 | { | |
491 | splay_tree_node n; | |
492 | n = splay_tree_lookup (ctx->field_map, (splay_tree_key) var); | |
493 | return (tree) n->value; | |
494 | } | |
495 | ||
496 | static inline tree | |
497 | maybe_lookup_field (tree var, omp_context *ctx) | |
498 | { | |
499 | splay_tree_node n; | |
500 | n = splay_tree_lookup (ctx->field_map, (splay_tree_key) var); | |
501 | return n ? (tree) n->value : NULL_TREE; | |
502 | } | |
503 | ||
504 | /* Return true if DECL should be copied by pointer. SHARED_P is true | |
505 | if DECL is to be shared. */ | |
506 | ||
507 | static bool | |
508 | use_pointer_for_field (tree decl, bool shared_p) | |
509 | { | |
510 | if (AGGREGATE_TYPE_P (TREE_TYPE (decl))) | |
511 | return true; | |
512 | ||
513 | /* We can only use copy-in/copy-out semantics for shared varibles | |
514 | when we know the value is not accessible from an outer scope. */ | |
515 | if (shared_p) | |
516 | { | |
517 | /* ??? Trivially accessible from anywhere. But why would we even | |
518 | be passing an address in this case? Should we simply assert | |
519 | this to be false, or should we have a cleanup pass that removes | |
520 | these from the list of mappings? */ | |
521 | if (TREE_STATIC (decl) || DECL_EXTERNAL (decl)) | |
522 | return true; | |
523 | ||
524 | /* For variables with DECL_HAS_VALUE_EXPR_P set, we cannot tell | |
525 | without analyzing the expression whether or not its location | |
526 | is accessible to anyone else. In the case of nested parallel | |
527 | regions it certainly may be. */ | |
528 | if (DECL_HAS_VALUE_EXPR_P (decl)) | |
529 | return true; | |
530 | ||
531 | /* Do not use copy-in/copy-out for variables that have their | |
532 | address taken. */ | |
533 | if (TREE_ADDRESSABLE (decl)) | |
534 | return true; | |
535 | } | |
536 | ||
537 | return false; | |
538 | } | |
539 | ||
540 | /* Construct a new automatic decl similar to VAR. */ | |
541 | ||
542 | static tree | |
543 | omp_copy_decl_2 (tree var, tree name, tree type, omp_context *ctx) | |
544 | { | |
545 | tree copy = build_decl (VAR_DECL, name, type); | |
546 | ||
547 | TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (var); | |
548 | DECL_COMPLEX_GIMPLE_REG_P (copy) = DECL_COMPLEX_GIMPLE_REG_P (var); | |
549 | DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (var); | |
550 | DECL_IGNORED_P (copy) = DECL_IGNORED_P (var); | |
551 | TREE_USED (copy) = 1; | |
50674e96 | 552 | DECL_CONTEXT (copy) = current_function_decl; |
953ff289 DN |
553 | DECL_SEEN_IN_BIND_EXPR_P (copy) = 1; |
554 | ||
555 | TREE_CHAIN (copy) = ctx->block_vars; | |
556 | ctx->block_vars = copy; | |
557 | ||
558 | return copy; | |
559 | } | |
560 | ||
561 | static tree | |
562 | omp_copy_decl_1 (tree var, omp_context *ctx) | |
563 | { | |
564 | return omp_copy_decl_2 (var, DECL_NAME (var), TREE_TYPE (var), ctx); | |
565 | } | |
566 | ||
567 | /* Build tree nodes to access the field for VAR on the receiver side. */ | |
568 | ||
569 | static tree | |
570 | build_receiver_ref (tree var, bool by_ref, omp_context *ctx) | |
571 | { | |
572 | tree x, field = lookup_field (var, ctx); | |
573 | ||
574 | /* If the receiver record type was remapped in the child function, | |
575 | remap the field into the new record type. */ | |
576 | x = maybe_lookup_field (field, ctx); | |
577 | if (x != NULL) | |
578 | field = x; | |
579 | ||
580 | x = build_fold_indirect_ref (ctx->receiver_decl); | |
581 | x = build3 (COMPONENT_REF, TREE_TYPE (field), x, field, NULL); | |
582 | if (by_ref) | |
583 | x = build_fold_indirect_ref (x); | |
584 | ||
585 | return x; | |
586 | } | |
587 | ||
588 | /* Build tree nodes to access VAR in the scope outer to CTX. In the case | |
589 | of a parallel, this is a component reference; for workshare constructs | |
590 | this is some variable. */ | |
591 | ||
592 | static tree | |
593 | build_outer_var_ref (tree var, omp_context *ctx) | |
594 | { | |
595 | tree x; | |
596 | ||
597 | if (is_global_var (var)) | |
598 | x = var; | |
599 | else if (is_variable_sized (var)) | |
600 | { | |
601 | x = TREE_OPERAND (DECL_VALUE_EXPR (var), 0); | |
602 | x = build_outer_var_ref (x, ctx); | |
603 | x = build_fold_indirect_ref (x); | |
604 | } | |
605 | else if (is_parallel_ctx (ctx)) | |
606 | { | |
607 | bool by_ref = use_pointer_for_field (var, false); | |
608 | x = build_receiver_ref (var, by_ref, ctx); | |
609 | } | |
610 | else if (ctx->outer) | |
611 | x = lookup_decl (var, ctx->outer); | |
612 | else | |
613 | gcc_unreachable (); | |
614 | ||
615 | if (is_reference (var)) | |
616 | x = build_fold_indirect_ref (x); | |
617 | ||
618 | return x; | |
619 | } | |
620 | ||
621 | /* Build tree nodes to access the field for VAR on the sender side. */ | |
622 | ||
623 | static tree | |
624 | build_sender_ref (tree var, omp_context *ctx) | |
625 | { | |
626 | tree field = lookup_field (var, ctx); | |
627 | return build3 (COMPONENT_REF, TREE_TYPE (field), | |
628 | ctx->sender_decl, field, NULL); | |
629 | } | |
630 | ||
631 | /* Add a new field for VAR inside the structure CTX->SENDER_DECL. */ | |
632 | ||
633 | static void | |
634 | install_var_field (tree var, bool by_ref, omp_context *ctx) | |
635 | { | |
636 | tree field, type; | |
637 | ||
638 | gcc_assert (!splay_tree_lookup (ctx->field_map, (splay_tree_key) var)); | |
639 | ||
640 | type = TREE_TYPE (var); | |
641 | if (by_ref) | |
642 | type = build_pointer_type (type); | |
643 | ||
644 | field = build_decl (FIELD_DECL, DECL_NAME (var), type); | |
645 | ||
646 | /* Remember what variable this field was created for. This does have a | |
647 | side effect of making dwarf2out ignore this member, so for helpful | |
648 | debugging we clear it later in delete_omp_context. */ | |
649 | DECL_ABSTRACT_ORIGIN (field) = var; | |
650 | ||
651 | insert_field_into_struct (ctx->record_type, field); | |
652 | ||
653 | splay_tree_insert (ctx->field_map, (splay_tree_key) var, | |
654 | (splay_tree_value) field); | |
655 | } | |
656 | ||
657 | static tree | |
658 | install_var_local (tree var, omp_context *ctx) | |
659 | { | |
660 | tree new_var = omp_copy_decl_1 (var, ctx); | |
661 | insert_decl_map (&ctx->cb, var, new_var); | |
662 | return new_var; | |
663 | } | |
664 | ||
665 | /* Adjust the replacement for DECL in CTX for the new context. This means | |
666 | copying the DECL_VALUE_EXPR, and fixing up the type. */ | |
667 | ||
668 | static void | |
669 | fixup_remapped_decl (tree decl, omp_context *ctx, bool private_debug) | |
670 | { | |
671 | tree new_decl, size; | |
672 | ||
673 | new_decl = lookup_decl (decl, ctx); | |
674 | ||
675 | TREE_TYPE (new_decl) = remap_type (TREE_TYPE (decl), &ctx->cb); | |
676 | ||
677 | if ((!TREE_CONSTANT (DECL_SIZE (new_decl)) || private_debug) | |
678 | && DECL_HAS_VALUE_EXPR_P (decl)) | |
679 | { | |
680 | tree ve = DECL_VALUE_EXPR (decl); | |
681 | walk_tree (&ve, copy_body_r, &ctx->cb, NULL); | |
682 | SET_DECL_VALUE_EXPR (new_decl, ve); | |
683 | DECL_HAS_VALUE_EXPR_P (new_decl) = 1; | |
684 | } | |
685 | ||
686 | if (!TREE_CONSTANT (DECL_SIZE (new_decl))) | |
687 | { | |
688 | size = remap_decl (DECL_SIZE (decl), &ctx->cb); | |
689 | if (size == error_mark_node) | |
690 | size = TYPE_SIZE (TREE_TYPE (new_decl)); | |
691 | DECL_SIZE (new_decl) = size; | |
692 | ||
693 | size = remap_decl (DECL_SIZE_UNIT (decl), &ctx->cb); | |
694 | if (size == error_mark_node) | |
695 | size = TYPE_SIZE_UNIT (TREE_TYPE (new_decl)); | |
696 | DECL_SIZE_UNIT (new_decl) = size; | |
697 | } | |
698 | } | |
699 | ||
700 | /* The callback for remap_decl. Search all containing contexts for a | |
701 | mapping of the variable; this avoids having to duplicate the splay | |
702 | tree ahead of time. We know a mapping doesn't already exist in the | |
703 | given context. Create new mappings to implement default semantics. */ | |
704 | ||
705 | static tree | |
706 | omp_copy_decl (tree var, copy_body_data *cb) | |
707 | { | |
708 | omp_context *ctx = (omp_context *) cb; | |
709 | tree new_var; | |
710 | ||
711 | if (is_global_var (var) || decl_function_context (var) != ctx->cb.src_fn) | |
712 | return var; | |
713 | ||
714 | if (TREE_CODE (var) == LABEL_DECL) | |
715 | { | |
716 | new_var = create_artificial_label (); | |
50674e96 | 717 | DECL_CONTEXT (new_var) = current_function_decl; |
953ff289 DN |
718 | insert_decl_map (&ctx->cb, var, new_var); |
719 | return new_var; | |
720 | } | |
721 | ||
722 | while (!is_parallel_ctx (ctx)) | |
723 | { | |
724 | ctx = ctx->outer; | |
725 | if (ctx == NULL) | |
726 | return var; | |
727 | new_var = maybe_lookup_decl (var, ctx); | |
728 | if (new_var) | |
729 | return new_var; | |
730 | } | |
731 | ||
732 | return error_mark_node; | |
733 | } | |
734 | ||
50674e96 DN |
735 | |
736 | /* Return the parallel region associated with STMT. */ | |
737 | ||
738 | static inline struct omp_region * | |
739 | lookup_omp_region (tree stmt) | |
740 | { | |
741 | splay_tree_node n = splay_tree_lookup (omp_regions, (splay_tree_key) stmt); | |
742 | return n ? (struct omp_region *) n->value : NULL; | |
743 | } | |
744 | ||
745 | ||
746 | /* Debugging dumps for parallel regions. */ | |
747 | void dump_omp_region (FILE *, struct omp_region *, int); | |
748 | void debug_omp_region (struct omp_region *); | |
749 | void debug_all_omp_regions (void); | |
750 | ||
751 | /* Dump the parallel region tree rooted at REGION. */ | |
752 | ||
753 | void | |
754 | dump_omp_region (FILE *file, struct omp_region *region, int indent) | |
755 | { | |
756 | fprintf (file, "%*s", indent, ""); | |
757 | print_generic_stmt (file, region->entry, TDF_SLIM); | |
758 | ||
759 | if (region->inner) | |
760 | dump_omp_region (file, region->inner, indent + 4); | |
761 | ||
762 | fprintf (file, "%*s", indent, ""); | |
763 | if (region->exit) | |
764 | print_generic_stmt (file, region->exit, 0); | |
765 | else | |
766 | fprintf (file, "[no exit marker]\n"); | |
767 | ||
768 | if (region->next) | |
769 | { | |
770 | fprintf (file, "\n"); | |
771 | dump_omp_region (file, region->next, indent); | |
772 | } | |
773 | } | |
774 | ||
775 | void | |
776 | debug_omp_region (struct omp_region *region) | |
777 | { | |
778 | dump_omp_region (stderr, region, 0); | |
779 | } | |
780 | ||
781 | void | |
782 | debug_all_omp_regions (void) | |
783 | { | |
784 | dump_omp_region (stderr, root_omp_region, 0); | |
785 | } | |
786 | ||
787 | ||
788 | /* Create a new parallel region starting at STMT inside region PARENT. */ | |
789 | ||
790 | static struct omp_region * | |
791 | new_omp_region (tree stmt, struct omp_region *parent) | |
792 | { | |
793 | struct omp_region *region = ggc_alloc_cleared (sizeof (*region)); | |
794 | static int num = 0; | |
795 | ||
796 | region->outer = parent; | |
797 | region->entry = stmt; | |
798 | region->num = num++; | |
799 | ||
800 | if (parent) | |
801 | { | |
802 | /* This is a nested region. Add it to the list of inner | |
803 | regions in PARENT. */ | |
804 | region->next = parent->inner; | |
805 | parent->inner = region; | |
806 | } | |
807 | else if (omp_regions) | |
808 | { | |
809 | /* This is a toplevel region. Add it to the list of toplevel | |
810 | regions in ROOT_OMP_REGION. */ | |
811 | region->next = root_omp_region; | |
812 | root_omp_region = region; | |
813 | } | |
814 | else | |
815 | { | |
816 | /* Create a new root region with the first region we find. */ | |
817 | root_omp_region = region; | |
818 | omp_regions = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
819 | } | |
820 | ||
821 | splay_tree_insert (omp_regions, (splay_tree_key) stmt, | |
822 | (splay_tree_value) region); | |
823 | ||
824 | return region; | |
825 | } | |
826 | ||
827 | ||
953ff289 DN |
828 | /* Create a new context, with OUTER_CTX being the surrounding context. */ |
829 | ||
830 | static omp_context * | |
831 | new_omp_context (tree stmt, omp_context *outer_ctx) | |
832 | { | |
833 | omp_context *ctx = XCNEW (omp_context); | |
834 | ||
835 | splay_tree_insert (all_contexts, (splay_tree_key) stmt, | |
836 | (splay_tree_value) ctx); | |
837 | ctx->stmt = stmt; | |
838 | ||
839 | if (outer_ctx) | |
840 | { | |
841 | ctx->outer = outer_ctx; | |
842 | ctx->cb = outer_ctx->cb; | |
843 | ctx->cb.block = NULL; | |
844 | ctx->depth = outer_ctx->depth + 1; | |
845 | } | |
846 | else | |
847 | { | |
848 | ctx->cb.src_fn = current_function_decl; | |
849 | ctx->cb.dst_fn = current_function_decl; | |
850 | ctx->cb.src_node = cgraph_node (current_function_decl); | |
851 | ctx->cb.dst_node = ctx->cb.src_node; | |
852 | ctx->cb.src_cfun = cfun; | |
853 | ctx->cb.copy_decl = omp_copy_decl; | |
854 | ctx->cb.eh_region = -1; | |
855 | ctx->cb.transform_call_graph_edges = CB_CGE_MOVE; | |
856 | ctx->depth = 1; | |
857 | } | |
858 | ||
859 | ctx->cb.decl_map = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
860 | ||
861 | return ctx; | |
862 | } | |
863 | ||
864 | /* Destroy a omp_context data structures. Called through the splay tree | |
865 | value delete callback. */ | |
866 | ||
867 | static void | |
868 | delete_omp_context (splay_tree_value value) | |
869 | { | |
870 | omp_context *ctx = (omp_context *) value; | |
871 | ||
872 | splay_tree_delete (ctx->cb.decl_map); | |
873 | ||
874 | if (ctx->field_map) | |
875 | splay_tree_delete (ctx->field_map); | |
876 | ||
877 | /* We hijacked DECL_ABSTRACT_ORIGIN earlier. We need to clear it before | |
878 | it produces corrupt debug information. */ | |
879 | if (ctx->record_type) | |
880 | { | |
881 | tree t; | |
882 | for (t = TYPE_FIELDS (ctx->record_type); t ; t = TREE_CHAIN (t)) | |
883 | DECL_ABSTRACT_ORIGIN (t) = NULL; | |
884 | } | |
885 | ||
886 | XDELETE (ctx); | |
887 | } | |
888 | ||
889 | /* Fix up RECEIVER_DECL with a type that has been remapped to the child | |
890 | context. */ | |
891 | ||
892 | static void | |
893 | fixup_child_record_type (omp_context *ctx) | |
894 | { | |
895 | tree f, type = ctx->record_type; | |
896 | ||
897 | /* ??? It isn't sufficient to just call remap_type here, because | |
898 | variably_modified_type_p doesn't work the way we expect for | |
899 | record types. Testing each field for whether it needs remapping | |
900 | and creating a new record by hand works, however. */ | |
901 | for (f = TYPE_FIELDS (type); f ; f = TREE_CHAIN (f)) | |
902 | if (variably_modified_type_p (TREE_TYPE (f), ctx->cb.src_fn)) | |
903 | break; | |
904 | if (f) | |
905 | { | |
906 | tree name, new_fields = NULL; | |
907 | ||
908 | type = lang_hooks.types.make_type (RECORD_TYPE); | |
909 | name = DECL_NAME (TYPE_NAME (ctx->record_type)); | |
910 | name = build_decl (TYPE_DECL, name, type); | |
911 | TYPE_NAME (type) = name; | |
912 | ||
913 | for (f = TYPE_FIELDS (ctx->record_type); f ; f = TREE_CHAIN (f)) | |
914 | { | |
915 | tree new_f = copy_node (f); | |
916 | DECL_CONTEXT (new_f) = type; | |
917 | TREE_TYPE (new_f) = remap_type (TREE_TYPE (f), &ctx->cb); | |
918 | TREE_CHAIN (new_f) = new_fields; | |
919 | new_fields = new_f; | |
920 | ||
921 | /* Arrange to be able to look up the receiver field | |
922 | given the sender field. */ | |
923 | splay_tree_insert (ctx->field_map, (splay_tree_key) f, | |
924 | (splay_tree_value) new_f); | |
925 | } | |
926 | TYPE_FIELDS (type) = nreverse (new_fields); | |
927 | layout_type (type); | |
928 | } | |
929 | ||
930 | TREE_TYPE (ctx->receiver_decl) = build_pointer_type (type); | |
931 | } | |
932 | ||
933 | /* Instantiate decls as necessary in CTX to satisfy the data sharing | |
934 | specified by CLAUSES. */ | |
935 | ||
936 | static void | |
937 | scan_sharing_clauses (tree clauses, omp_context *ctx) | |
938 | { | |
939 | tree c, decl; | |
940 | bool scan_array_reductions = false; | |
941 | ||
942 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
943 | { | |
944 | bool by_ref; | |
945 | ||
aaf46ef9 | 946 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 DN |
947 | { |
948 | case OMP_CLAUSE_PRIVATE: | |
949 | decl = OMP_CLAUSE_DECL (c); | |
950 | if (!is_variable_sized (decl)) | |
951 | install_var_local (decl, ctx); | |
952 | break; | |
953 | ||
954 | case OMP_CLAUSE_SHARED: | |
955 | gcc_assert (is_parallel_ctx (ctx)); | |
956 | decl = OMP_CLAUSE_DECL (c); | |
957 | gcc_assert (!is_variable_sized (decl)); | |
958 | by_ref = use_pointer_for_field (decl, true); | |
959 | if (! TREE_READONLY (decl) | |
960 | || TREE_ADDRESSABLE (decl) | |
961 | || by_ref | |
962 | || is_reference (decl)) | |
963 | { | |
964 | install_var_field (decl, by_ref, ctx); | |
965 | install_var_local (decl, ctx); | |
966 | break; | |
967 | } | |
968 | /* We don't need to copy const scalar vars back. */ | |
aaf46ef9 | 969 | OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_FIRSTPRIVATE); |
953ff289 DN |
970 | goto do_private; |
971 | ||
972 | case OMP_CLAUSE_LASTPRIVATE: | |
973 | /* Let the corresponding firstprivate clause create | |
974 | the variable. */ | |
975 | if (OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)) | |
976 | break; | |
977 | /* FALLTHRU */ | |
978 | ||
979 | case OMP_CLAUSE_FIRSTPRIVATE: | |
980 | case OMP_CLAUSE_REDUCTION: | |
981 | decl = OMP_CLAUSE_DECL (c); | |
982 | do_private: | |
983 | if (is_variable_sized (decl)) | |
984 | break; | |
985 | else if (is_parallel_ctx (ctx)) | |
986 | { | |
987 | by_ref = use_pointer_for_field (decl, false); | |
988 | install_var_field (decl, by_ref, ctx); | |
989 | } | |
990 | install_var_local (decl, ctx); | |
991 | break; | |
992 | ||
993 | case OMP_CLAUSE_COPYPRIVATE: | |
994 | if (ctx->outer) | |
995 | scan_omp (&OMP_CLAUSE_DECL (c), ctx->outer); | |
996 | /* FALLTHRU */ | |
997 | ||
998 | case OMP_CLAUSE_COPYIN: | |
999 | decl = OMP_CLAUSE_DECL (c); | |
1000 | by_ref = use_pointer_for_field (decl, false); | |
1001 | install_var_field (decl, by_ref, ctx); | |
1002 | break; | |
1003 | ||
1004 | case OMP_CLAUSE_DEFAULT: | |
1005 | ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c); | |
1006 | break; | |
1007 | ||
1008 | case OMP_CLAUSE_IF: | |
1009 | case OMP_CLAUSE_NUM_THREADS: | |
1010 | case OMP_CLAUSE_SCHEDULE: | |
1011 | if (ctx->outer) | |
aaf46ef9 | 1012 | scan_omp (&OMP_CLAUSE_OPERAND (c, 0), ctx->outer); |
953ff289 DN |
1013 | break; |
1014 | ||
1015 | case OMP_CLAUSE_NOWAIT: | |
1016 | case OMP_CLAUSE_ORDERED: | |
1017 | break; | |
1018 | ||
1019 | default: | |
1020 | gcc_unreachable (); | |
1021 | } | |
1022 | } | |
1023 | ||
1024 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
1025 | { | |
aaf46ef9 | 1026 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 DN |
1027 | { |
1028 | case OMP_CLAUSE_LASTPRIVATE: | |
1029 | /* Let the corresponding firstprivate clause create | |
1030 | the variable. */ | |
1031 | if (OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)) | |
1032 | break; | |
1033 | /* FALLTHRU */ | |
1034 | ||
1035 | case OMP_CLAUSE_PRIVATE: | |
1036 | case OMP_CLAUSE_FIRSTPRIVATE: | |
1037 | case OMP_CLAUSE_REDUCTION: | |
1038 | decl = OMP_CLAUSE_DECL (c); | |
1039 | if (is_variable_sized (decl)) | |
1040 | install_var_local (decl, ctx); | |
1041 | fixup_remapped_decl (decl, ctx, | |
aaf46ef9 | 1042 | OMP_CLAUSE_CODE (c) == OMP_CLAUSE_PRIVATE |
953ff289 | 1043 | && OMP_CLAUSE_PRIVATE_DEBUG (c)); |
aaf46ef9 | 1044 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION |
953ff289 DN |
1045 | && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) |
1046 | scan_array_reductions = true; | |
1047 | break; | |
1048 | ||
1049 | case OMP_CLAUSE_SHARED: | |
1050 | decl = OMP_CLAUSE_DECL (c); | |
1051 | fixup_remapped_decl (decl, ctx, false); | |
1052 | break; | |
1053 | ||
1054 | case OMP_CLAUSE_COPYPRIVATE: | |
1055 | case OMP_CLAUSE_COPYIN: | |
1056 | case OMP_CLAUSE_DEFAULT: | |
1057 | case OMP_CLAUSE_IF: | |
1058 | case OMP_CLAUSE_NUM_THREADS: | |
1059 | case OMP_CLAUSE_SCHEDULE: | |
1060 | case OMP_CLAUSE_NOWAIT: | |
1061 | case OMP_CLAUSE_ORDERED: | |
1062 | break; | |
1063 | ||
1064 | default: | |
1065 | gcc_unreachable (); | |
1066 | } | |
1067 | } | |
1068 | ||
1069 | if (scan_array_reductions) | |
1070 | for (c = clauses; c; c = OMP_CLAUSE_CHAIN (c)) | |
aaf46ef9 | 1071 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION |
953ff289 DN |
1072 | && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) |
1073 | { | |
1074 | scan_omp (&OMP_CLAUSE_REDUCTION_INIT (c), ctx); | |
1075 | scan_omp (&OMP_CLAUSE_REDUCTION_MERGE (c), ctx); | |
1076 | } | |
1077 | } | |
1078 | ||
1079 | /* Create a new name for omp child function. Returns an identifier. */ | |
1080 | ||
1081 | static GTY(()) unsigned int tmp_ompfn_id_num; | |
1082 | ||
1083 | static tree | |
1084 | create_omp_child_function_name (void) | |
1085 | { | |
1086 | tree name = DECL_ASSEMBLER_NAME (current_function_decl); | |
1087 | size_t len = IDENTIFIER_LENGTH (name); | |
1088 | char *tmp_name, *prefix; | |
1089 | ||
1090 | prefix = alloca (len + sizeof ("_omp_fn")); | |
1091 | memcpy (prefix, IDENTIFIER_POINTER (name), len); | |
1092 | strcpy (prefix + len, "_omp_fn"); | |
1093 | #ifndef NO_DOT_IN_LABEL | |
1094 | prefix[len] = '.'; | |
1095 | #elif !defined NO_DOLLAR_IN_LABEL | |
1096 | prefix[len] = '$'; | |
1097 | #endif | |
1098 | ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix, tmp_ompfn_id_num++); | |
1099 | return get_identifier (tmp_name); | |
1100 | } | |
1101 | ||
1102 | /* Build a decl for the omp child function. It'll not contain a body | |
1103 | yet, just the bare decl. */ | |
1104 | ||
1105 | static void | |
1106 | create_omp_child_function (omp_context *ctx) | |
1107 | { | |
1108 | tree decl, type, name, t; | |
1109 | ||
1110 | name = create_omp_child_function_name (); | |
1111 | type = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE); | |
1112 | ||
1113 | decl = build_decl (FUNCTION_DECL, name, type); | |
1114 | decl = lang_hooks.decls.pushdecl (decl); | |
1115 | ||
1116 | ctx->cb.dst_fn = decl; | |
1117 | ||
1118 | TREE_STATIC (decl) = 1; | |
1119 | TREE_USED (decl) = 1; | |
1120 | DECL_ARTIFICIAL (decl) = 1; | |
1121 | DECL_IGNORED_P (decl) = 0; | |
1122 | TREE_PUBLIC (decl) = 0; | |
1123 | DECL_UNINLINABLE (decl) = 1; | |
1124 | DECL_EXTERNAL (decl) = 0; | |
1125 | DECL_CONTEXT (decl) = NULL_TREE; | |
50674e96 | 1126 | DECL_INITIAL (decl) = make_node (BLOCK); |
953ff289 DN |
1127 | |
1128 | t = build_decl (RESULT_DECL, NULL_TREE, void_type_node); | |
1129 | DECL_ARTIFICIAL (t) = 1; | |
1130 | DECL_IGNORED_P (t) = 1; | |
1131 | DECL_RESULT (decl) = t; | |
1132 | ||
1133 | t = build_decl (PARM_DECL, get_identifier (".omp_data_i"), ptr_type_node); | |
1134 | DECL_ARTIFICIAL (t) = 1; | |
1135 | DECL_ARG_TYPE (t) = ptr_type_node; | |
50674e96 | 1136 | DECL_CONTEXT (t) = current_function_decl; |
953ff289 DN |
1137 | TREE_USED (t) = 1; |
1138 | DECL_ARGUMENTS (decl) = t; | |
1139 | ctx->receiver_decl = t; | |
1140 | ||
1141 | /* Allocate memory for the function structure. The call to | |
50674e96 | 1142 | allocate_struct_function clobbers CFUN, so we need to restore |
953ff289 DN |
1143 | it afterward. */ |
1144 | allocate_struct_function (decl); | |
1145 | DECL_SOURCE_LOCATION (decl) = EXPR_LOCATION (ctx->stmt); | |
1146 | cfun->function_end_locus = EXPR_LOCATION (ctx->stmt); | |
1147 | cfun = ctx->cb.src_cfun; | |
1148 | } | |
1149 | ||
953ff289 DN |
1150 | |
1151 | /* Scan an OpenMP parallel directive. */ | |
1152 | ||
1153 | static void | |
1154 | scan_omp_parallel (tree *stmt_p, omp_context *outer_ctx) | |
1155 | { | |
1156 | omp_context *ctx; | |
1157 | tree name; | |
1158 | ||
1159 | /* Ignore parallel directives with empty bodies, unless there | |
1160 | are copyin clauses. */ | |
1161 | if (optimize > 0 | |
1162 | && empty_body_p (OMP_PARALLEL_BODY (*stmt_p)) | |
1163 | && find_omp_clause (OMP_CLAUSES (*stmt_p), OMP_CLAUSE_COPYIN) == NULL) | |
1164 | { | |
1165 | *stmt_p = build_empty_stmt (); | |
1166 | return; | |
1167 | } | |
1168 | ||
1169 | ctx = new_omp_context (*stmt_p, outer_ctx); | |
50674e96 DN |
1170 | if (parallel_nesting_level > 1) |
1171 | ctx->is_nested = true; | |
953ff289 | 1172 | ctx->field_map = splay_tree_new (splay_tree_compare_pointers, 0, 0); |
953ff289 DN |
1173 | ctx->default_kind = OMP_CLAUSE_DEFAULT_SHARED; |
1174 | ctx->record_type = lang_hooks.types.make_type (RECORD_TYPE); | |
953ff289 DN |
1175 | name = create_tmp_var_name (".omp_data_s"); |
1176 | name = build_decl (TYPE_DECL, name, ctx->record_type); | |
1177 | TYPE_NAME (ctx->record_type) = name; | |
1178 | create_omp_child_function (ctx); | |
50674e96 | 1179 | OMP_PARALLEL_FN (*stmt_p) = ctx->cb.dst_fn; |
953ff289 DN |
1180 | |
1181 | scan_sharing_clauses (OMP_PARALLEL_CLAUSES (*stmt_p), ctx); | |
1182 | scan_omp (&OMP_PARALLEL_BODY (*stmt_p), ctx); | |
1183 | ||
1184 | if (TYPE_FIELDS (ctx->record_type) == NULL) | |
1185 | ctx->record_type = ctx->receiver_decl = NULL; | |
1186 | else | |
1187 | { | |
1188 | layout_type (ctx->record_type); | |
1189 | fixup_child_record_type (ctx); | |
1190 | } | |
1191 | } | |
1192 | ||
1193 | ||
50674e96 | 1194 | /* Scan an OpenMP loop directive. */ |
953ff289 DN |
1195 | |
1196 | static void | |
50674e96 | 1197 | scan_omp_for (tree *stmt_p, omp_context *outer_ctx) |
953ff289 | 1198 | { |
50674e96 DN |
1199 | omp_context *ctx; |
1200 | tree stmt; | |
953ff289 | 1201 | |
50674e96 DN |
1202 | stmt = *stmt_p; |
1203 | ctx = new_omp_context (stmt, outer_ctx); | |
953ff289 | 1204 | |
50674e96 | 1205 | scan_sharing_clauses (OMP_FOR_CLAUSES (stmt), ctx); |
953ff289 | 1206 | |
953ff289 DN |
1207 | scan_omp (&OMP_FOR_PRE_BODY (stmt), ctx); |
1208 | scan_omp (&OMP_FOR_INIT (stmt), ctx); | |
1209 | scan_omp (&OMP_FOR_COND (stmt), ctx); | |
1210 | scan_omp (&OMP_FOR_INCR (stmt), ctx); | |
1211 | scan_omp (&OMP_FOR_BODY (stmt), ctx); | |
1212 | } | |
1213 | ||
1214 | /* Scan an OpenMP sections directive. */ | |
1215 | ||
1216 | static void | |
1217 | scan_omp_sections (tree *stmt_p, omp_context *outer_ctx) | |
1218 | { | |
50674e96 | 1219 | tree stmt; |
953ff289 DN |
1220 | omp_context *ctx; |
1221 | ||
50674e96 | 1222 | stmt = *stmt_p; |
953ff289 DN |
1223 | ctx = new_omp_context (stmt, outer_ctx); |
1224 | scan_sharing_clauses (OMP_SECTIONS_CLAUSES (stmt), ctx); | |
1225 | scan_omp (&OMP_SECTIONS_BODY (stmt), ctx); | |
1226 | } | |
1227 | ||
1228 | /* Scan an OpenMP single directive. */ | |
1229 | ||
1230 | static void | |
1231 | scan_omp_single (tree *stmt_p, omp_context *outer_ctx) | |
1232 | { | |
1233 | tree stmt = *stmt_p; | |
1234 | omp_context *ctx; | |
1235 | tree name; | |
1236 | ||
1237 | ctx = new_omp_context (stmt, outer_ctx); | |
1238 | ctx->field_map = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
1239 | ctx->record_type = lang_hooks.types.make_type (RECORD_TYPE); | |
1240 | name = create_tmp_var_name (".omp_copy_s"); | |
1241 | name = build_decl (TYPE_DECL, name, ctx->record_type); | |
1242 | TYPE_NAME (ctx->record_type) = name; | |
1243 | ||
1244 | scan_sharing_clauses (OMP_SINGLE_CLAUSES (stmt), ctx); | |
1245 | scan_omp (&OMP_SINGLE_BODY (stmt), ctx); | |
1246 | ||
1247 | if (TYPE_FIELDS (ctx->record_type) == NULL) | |
1248 | ctx->record_type = NULL; | |
1249 | else | |
1250 | layout_type (ctx->record_type); | |
1251 | } | |
1252 | ||
953ff289 DN |
1253 | |
1254 | /* Callback for walk_stmts used to scan for OpenMP directives at TP. */ | |
1255 | ||
1256 | static tree | |
1257 | scan_omp_1 (tree *tp, int *walk_subtrees, void *data) | |
1258 | { | |
1259 | struct walk_stmt_info *wi = data; | |
1260 | omp_context *ctx = wi->info; | |
1261 | tree t = *tp; | |
1262 | ||
1263 | if (EXPR_HAS_LOCATION (t)) | |
1264 | input_location = EXPR_LOCATION (t); | |
1265 | ||
1266 | *walk_subtrees = 0; | |
1267 | switch (TREE_CODE (t)) | |
1268 | { | |
1269 | case OMP_PARALLEL: | |
50674e96 DN |
1270 | parallel_nesting_level++; |
1271 | scan_omp_parallel (tp, ctx); | |
953ff289 DN |
1272 | parallel_nesting_level--; |
1273 | break; | |
1274 | ||
1275 | case OMP_FOR: | |
50674e96 | 1276 | scan_omp_for (tp, ctx); |
953ff289 DN |
1277 | break; |
1278 | ||
1279 | case OMP_SECTIONS: | |
50674e96 | 1280 | scan_omp_sections (tp, ctx); |
953ff289 DN |
1281 | break; |
1282 | ||
1283 | case OMP_SINGLE: | |
50674e96 | 1284 | scan_omp_single (tp, ctx); |
953ff289 DN |
1285 | break; |
1286 | ||
1287 | case OMP_SECTION: | |
1288 | case OMP_MASTER: | |
1289 | case OMP_ORDERED: | |
1290 | case OMP_CRITICAL: | |
1291 | ctx = new_omp_context (*tp, ctx); | |
1292 | scan_omp (&OMP_BODY (*tp), ctx); | |
1293 | break; | |
1294 | ||
1295 | case BIND_EXPR: | |
1296 | { | |
1297 | tree var; | |
1298 | *walk_subtrees = 1; | |
1299 | ||
1300 | for (var = BIND_EXPR_VARS (t); var ; var = TREE_CHAIN (var)) | |
50674e96 | 1301 | insert_decl_map (&ctx->cb, var, var); |
953ff289 DN |
1302 | } |
1303 | break; | |
1304 | ||
1305 | case VAR_DECL: | |
1306 | case PARM_DECL: | |
1307 | case LABEL_DECL: | |
1308 | if (ctx) | |
1309 | *tp = remap_decl (t, &ctx->cb); | |
1310 | break; | |
1311 | ||
1312 | default: | |
1313 | if (ctx && TYPE_P (t)) | |
1314 | *tp = remap_type (t, &ctx->cb); | |
1315 | else if (!DECL_P (t)) | |
1316 | *walk_subtrees = 1; | |
1317 | break; | |
1318 | } | |
1319 | ||
1320 | return NULL_TREE; | |
1321 | } | |
1322 | ||
1323 | ||
1324 | /* Scan all the statements starting at STMT_P. CTX contains context | |
1325 | information about the OpenMP directives and clauses found during | |
1326 | the scan. */ | |
1327 | ||
1328 | static void | |
1329 | scan_omp (tree *stmt_p, omp_context *ctx) | |
1330 | { | |
1331 | location_t saved_location; | |
1332 | struct walk_stmt_info wi; | |
1333 | ||
1334 | memset (&wi, 0, sizeof (wi)); | |
1335 | wi.callback = scan_omp_1; | |
1336 | wi.info = ctx; | |
1337 | wi.want_bind_expr = (ctx != NULL); | |
1338 | wi.want_locations = true; | |
1339 | ||
1340 | saved_location = input_location; | |
1341 | walk_stmts (&wi, stmt_p); | |
1342 | input_location = saved_location; | |
1343 | } | |
1344 | \f | |
1345 | /* Re-gimplification and code generation routines. */ | |
1346 | ||
1347 | /* Build a call to GOMP_barrier. */ | |
1348 | ||
1349 | static void | |
1350 | build_omp_barrier (tree *stmt_list) | |
1351 | { | |
1352 | tree t; | |
1353 | ||
1354 | t = built_in_decls[BUILT_IN_GOMP_BARRIER]; | |
1355 | t = build_function_call_expr (t, NULL); | |
1356 | gimplify_and_add (t, stmt_list); | |
1357 | } | |
1358 | ||
1359 | /* If a context was created for STMT when it was scanned, return it. */ | |
1360 | ||
1361 | static omp_context * | |
1362 | maybe_lookup_ctx (tree stmt) | |
1363 | { | |
1364 | splay_tree_node n; | |
1365 | n = splay_tree_lookup (all_contexts, (splay_tree_key) stmt); | |
1366 | return n ? (omp_context *) n->value : NULL; | |
1367 | } | |
1368 | ||
50674e96 DN |
1369 | |
1370 | /* Find the mapping for DECL in CTX or the immediately enclosing | |
1371 | context that has a mapping for DECL. | |
1372 | ||
1373 | If CTX is a nested parallel directive, we may have to use the decl | |
1374 | mappings created in CTX's parent context. Suppose that we have the | |
1375 | following parallel nesting (variable UIDs showed for clarity): | |
1376 | ||
1377 | iD.1562 = 0; | |
1378 | #omp parallel shared(iD.1562) -> outer parallel | |
1379 | iD.1562 = iD.1562 + 1; | |
1380 | ||
1381 | #omp parallel shared (iD.1562) -> inner parallel | |
1382 | iD.1562 = iD.1562 - 1; | |
1383 | ||
1384 | Each parallel structure will create a distinct .omp_data_s structure | |
1385 | for copying iD.1562 in/out of the directive: | |
1386 | ||
1387 | outer parallel .omp_data_s.1.i -> iD.1562 | |
1388 | inner parallel .omp_data_s.2.i -> iD.1562 | |
1389 | ||
1390 | A shared variable mapping will produce a copy-out operation before | |
1391 | the parallel directive and a copy-in operation after it. So, in | |
1392 | this case we would have: | |
1393 | ||
1394 | iD.1562 = 0; | |
1395 | .omp_data_o.1.i = iD.1562; | |
1396 | #omp parallel shared(iD.1562) -> outer parallel | |
1397 | .omp_data_i.1 = &.omp_data_o.1 | |
1398 | .omp_data_i.1->i = .omp_data_i.1->i + 1; | |
1399 | ||
1400 | .omp_data_o.2.i = iD.1562; -> ** | |
1401 | #omp parallel shared(iD.1562) -> inner parallel | |
1402 | .omp_data_i.2 = &.omp_data_o.2 | |
1403 | .omp_data_i.2->i = .omp_data_i.2->i - 1; | |
1404 | ||
1405 | ||
1406 | ** This is a problem. The symbol iD.1562 cannot be referenced | |
1407 | inside the body of the outer parallel region. But since we are | |
1408 | emitting this copy operation while expanding the inner parallel | |
1409 | directive, we need to access the CTX structure of the outer | |
1410 | parallel directive to get the correct mapping: | |
1411 | ||
1412 | .omp_data_o.2.i = .omp_data_i.1->i | |
1413 | ||
1414 | Since there may be other workshare or parallel directives enclosing | |
1415 | the parallel directive, it may be necessary to walk up the context | |
1416 | parent chain. This is not a problem in general because nested | |
1417 | parallelism happens only rarely. */ | |
1418 | ||
1419 | static tree | |
1420 | lookup_decl_in_outer_ctx (tree decl, omp_context *ctx) | |
1421 | { | |
1422 | tree t; | |
1423 | omp_context *up; | |
1424 | ||
1425 | gcc_assert (ctx->is_nested); | |
1426 | ||
1427 | for (up = ctx->outer, t = NULL; up && t == NULL; up = up->outer) | |
1428 | t = maybe_lookup_decl (decl, up); | |
1429 | ||
1430 | gcc_assert (t); | |
1431 | ||
1432 | return t; | |
1433 | } | |
1434 | ||
1435 | ||
953ff289 DN |
1436 | /* Construct the initialization value for reduction CLAUSE. */ |
1437 | ||
1438 | tree | |
1439 | omp_reduction_init (tree clause, tree type) | |
1440 | { | |
1441 | switch (OMP_CLAUSE_REDUCTION_CODE (clause)) | |
1442 | { | |
1443 | case PLUS_EXPR: | |
1444 | case MINUS_EXPR: | |
1445 | case BIT_IOR_EXPR: | |
1446 | case BIT_XOR_EXPR: | |
1447 | case TRUTH_OR_EXPR: | |
1448 | case TRUTH_ORIF_EXPR: | |
1449 | case TRUTH_XOR_EXPR: | |
1450 | case NE_EXPR: | |
1451 | return fold_convert (type, integer_zero_node); | |
1452 | ||
1453 | case MULT_EXPR: | |
1454 | case TRUTH_AND_EXPR: | |
1455 | case TRUTH_ANDIF_EXPR: | |
1456 | case EQ_EXPR: | |
1457 | return fold_convert (type, integer_one_node); | |
1458 | ||
1459 | case BIT_AND_EXPR: | |
1460 | return fold_convert (type, integer_minus_one_node); | |
1461 | ||
1462 | case MAX_EXPR: | |
1463 | if (SCALAR_FLOAT_TYPE_P (type)) | |
1464 | { | |
1465 | REAL_VALUE_TYPE max, min; | |
1466 | if (HONOR_INFINITIES (TYPE_MODE (type))) | |
1467 | { | |
1468 | real_inf (&max); | |
1469 | real_arithmetic (&min, NEGATE_EXPR, &max, NULL); | |
1470 | } | |
1471 | else | |
1472 | real_maxval (&min, 1, TYPE_MODE (type)); | |
1473 | return build_real (type, min); | |
1474 | } | |
1475 | else | |
1476 | { | |
1477 | gcc_assert (INTEGRAL_TYPE_P (type)); | |
1478 | return TYPE_MIN_VALUE (type); | |
1479 | } | |
1480 | ||
1481 | case MIN_EXPR: | |
1482 | if (SCALAR_FLOAT_TYPE_P (type)) | |
1483 | { | |
1484 | REAL_VALUE_TYPE max; | |
1485 | if (HONOR_INFINITIES (TYPE_MODE (type))) | |
1486 | real_inf (&max); | |
1487 | else | |
1488 | real_maxval (&max, 0, TYPE_MODE (type)); | |
1489 | return build_real (type, max); | |
1490 | } | |
1491 | else | |
1492 | { | |
1493 | gcc_assert (INTEGRAL_TYPE_P (type)); | |
1494 | return TYPE_MAX_VALUE (type); | |
1495 | } | |
1496 | ||
1497 | default: | |
1498 | gcc_unreachable (); | |
1499 | } | |
1500 | } | |
1501 | ||
1502 | /* Generate code to implement the input clauses, FIRSTPRIVATE and COPYIN, | |
1503 | from the receiver (aka child) side and initializers for REFERENCE_TYPE | |
1504 | private variables. Initialization statements go in ILIST, while calls | |
1505 | to destructors go in DLIST. */ | |
1506 | ||
1507 | static void | |
50674e96 | 1508 | lower_rec_input_clauses (tree clauses, tree *ilist, tree *dlist, |
953ff289 DN |
1509 | omp_context *ctx) |
1510 | { | |
1511 | tree_stmt_iterator diter; | |
1512 | tree c, dtor, copyin_seq, x, args, ptr; | |
1513 | bool copyin_by_ref = false; | |
1514 | int pass; | |
1515 | ||
1516 | *dlist = alloc_stmt_list (); | |
1517 | diter = tsi_start (*dlist); | |
1518 | copyin_seq = NULL; | |
1519 | ||
1520 | /* Do all the fixed sized types in the first pass, and the variable sized | |
1521 | types in the second pass. This makes sure that the scalar arguments to | |
1522 | the variable sized types are processed before we use them in the | |
1523 | variable sized operations. */ | |
1524 | for (pass = 0; pass < 2; ++pass) | |
1525 | { | |
1526 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
1527 | { | |
aaf46ef9 | 1528 | enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c); |
953ff289 DN |
1529 | tree var, new_var; |
1530 | bool by_ref; | |
1531 | ||
1532 | switch (c_kind) | |
1533 | { | |
1534 | case OMP_CLAUSE_PRIVATE: | |
1535 | if (OMP_CLAUSE_PRIVATE_DEBUG (c)) | |
1536 | continue; | |
1537 | break; | |
1538 | case OMP_CLAUSE_SHARED: | |
1539 | case OMP_CLAUSE_FIRSTPRIVATE: | |
1540 | case OMP_CLAUSE_LASTPRIVATE: | |
1541 | case OMP_CLAUSE_COPYIN: | |
1542 | case OMP_CLAUSE_REDUCTION: | |
1543 | break; | |
1544 | default: | |
1545 | continue; | |
1546 | } | |
1547 | ||
1548 | new_var = var = OMP_CLAUSE_DECL (c); | |
1549 | if (c_kind != OMP_CLAUSE_COPYIN) | |
1550 | new_var = lookup_decl (var, ctx); | |
1551 | ||
1552 | if (c_kind == OMP_CLAUSE_SHARED || c_kind == OMP_CLAUSE_COPYIN) | |
1553 | { | |
1554 | if (pass != 0) | |
1555 | continue; | |
1556 | } | |
953ff289 DN |
1557 | else if (is_variable_sized (var)) |
1558 | { | |
50674e96 DN |
1559 | /* For variable sized types, we need to allocate the |
1560 | actual storage here. Call alloca and store the | |
1561 | result in the pointer decl that we created elsewhere. */ | |
953ff289 DN |
1562 | if (pass == 0) |
1563 | continue; | |
1564 | ||
1565 | ptr = DECL_VALUE_EXPR (new_var); | |
1566 | gcc_assert (TREE_CODE (ptr) == INDIRECT_REF); | |
1567 | ptr = TREE_OPERAND (ptr, 0); | |
1568 | gcc_assert (DECL_P (ptr)); | |
1569 | ||
1570 | x = TYPE_SIZE_UNIT (TREE_TYPE (new_var)); | |
1571 | args = tree_cons (NULL, x, NULL); | |
1572 | x = built_in_decls[BUILT_IN_ALLOCA]; | |
1573 | x = build_function_call_expr (x, args); | |
1574 | x = fold_convert (TREE_TYPE (ptr), x); | |
1575 | x = build2 (MODIFY_EXPR, void_type_node, ptr, x); | |
1576 | gimplify_and_add (x, ilist); | |
1577 | } | |
953ff289 DN |
1578 | else if (is_reference (var)) |
1579 | { | |
50674e96 DN |
1580 | /* For references that are being privatized for Fortran, |
1581 | allocate new backing storage for the new pointer | |
1582 | variable. This allows us to avoid changing all the | |
1583 | code that expects a pointer to something that expects | |
1584 | a direct variable. Note that this doesn't apply to | |
1585 | C++, since reference types are disallowed in data | |
1586 | sharing clauses there. */ | |
953ff289 DN |
1587 | if (pass == 0) |
1588 | continue; | |
1589 | ||
1590 | x = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (new_var))); | |
1591 | if (TREE_CONSTANT (x)) | |
1592 | { | |
1593 | const char *name = NULL; | |
1594 | if (DECL_NAME (var)) | |
1595 | name = IDENTIFIER_POINTER (DECL_NAME (new_var)); | |
1596 | ||
1597 | x = create_tmp_var (TREE_TYPE (TREE_TYPE (new_var)), name); | |
1598 | x = build_fold_addr_expr_with_type (x, TREE_TYPE (new_var)); | |
1599 | } | |
1600 | else | |
1601 | { | |
1602 | args = tree_cons (NULL, x, NULL); | |
1603 | x = built_in_decls[BUILT_IN_ALLOCA]; | |
1604 | x = build_function_call_expr (x, args); | |
1605 | x = fold_convert (TREE_TYPE (new_var), x); | |
1606 | } | |
1607 | ||
1608 | x = build2 (MODIFY_EXPR, void_type_node, new_var, x); | |
1609 | gimplify_and_add (x, ilist); | |
1610 | ||
1611 | new_var = build_fold_indirect_ref (new_var); | |
1612 | } | |
1613 | else if (c_kind == OMP_CLAUSE_REDUCTION | |
1614 | && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) | |
1615 | { | |
1616 | if (pass == 0) | |
1617 | continue; | |
1618 | } | |
1619 | else if (pass != 0) | |
1620 | continue; | |
1621 | ||
aaf46ef9 | 1622 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 DN |
1623 | { |
1624 | case OMP_CLAUSE_SHARED: | |
1625 | /* Set up the DECL_VALUE_EXPR for shared variables now. This | |
1626 | needs to be delayed until after fixup_child_record_type so | |
1627 | that we get the correct type during the dereference. */ | |
1628 | by_ref = use_pointer_for_field (var, true); | |
1629 | x = build_receiver_ref (var, by_ref, ctx); | |
1630 | SET_DECL_VALUE_EXPR (new_var, x); | |
1631 | DECL_HAS_VALUE_EXPR_P (new_var) = 1; | |
1632 | ||
1633 | /* ??? If VAR is not passed by reference, and the variable | |
1634 | hasn't been initialized yet, then we'll get a warning for | |
1635 | the store into the omp_data_s structure. Ideally, we'd be | |
1636 | able to notice this and not store anything at all, but | |
1637 | we're generating code too early. Suppress the warning. */ | |
1638 | if (!by_ref) | |
1639 | TREE_NO_WARNING (var) = 1; | |
1640 | break; | |
1641 | ||
1642 | case OMP_CLAUSE_LASTPRIVATE: | |
1643 | if (OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)) | |
1644 | break; | |
1645 | /* FALLTHRU */ | |
1646 | ||
1647 | case OMP_CLAUSE_PRIVATE: | |
1648 | x = lang_hooks.decls.omp_clause_default_ctor (c, new_var); | |
1649 | if (x) | |
1650 | gimplify_and_add (x, ilist); | |
1651 | /* FALLTHRU */ | |
1652 | ||
1653 | do_dtor: | |
1654 | x = lang_hooks.decls.omp_clause_dtor (c, new_var); | |
1655 | if (x) | |
1656 | { | |
1657 | dtor = x; | |
1658 | gimplify_stmt (&dtor); | |
1659 | tsi_link_before (&diter, dtor, TSI_SAME_STMT); | |
1660 | } | |
1661 | break; | |
1662 | ||
1663 | case OMP_CLAUSE_FIRSTPRIVATE: | |
1664 | x = build_outer_var_ref (var, ctx); | |
1665 | x = lang_hooks.decls.omp_clause_copy_ctor (c, new_var, x); | |
1666 | gimplify_and_add (x, ilist); | |
1667 | goto do_dtor; | |
1668 | break; | |
1669 | ||
1670 | case OMP_CLAUSE_COPYIN: | |
1671 | by_ref = use_pointer_for_field (var, false); | |
1672 | x = build_receiver_ref (var, by_ref, ctx); | |
1673 | x = lang_hooks.decls.omp_clause_assign_op (c, new_var, x); | |
1674 | append_to_statement_list (x, ©in_seq); | |
1675 | copyin_by_ref |= by_ref; | |
1676 | break; | |
1677 | ||
1678 | case OMP_CLAUSE_REDUCTION: | |
1679 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) | |
1680 | { | |
1681 | gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c), ilist); | |
1682 | OMP_CLAUSE_REDUCTION_INIT (c) = NULL; | |
1683 | } | |
1684 | else | |
1685 | { | |
1686 | x = omp_reduction_init (c, TREE_TYPE (new_var)); | |
1687 | gcc_assert (TREE_CODE (TREE_TYPE (new_var)) != ARRAY_TYPE); | |
1688 | x = build2 (MODIFY_EXPR, void_type_node, new_var, x); | |
1689 | gimplify_and_add (x, ilist); | |
1690 | } | |
1691 | break; | |
1692 | ||
1693 | default: | |
1694 | gcc_unreachable (); | |
1695 | } | |
1696 | } | |
1697 | } | |
1698 | ||
1699 | /* The copyin sequence is not to be executed by the main thread, since | |
1700 | that would result in self-copies. Perhaps not visible to scalars, | |
1701 | but it certainly is to C++ operator=. */ | |
1702 | if (copyin_seq) | |
1703 | { | |
1704 | x = built_in_decls[BUILT_IN_OMP_GET_THREAD_NUM]; | |
1705 | x = build_function_call_expr (x, NULL); | |
1706 | x = build2 (NE_EXPR, boolean_type_node, x, | |
1707 | build_int_cst (TREE_TYPE (x), 0)); | |
1708 | x = build3 (COND_EXPR, void_type_node, x, copyin_seq, NULL); | |
1709 | gimplify_and_add (x, ilist); | |
1710 | } | |
1711 | ||
1712 | /* If any copyin variable is passed by reference, we must ensure the | |
1713 | master thread doesn't modify it before it is copied over in all | |
1714 | threads. */ | |
1715 | if (copyin_by_ref) | |
1716 | build_omp_barrier (ilist); | |
1717 | } | |
1718 | ||
50674e96 | 1719 | |
953ff289 DN |
1720 | /* Generate code to implement the LASTPRIVATE clauses. This is used for |
1721 | both parallel and workshare constructs. PREDICATE may be NULL if it's | |
1722 | always true. */ | |
1723 | ||
1724 | static void | |
50674e96 | 1725 | lower_lastprivate_clauses (tree clauses, tree predicate, tree *stmt_list, |
953ff289 DN |
1726 | omp_context *ctx) |
1727 | { | |
1728 | tree sub_list, x, c; | |
1729 | ||
1730 | /* Early exit if there are no lastprivate clauses. */ | |
1731 | clauses = find_omp_clause (clauses, OMP_CLAUSE_LASTPRIVATE); | |
1732 | if (clauses == NULL) | |
1733 | { | |
1734 | /* If this was a workshare clause, see if it had been combined | |
1735 | with its parallel. In that case, look for the clauses on the | |
1736 | parallel statement itself. */ | |
1737 | if (is_parallel_ctx (ctx)) | |
1738 | return; | |
1739 | ||
1740 | ctx = ctx->outer; | |
1741 | if (ctx == NULL || !is_parallel_ctx (ctx)) | |
1742 | return; | |
1743 | ||
1744 | clauses = find_omp_clause (OMP_PARALLEL_CLAUSES (ctx->stmt), | |
1745 | OMP_CLAUSE_LASTPRIVATE); | |
1746 | if (clauses == NULL) | |
1747 | return; | |
1748 | } | |
1749 | ||
1750 | sub_list = alloc_stmt_list (); | |
1751 | ||
1752 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
1753 | { | |
1754 | tree var, new_var; | |
1755 | ||
aaf46ef9 | 1756 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_LASTPRIVATE) |
953ff289 DN |
1757 | continue; |
1758 | ||
1759 | var = OMP_CLAUSE_DECL (c); | |
1760 | new_var = lookup_decl (var, ctx); | |
1761 | ||
1762 | x = build_outer_var_ref (var, ctx); | |
1763 | if (is_reference (var)) | |
1764 | new_var = build_fold_indirect_ref (new_var); | |
1765 | x = lang_hooks.decls.omp_clause_assign_op (c, x, new_var); | |
1766 | append_to_statement_list (x, &sub_list); | |
1767 | } | |
1768 | ||
1769 | if (predicate) | |
1770 | x = build3 (COND_EXPR, void_type_node, predicate, sub_list, NULL); | |
1771 | else | |
1772 | x = sub_list; | |
50674e96 | 1773 | |
953ff289 DN |
1774 | gimplify_and_add (x, stmt_list); |
1775 | } | |
1776 | ||
50674e96 | 1777 | |
953ff289 DN |
1778 | /* Generate code to implement the REDUCTION clauses. */ |
1779 | ||
1780 | static void | |
50674e96 | 1781 | lower_reduction_clauses (tree clauses, tree *stmt_list, omp_context *ctx) |
953ff289 DN |
1782 | { |
1783 | tree sub_list = NULL, x, c; | |
1784 | int count = 0; | |
1785 | ||
1786 | /* First see if there is exactly one reduction clause. Use OMP_ATOMIC | |
1787 | update in that case, otherwise use a lock. */ | |
1788 | for (c = clauses; c && count < 2; c = OMP_CLAUSE_CHAIN (c)) | |
aaf46ef9 | 1789 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION) |
953ff289 DN |
1790 | { |
1791 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) | |
1792 | { | |
1793 | /* Never use OMP_ATOMIC for array reductions. */ | |
1794 | count = -1; | |
1795 | break; | |
1796 | } | |
1797 | count++; | |
1798 | } | |
1799 | ||
1800 | if (count == 0) | |
1801 | return; | |
1802 | ||
1803 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
1804 | { | |
1805 | tree var, ref, new_var; | |
1806 | enum tree_code code; | |
1807 | ||
aaf46ef9 | 1808 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_REDUCTION) |
953ff289 DN |
1809 | continue; |
1810 | ||
1811 | var = OMP_CLAUSE_DECL (c); | |
1812 | new_var = lookup_decl (var, ctx); | |
1813 | if (is_reference (var)) | |
1814 | new_var = build_fold_indirect_ref (new_var); | |
1815 | ref = build_outer_var_ref (var, ctx); | |
1816 | code = OMP_CLAUSE_REDUCTION_CODE (c); | |
50674e96 DN |
1817 | |
1818 | /* reduction(-:var) sums up the partial results, so it acts | |
1819 | identically to reduction(+:var). */ | |
953ff289 DN |
1820 | if (code == MINUS_EXPR) |
1821 | code = PLUS_EXPR; | |
1822 | ||
1823 | if (count == 1) | |
1824 | { | |
1825 | tree addr = build_fold_addr_expr (ref); | |
1826 | ||
1827 | addr = save_expr (addr); | |
1828 | ref = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (addr)), addr); | |
1829 | x = fold_build2 (code, TREE_TYPE (ref), ref, new_var); | |
1830 | x = build2 (OMP_ATOMIC, void_type_node, addr, x); | |
1831 | gimplify_and_add (x, stmt_list); | |
1832 | return; | |
1833 | } | |
1834 | ||
1835 | if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c)) | |
1836 | { | |
1837 | tree placeholder = OMP_CLAUSE_REDUCTION_PLACEHOLDER (c); | |
1838 | ||
1839 | if (is_reference (var)) | |
1840 | ref = build_fold_addr_expr (ref); | |
1841 | SET_DECL_VALUE_EXPR (placeholder, ref); | |
1842 | DECL_HAS_VALUE_EXPR_P (placeholder) = 1; | |
1843 | gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c), &sub_list); | |
1844 | OMP_CLAUSE_REDUCTION_MERGE (c) = NULL; | |
1845 | OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) = NULL; | |
1846 | } | |
1847 | else | |
1848 | { | |
1849 | x = build2 (code, TREE_TYPE (ref), ref, new_var); | |
1850 | ref = build_outer_var_ref (var, ctx); | |
1851 | x = build2 (MODIFY_EXPR, void_type_node, ref, x); | |
1852 | append_to_statement_list (x, &sub_list); | |
1853 | } | |
1854 | } | |
1855 | ||
1856 | x = built_in_decls[BUILT_IN_GOMP_ATOMIC_START]; | |
1857 | x = build_function_call_expr (x, NULL); | |
1858 | gimplify_and_add (x, stmt_list); | |
1859 | ||
1860 | gimplify_and_add (sub_list, stmt_list); | |
1861 | ||
1862 | x = built_in_decls[BUILT_IN_GOMP_ATOMIC_END]; | |
1863 | x = build_function_call_expr (x, NULL); | |
1864 | gimplify_and_add (x, stmt_list); | |
1865 | } | |
1866 | ||
50674e96 | 1867 | |
953ff289 DN |
1868 | /* Generate code to implement the COPYPRIVATE clauses. */ |
1869 | ||
1870 | static void | |
50674e96 | 1871 | lower_copyprivate_clauses (tree clauses, tree *slist, tree *rlist, |
953ff289 DN |
1872 | omp_context *ctx) |
1873 | { | |
1874 | tree c; | |
1875 | ||
1876 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
1877 | { | |
1878 | tree var, ref, x; | |
1879 | bool by_ref; | |
1880 | ||
aaf46ef9 | 1881 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_COPYPRIVATE) |
953ff289 DN |
1882 | continue; |
1883 | ||
1884 | var = OMP_CLAUSE_DECL (c); | |
1885 | by_ref = use_pointer_for_field (var, false); | |
1886 | ||
1887 | ref = build_sender_ref (var, ctx); | |
50674e96 DN |
1888 | x = (ctx->is_nested) ? lookup_decl_in_outer_ctx (var, ctx) : var; |
1889 | x = by_ref ? build_fold_addr_expr (x) : x; | |
953ff289 DN |
1890 | x = build2 (MODIFY_EXPR, void_type_node, ref, x); |
1891 | gimplify_and_add (x, slist); | |
1892 | ||
1893 | ref = build_receiver_ref (var, by_ref, ctx); | |
1894 | if (is_reference (var)) | |
1895 | { | |
1896 | ref = build_fold_indirect_ref (ref); | |
1897 | var = build_fold_indirect_ref (var); | |
1898 | } | |
1899 | x = lang_hooks.decls.omp_clause_assign_op (c, var, ref); | |
1900 | gimplify_and_add (x, rlist); | |
1901 | } | |
1902 | } | |
1903 | ||
50674e96 | 1904 | |
953ff289 DN |
1905 | /* Generate code to implement the clauses, FIRSTPRIVATE, COPYIN, LASTPRIVATE, |
1906 | and REDUCTION from the sender (aka parent) side. */ | |
1907 | ||
1908 | static void | |
50674e96 | 1909 | lower_send_clauses (tree clauses, tree *ilist, tree *olist, omp_context *ctx) |
953ff289 DN |
1910 | { |
1911 | tree c; | |
1912 | ||
1913 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
1914 | { | |
50674e96 | 1915 | tree val, ref, x, var; |
953ff289 DN |
1916 | bool by_ref, do_in = false, do_out = false; |
1917 | ||
aaf46ef9 | 1918 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 DN |
1919 | { |
1920 | case OMP_CLAUSE_FIRSTPRIVATE: | |
1921 | case OMP_CLAUSE_COPYIN: | |
1922 | case OMP_CLAUSE_LASTPRIVATE: | |
1923 | case OMP_CLAUSE_REDUCTION: | |
1924 | break; | |
1925 | default: | |
1926 | continue; | |
1927 | } | |
1928 | ||
50674e96 DN |
1929 | var = val = OMP_CLAUSE_DECL (c); |
1930 | if (ctx->is_nested) | |
1931 | var = lookup_decl_in_outer_ctx (val, ctx); | |
1932 | ||
953ff289 DN |
1933 | if (is_variable_sized (val)) |
1934 | continue; | |
1935 | by_ref = use_pointer_for_field (val, false); | |
1936 | ||
aaf46ef9 | 1937 | switch (OMP_CLAUSE_CODE (c)) |
953ff289 DN |
1938 | { |
1939 | case OMP_CLAUSE_FIRSTPRIVATE: | |
1940 | case OMP_CLAUSE_COPYIN: | |
1941 | do_in = true; | |
1942 | break; | |
1943 | ||
1944 | case OMP_CLAUSE_LASTPRIVATE: | |
1945 | if (by_ref || is_reference (val)) | |
1946 | { | |
1947 | if (OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)) | |
1948 | continue; | |
1949 | do_in = true; | |
1950 | } | |
1951 | else | |
1952 | do_out = true; | |
1953 | break; | |
1954 | ||
1955 | case OMP_CLAUSE_REDUCTION: | |
1956 | do_in = true; | |
1957 | do_out = !(by_ref || is_reference (val)); | |
1958 | break; | |
1959 | ||
1960 | default: | |
1961 | gcc_unreachable (); | |
1962 | } | |
1963 | ||
1964 | if (do_in) | |
1965 | { | |
1966 | ref = build_sender_ref (val, ctx); | |
50674e96 | 1967 | x = by_ref ? build_fold_addr_expr (var) : var; |
953ff289 DN |
1968 | x = build2 (MODIFY_EXPR, void_type_node, ref, x); |
1969 | gimplify_and_add (x, ilist); | |
1970 | } | |
50674e96 | 1971 | |
953ff289 DN |
1972 | if (do_out) |
1973 | { | |
1974 | ref = build_sender_ref (val, ctx); | |
50674e96 | 1975 | x = build2 (MODIFY_EXPR, void_type_node, var, ref); |
953ff289 DN |
1976 | gimplify_and_add (x, olist); |
1977 | } | |
1978 | } | |
1979 | } | |
1980 | ||
1981 | /* Generate code to implement SHARED from the sender (aka parent) side. | |
1982 | This is trickier, since OMP_PARALLEL_CLAUSES doesn't list things that | |
1983 | got automatically shared. */ | |
1984 | ||
1985 | static void | |
50674e96 | 1986 | lower_send_shared_vars (tree *ilist, tree *olist, omp_context *ctx) |
953ff289 | 1987 | { |
50674e96 | 1988 | tree var, ovar, nvar, f, x; |
953ff289 DN |
1989 | |
1990 | if (ctx->record_type == NULL) | |
1991 | return; | |
50674e96 | 1992 | |
953ff289 DN |
1993 | for (f = TYPE_FIELDS (ctx->record_type); f ; f = TREE_CHAIN (f)) |
1994 | { | |
1995 | ovar = DECL_ABSTRACT_ORIGIN (f); | |
1996 | nvar = maybe_lookup_decl (ovar, ctx); | |
1997 | if (!nvar || !DECL_HAS_VALUE_EXPR_P (nvar)) | |
1998 | continue; | |
1999 | ||
50674e96 DN |
2000 | var = ovar; |
2001 | ||
2002 | /* If CTX is a nested parallel directive. Find the immediately | |
2003 | enclosing parallel or workshare construct that contains a | |
2004 | mapping for OVAR. */ | |
2005 | if (ctx->is_nested) | |
2006 | var = lookup_decl_in_outer_ctx (ovar, ctx); | |
2007 | ||
953ff289 DN |
2008 | if (use_pointer_for_field (ovar, true)) |
2009 | { | |
2010 | x = build_sender_ref (ovar, ctx); | |
50674e96 DN |
2011 | var = build_fold_addr_expr (var); |
2012 | x = build2 (MODIFY_EXPR, void_type_node, x, var); | |
953ff289 DN |
2013 | gimplify_and_add (x, ilist); |
2014 | } | |
2015 | else | |
2016 | { | |
2017 | x = build_sender_ref (ovar, ctx); | |
50674e96 | 2018 | x = build2 (MODIFY_EXPR, void_type_node, x, var); |
953ff289 DN |
2019 | gimplify_and_add (x, ilist); |
2020 | ||
2021 | x = build_sender_ref (ovar, ctx); | |
50674e96 | 2022 | x = build2 (MODIFY_EXPR, void_type_node, var, x); |
953ff289 DN |
2023 | gimplify_and_add (x, olist); |
2024 | } | |
2025 | } | |
2026 | } | |
2027 | ||
2028 | /* Build the function calls to GOMP_parallel_start etc to actually | |
50674e96 DN |
2029 | generate the parallel operation. REGION is the parallel region |
2030 | being expanded. BB is the block where to insert the code. WS_ARGS | |
2031 | will be set if this is a call to a combined parallel+workshare | |
2032 | construct, it contains the list of additional arguments needed by | |
2033 | the workshare construct. */ | |
953ff289 DN |
2034 | |
2035 | static void | |
50674e96 | 2036 | expand_parallel_call (struct omp_region *region, basic_block bb, tree ws_args) |
953ff289 | 2037 | { |
50674e96 DN |
2038 | tree t, args, val, cond, c, list, clauses; |
2039 | block_stmt_iterator si; | |
2040 | int start_ix; | |
2041 | ||
2042 | clauses = OMP_PARALLEL_CLAUSES (region->entry); | |
2043 | push_gimplify_context (); | |
2044 | ||
2045 | /* Determine what flavour of GOMP_parallel_start we will be | |
2046 | emitting. */ | |
2047 | start_ix = BUILT_IN_GOMP_PARALLEL_START; | |
2048 | if (is_combined_parallel (region)) | |
2049 | { | |
2050 | tree stmt = region->inner->entry; | |
2051 | ||
2052 | if (TREE_CODE (stmt) == OMP_FOR) | |
2053 | { | |
2054 | struct omp_for_data fd; | |
2055 | extract_omp_for_data (stmt, &fd); | |
2056 | start_ix = BUILT_IN_GOMP_PARALLEL_LOOP_STATIC_START + fd.sched_kind; | |
2057 | } | |
2058 | else if (TREE_CODE (stmt) == OMP_SECTIONS) | |
2059 | start_ix = BUILT_IN_GOMP_PARALLEL_SECTIONS_START; | |
2060 | else | |
2061 | gcc_unreachable (); | |
2062 | } | |
953ff289 DN |
2063 | |
2064 | /* By default, the value of NUM_THREADS is zero (selected at run time) | |
2065 | and there is no conditional. */ | |
2066 | cond = NULL_TREE; | |
2067 | val = build_int_cst (unsigned_type_node, 0); | |
2068 | ||
2069 | c = find_omp_clause (clauses, OMP_CLAUSE_IF); | |
2070 | if (c) | |
2071 | cond = OMP_CLAUSE_IF_EXPR (c); | |
2072 | ||
2073 | c = find_omp_clause (clauses, OMP_CLAUSE_NUM_THREADS); | |
2074 | if (c) | |
2075 | val = OMP_CLAUSE_NUM_THREADS_EXPR (c); | |
2076 | ||
2077 | /* Ensure 'val' is of the correct type. */ | |
2078 | val = fold_convert (unsigned_type_node, val); | |
2079 | ||
2080 | /* If we found the clause 'if (cond)', build either | |
2081 | (cond != 0) or (cond ? val : 1u). */ | |
2082 | if (cond) | |
2083 | { | |
50674e96 DN |
2084 | block_stmt_iterator si; |
2085 | ||
2086 | cond = gimple_boolify (cond); | |
2087 | ||
953ff289 DN |
2088 | if (integer_zerop (val)) |
2089 | val = build2 (EQ_EXPR, unsigned_type_node, cond, | |
2090 | build_int_cst (TREE_TYPE (cond), 0)); | |
2091 | else | |
50674e96 DN |
2092 | { |
2093 | basic_block cond_bb, then_bb, else_bb; | |
2094 | edge e; | |
2095 | tree t, then_lab, else_lab, tmp; | |
2096 | ||
2097 | tmp = create_tmp_var (TREE_TYPE (val), NULL); | |
2098 | e = split_block (bb, NULL); | |
2099 | cond_bb = e->src; | |
2100 | bb = e->dest; | |
2101 | remove_edge (e); | |
2102 | ||
2103 | then_bb = create_empty_bb (cond_bb); | |
2104 | else_bb = create_empty_bb (then_bb); | |
2105 | then_lab = create_artificial_label (); | |
2106 | else_lab = create_artificial_label (); | |
2107 | ||
2108 | t = build3 (COND_EXPR, void_type_node, | |
2109 | cond, | |
2110 | build_and_jump (&then_lab), | |
2111 | build_and_jump (&else_lab)); | |
2112 | ||
2113 | si = bsi_start (cond_bb); | |
2114 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
2115 | ||
2116 | si = bsi_start (then_bb); | |
2117 | t = build1 (LABEL_EXPR, void_type_node, then_lab); | |
2118 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
2119 | t = build2 (MODIFY_EXPR, void_type_node, tmp, val); | |
2120 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
2121 | ||
2122 | si = bsi_start (else_bb); | |
2123 | t = build1 (LABEL_EXPR, void_type_node, else_lab); | |
2124 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
2125 | t = build2 (MODIFY_EXPR, void_type_node, tmp, | |
2126 | build_int_cst (unsigned_type_node, 1)); | |
2127 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
2128 | ||
2129 | make_edge (cond_bb, then_bb, EDGE_TRUE_VALUE); | |
2130 | make_edge (cond_bb, else_bb, EDGE_FALSE_VALUE); | |
2131 | make_edge (then_bb, bb, EDGE_FALLTHRU); | |
2132 | make_edge (else_bb, bb, EDGE_FALLTHRU); | |
2133 | ||
2134 | val = tmp; | |
2135 | } | |
2136 | ||
2137 | list = NULL_TREE; | |
2138 | val = get_formal_tmp_var (val, &list); | |
2139 | si = bsi_start (bb); | |
2140 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
953ff289 DN |
2141 | } |
2142 | ||
50674e96 | 2143 | list = NULL_TREE; |
953ff289 | 2144 | args = tree_cons (NULL, val, NULL); |
50674e96 | 2145 | t = OMP_PARALLEL_DATA_ARG (region->entry); |
953ff289 DN |
2146 | if (t == NULL) |
2147 | t = null_pointer_node; | |
2148 | else | |
2149 | t = build_fold_addr_expr (t); | |
2150 | args = tree_cons (NULL, t, args); | |
50674e96 | 2151 | t = build_fold_addr_expr (OMP_PARALLEL_FN (region->entry)); |
953ff289 | 2152 | args = tree_cons (NULL, t, args); |
50674e96 DN |
2153 | |
2154 | if (ws_args) | |
2155 | args = chainon (args, ws_args); | |
2156 | ||
2157 | t = built_in_decls[start_ix]; | |
953ff289 | 2158 | t = build_function_call_expr (t, args); |
50674e96 | 2159 | gimplify_and_add (t, &list); |
953ff289 | 2160 | |
50674e96 | 2161 | t = OMP_PARALLEL_DATA_ARG (region->entry); |
953ff289 DN |
2162 | if (t == NULL) |
2163 | t = null_pointer_node; | |
2164 | else | |
2165 | t = build_fold_addr_expr (t); | |
2166 | args = tree_cons (NULL, t, NULL); | |
50674e96 DN |
2167 | t = build_function_call_expr (OMP_PARALLEL_FN (region->entry), args); |
2168 | gimplify_and_add (t, &list); | |
953ff289 DN |
2169 | |
2170 | t = built_in_decls[BUILT_IN_GOMP_PARALLEL_END]; | |
2171 | t = build_function_call_expr (t, NULL); | |
50674e96 DN |
2172 | gimplify_and_add (t, &list); |
2173 | ||
2174 | si = bsi_last (bb); | |
2175 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
2176 | ||
2177 | pop_gimplify_context (NULL_TREE); | |
953ff289 DN |
2178 | } |
2179 | ||
50674e96 | 2180 | |
953ff289 DN |
2181 | /* If exceptions are enabled, wrap *STMT_P in a MUST_NOT_THROW catch |
2182 | handler. This prevents programs from violating the structured | |
2183 | block semantics with throws. */ | |
2184 | ||
2185 | static void | |
2186 | maybe_catch_exception (tree *stmt_p) | |
2187 | { | |
2188 | tree f, t; | |
2189 | ||
2190 | if (!flag_exceptions) | |
2191 | return; | |
2192 | ||
2193 | if (lang_protect_cleanup_actions) | |
2194 | t = lang_protect_cleanup_actions (); | |
2195 | else | |
2196 | { | |
2197 | t = built_in_decls[BUILT_IN_TRAP]; | |
2198 | t = build_function_call_expr (t, NULL); | |
2199 | } | |
2200 | f = build2 (EH_FILTER_EXPR, void_type_node, NULL, NULL); | |
2201 | EH_FILTER_MUST_NOT_THROW (f) = 1; | |
2202 | gimplify_and_add (t, &EH_FILTER_FAILURE (f)); | |
2203 | ||
2204 | t = build2 (TRY_CATCH_EXPR, void_type_node, *stmt_p, NULL); | |
2205 | append_to_statement_list (f, &TREE_OPERAND (t, 1)); | |
2206 | ||
2207 | *stmt_p = NULL; | |
2208 | append_to_statement_list (t, stmt_p); | |
2209 | } | |
2210 | ||
50674e96 | 2211 | /* Chain all the DECLs in LIST by their TREE_CHAIN fields. */ |
953ff289 | 2212 | |
50674e96 DN |
2213 | static tree |
2214 | list2chain (tree list) | |
953ff289 | 2215 | { |
50674e96 | 2216 | tree t; |
953ff289 | 2217 | |
50674e96 DN |
2218 | for (t = list; t; t = TREE_CHAIN (t)) |
2219 | { | |
2220 | tree var = TREE_VALUE (t); | |
2221 | if (TREE_CHAIN (t)) | |
2222 | TREE_CHAIN (var) = TREE_VALUE (TREE_CHAIN (t)); | |
2223 | else | |
2224 | TREE_CHAIN (var) = NULL_TREE; | |
2225 | } | |
953ff289 | 2226 | |
50674e96 DN |
2227 | return list ? TREE_VALUE (list) : NULL_TREE; |
2228 | } | |
953ff289 | 2229 | |
953ff289 | 2230 | |
50674e96 DN |
2231 | /* Remove barriers in REGION->EXIT's block. Note that this is only |
2232 | valid for OMP_PARALLEL regions. Since the end of a parallel region | |
2233 | is an implicit barrier, any workshare inside the OMP_PARALLEL that | |
2234 | left a barrier at the end of the OMP_PARALLEL region can now be | |
2235 | removed. */ | |
953ff289 | 2236 | |
50674e96 DN |
2237 | static void |
2238 | remove_exit_barrier (struct omp_region *region) | |
2239 | { | |
2240 | block_stmt_iterator si; | |
2241 | basic_block exit_bb; | |
2242 | tree t; | |
953ff289 | 2243 | |
50674e96 | 2244 | gcc_assert (TREE_CODE (region->entry) == OMP_PARALLEL); |
953ff289 | 2245 | |
50674e96 | 2246 | exit_bb = bb_for_stmt (region->exit); |
953ff289 | 2247 | |
50674e96 DN |
2248 | /* The barrier should be immediately before OMP_RETURN_EXPR. |
2249 | Otherwise, we cannot remove it. */ | |
2250 | si = bsi_last (exit_bb); | |
2251 | t = bsi_stmt (si); | |
2252 | gcc_assert (TREE_CODE (t) == OMP_RETURN_EXPR); | |
2253 | bsi_prev (&si); | |
2254 | if (bsi_end_p (si)) | |
2255 | return; | |
953ff289 | 2256 | |
50674e96 DN |
2257 | t = bsi_stmt (si); |
2258 | if (TREE_CODE (t) == CALL_EXPR | |
2259 | && get_callee_fndecl (t) == built_in_decls[BUILT_IN_GOMP_BARRIER]) | |
2260 | bsi_remove (&si, true); | |
953ff289 DN |
2261 | } |
2262 | ||
50674e96 DN |
2263 | |
2264 | /* Expand the OpenMP parallel directive starting at REGION. */ | |
953ff289 DN |
2265 | |
2266 | static void | |
50674e96 | 2267 | expand_omp_parallel (struct omp_region *region) |
953ff289 | 2268 | { |
50674e96 DN |
2269 | basic_block entry_bb, exit_bb, new_bb; |
2270 | struct function *child_cfun, *saved_cfun; | |
2271 | tree child_fn, block, t, ws_args; | |
2272 | block_stmt_iterator si; | |
2273 | edge e; | |
2274 | ||
2275 | child_fn = OMP_PARALLEL_FN (region->entry); | |
2276 | child_cfun = DECL_STRUCT_FUNCTION (child_fn); | |
2277 | saved_cfun = cfun; | |
2278 | ||
2279 | entry_bb = bb_for_stmt (region->entry); | |
2280 | exit_bb = bb_for_stmt (region->exit); | |
2281 | ||
2282 | /* Barriers at the end of the function are not necessary and can be | |
2283 | removed. Since the caller will have a barrier of its own, this | |
2284 | one is superfluous. */ | |
2285 | remove_exit_barrier (region); | |
2286 | ||
2287 | if (is_combined_parallel (region)) | |
2288 | ws_args = region->ws_args; | |
2289 | else | |
2290 | ws_args = NULL_TREE; | |
953ff289 | 2291 | |
50674e96 | 2292 | if (DECL_STRUCT_FUNCTION (OMP_PARALLEL_FN (region->entry))->cfg) |
953ff289 | 2293 | { |
50674e96 DN |
2294 | /* Due to inlining, it may happen that we have already outlined |
2295 | the region, in which case all we need to do is make the | |
2296 | sub-graph unreachable and emit the parallel call. */ | |
2297 | edge entry_succ_e, exit_succ_e; | |
2298 | block_stmt_iterator si; | |
2299 | ||
2300 | entry_succ_e = single_succ_edge (entry_bb); | |
2301 | exit_succ_e = single_succ_edge (exit_bb); | |
2302 | ||
2303 | si = bsi_last (entry_bb); | |
2304 | gcc_assert (!bsi_end_p (si) && TREE_CODE (bsi_stmt (si)) == OMP_PARALLEL); | |
2305 | bsi_remove (&si, true); | |
2306 | ||
2307 | new_bb = entry_bb; | |
2308 | remove_edge (entry_succ_e); | |
2309 | make_edge (new_bb, exit_succ_e->dest, EDGE_FALLTHRU); | |
953ff289 | 2310 | } |
50674e96 DN |
2311 | else |
2312 | { | |
2313 | /* If the parallel region needs data sent from the parent | |
2314 | function, then the very first statement of the parallel body | |
2315 | is a copy assignment .OMP_DATA_I = &.OMP_DATA_O. Since | |
2316 | &.OMP_DATA_O is passed as an argument to the child function, | |
2317 | we need to replace it with the argument as seen by the child | |
2318 | function. | |
2319 | ||
2320 | In most cases, this will end up being the identity assignment | |
2321 | .OMP_DATA_I = .OMP_DATA_I. However, if the parallel body had | |
2322 | a function call that has been inlined, the original PARM_DECL | |
2323 | .OMP_DATA_I may have been converted into a different local | |
2324 | variable. In which case, we need to keep the assignment. */ | |
2325 | if (OMP_PARALLEL_DATA_ARG (region->entry)) | |
2326 | { | |
2327 | basic_block entry_succ_bb = single_succ (entry_bb); | |
2328 | block_stmt_iterator si = bsi_start (entry_succ_bb); | |
2329 | tree stmt; | |
953ff289 | 2330 | |
50674e96 | 2331 | gcc_assert (!bsi_end_p (si)); |
953ff289 | 2332 | |
50674e96 DN |
2333 | stmt = bsi_stmt (si); |
2334 | gcc_assert (TREE_CODE (stmt) == MODIFY_EXPR | |
2335 | && TREE_CODE (TREE_OPERAND (stmt, 1)) == ADDR_EXPR | |
2336 | && TREE_OPERAND (TREE_OPERAND (stmt, 1), 0) | |
2337 | == OMP_PARALLEL_DATA_ARG (region->entry)); | |
2338 | ||
2339 | if (TREE_OPERAND (stmt, 0) == DECL_ARGUMENTS (child_fn)) | |
2340 | bsi_remove (&si, true); | |
2341 | else | |
2342 | TREE_OPERAND (stmt, 1) = DECL_ARGUMENTS (child_fn); | |
2343 | } | |
2344 | ||
2345 | /* Declare local variables needed in CHILD_CFUN. */ | |
2346 | block = DECL_INITIAL (child_fn); | |
2347 | BLOCK_VARS (block) = list2chain (child_cfun->unexpanded_var_list); | |
2348 | DECL_SAVED_TREE (child_fn) = single_succ (entry_bb)->stmt_list; | |
2349 | ||
2350 | /* Reset DECL_CONTEXT on locals and function arguments. */ | |
2351 | for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t)) | |
2352 | DECL_CONTEXT (t) = child_fn; | |
2353 | ||
2354 | for (t = DECL_ARGUMENTS (child_fn); t; t = TREE_CHAIN (t)) | |
2355 | DECL_CONTEXT (t) = child_fn; | |
2356 | ||
2357 | /* Split ENTRY_BB at OMP_PARALLEL so that it can be moved to the | |
2358 | child function. */ | |
2359 | si = bsi_last (entry_bb); | |
2360 | t = bsi_stmt (si); | |
2361 | gcc_assert (t && TREE_CODE (t) == OMP_PARALLEL); | |
2362 | bsi_remove (&si, true); | |
2363 | e = split_block (entry_bb, t); | |
2364 | entry_bb = e->dest; | |
2365 | single_succ_edge (entry_bb)->flags = EDGE_FALLTHRU; | |
2366 | ||
2367 | /* Move the parallel region into CHILD_CFUN. We need to reset | |
2368 | dominance information because the expansion of the inner | |
2369 | regions has invalidated it. */ | |
2370 | free_dominance_info (CDI_DOMINATORS); | |
2371 | new_bb = move_sese_region_to_fn (child_cfun, entry_bb, exit_bb); | |
2372 | single_succ_edge (new_bb)->flags = EDGE_FALLTHRU; | |
2373 | cgraph_add_new_function (child_fn); | |
2374 | ||
2375 | /* Convert OMP_RETURN into a RETURN_EXPR. */ | |
2376 | si = bsi_last (exit_bb); | |
2377 | gcc_assert (!bsi_end_p (si) | |
2378 | && TREE_CODE (bsi_stmt (si)) == OMP_RETURN_EXPR); | |
2379 | t = build1 (RETURN_EXPR, void_type_node, NULL); | |
2380 | bsi_insert_after (&si, t, TSI_SAME_STMT); | |
2381 | bsi_remove (&si, true); | |
2382 | } | |
2383 | ||
2384 | /* Emit a library call to launch the children threads. */ | |
2385 | expand_parallel_call (region, new_bb, ws_args); | |
953ff289 DN |
2386 | } |
2387 | ||
50674e96 DN |
2388 | |
2389 | /* A subroutine of expand_omp_for. Generate code for a parallel | |
953ff289 DN |
2390 | loop with any schedule. Given parameters: |
2391 | ||
2392 | for (V = N1; V cond N2; V += STEP) BODY; | |
2393 | ||
2394 | where COND is "<" or ">", we generate pseudocode | |
2395 | ||
2396 | more = GOMP_loop_foo_start (N1, N2, STEP, CHUNK, &istart0, &iend0); | |
50674e96 | 2397 | if (more) goto L0; else goto L3; |
953ff289 DN |
2398 | L0: |
2399 | V = istart0; | |
2400 | iend = iend0; | |
2401 | L1: | |
2402 | BODY; | |
2403 | V += STEP; | |
50674e96 | 2404 | if (V cond iend) goto L1; else goto L2; |
953ff289 | 2405 | L2: |
50674e96 DN |
2406 | if (GOMP_loop_foo_next (&istart0, &iend0)) goto L0; else goto L3; |
2407 | L3: | |
953ff289 | 2408 | |
50674e96 DN |
2409 | If this is a combined omp parallel loop, instead of the call to |
2410 | GOMP_loop_foo_start, we emit 'goto L3'. */ | |
953ff289 | 2411 | |
50674e96 DN |
2412 | static basic_block |
2413 | expand_omp_for_generic (struct omp_region *region, | |
2414 | struct omp_for_data *fd, | |
953ff289 DN |
2415 | enum built_in_function start_fn, |
2416 | enum built_in_function next_fn) | |
2417 | { | |
50674e96 | 2418 | tree l0, l1, l2, l3; |
953ff289 | 2419 | tree type, istart0, iend0, iend; |
50674e96 DN |
2420 | tree t, args, list; |
2421 | basic_block entry_bb, exit_bb, l0_bb, l1_bb, l2_bb; | |
2422 | edge exit_edge; | |
2423 | block_stmt_iterator si; | |
2424 | bool in_combined_parallel = is_combined_parallel (region); | |
953ff289 DN |
2425 | |
2426 | type = TREE_TYPE (fd->v); | |
2427 | ||
2428 | istart0 = create_tmp_var (long_integer_type_node, ".istart0"); | |
2429 | iend0 = create_tmp_var (long_integer_type_node, ".iend0"); | |
2430 | ||
2431 | l0 = create_artificial_label (); | |
2432 | l1 = create_artificial_label (); | |
2433 | l2 = create_artificial_label (); | |
50674e96 | 2434 | l3 = create_artificial_label (); |
953ff289 DN |
2435 | iend = create_tmp_var (type, NULL); |
2436 | ||
50674e96 DN |
2437 | entry_bb = bb_for_stmt (region->entry); |
2438 | l1_bb = single_succ (entry_bb); | |
2439 | exit_bb = bb_for_stmt (region->exit); | |
2440 | ||
2441 | si = bsi_last (entry_bb); | |
2442 | gcc_assert (bsi_stmt (si) && TREE_CODE (bsi_stmt (si)) == OMP_FOR); | |
2443 | bsi_remove (&si, true); | |
2444 | list = alloc_stmt_list (); | |
2445 | ||
2446 | if (!in_combined_parallel) | |
953ff289 | 2447 | { |
50674e96 DN |
2448 | /* If this is not a combined parallel loop, emit a call to |
2449 | GOMP_loop_foo_start in ENTRY_BB. */ | |
953ff289 DN |
2450 | t = build_fold_addr_expr (iend0); |
2451 | args = tree_cons (NULL, t, NULL); | |
2452 | t = build_fold_addr_expr (istart0); | |
2453 | args = tree_cons (NULL, t, args); | |
2454 | if (fd->chunk_size) | |
2455 | { | |
2456 | t = fold_convert (long_integer_type_node, fd->chunk_size); | |
2457 | args = tree_cons (NULL, t, args); | |
2458 | } | |
2459 | t = fold_convert (long_integer_type_node, fd->step); | |
2460 | args = tree_cons (NULL, t, args); | |
2461 | t = fold_convert (long_integer_type_node, fd->n2); | |
2462 | args = tree_cons (NULL, t, args); | |
2463 | t = fold_convert (long_integer_type_node, fd->n1); | |
2464 | args = tree_cons (NULL, t, args); | |
2465 | t = build_function_call_expr (built_in_decls[start_fn], args); | |
50674e96 DN |
2466 | t = get_formal_tmp_var (t, &list); |
2467 | t = build3 (COND_EXPR, void_type_node, t, build_and_jump (&l0), | |
2468 | build_and_jump (&l3)); | |
2469 | append_to_statement_list (t, &list); | |
2470 | si = bsi_last (entry_bb); | |
2471 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
953ff289 DN |
2472 | } |
2473 | ||
50674e96 DN |
2474 | /* Iteration setup for sequential loop goes in L0_BB. */ |
2475 | list = alloc_stmt_list (); | |
2476 | t = build1 (LABEL_EXPR, void_type_node, l0); | |
2477 | gimplify_and_add (t, &list); | |
2478 | ||
953ff289 DN |
2479 | t = fold_convert (type, istart0); |
2480 | t = build2 (MODIFY_EXPR, void_type_node, fd->v, t); | |
50674e96 | 2481 | gimplify_and_add (t, &list); |
953ff289 DN |
2482 | |
2483 | t = fold_convert (type, iend0); | |
2484 | t = build2 (MODIFY_EXPR, void_type_node, iend, t); | |
50674e96 | 2485 | gimplify_and_add (t, &list); |
953ff289 | 2486 | |
50674e96 DN |
2487 | l0_bb = create_empty_bb (entry_bb); |
2488 | si = bsi_start (l0_bb); | |
2489 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
2490 | ||
2491 | /* Loop body goes in L1_BB. */ | |
2492 | list = alloc_stmt_list (); | |
2493 | si = bsi_start (l1_bb); | |
2494 | bsi_insert_before (&si, build1 (LABEL_EXPR, void_type_node, l1), | |
2495 | BSI_CONTINUE_LINKING); | |
953ff289 | 2496 | |
50674e96 DN |
2497 | /* Code to control the increment and predicate for the sequential |
2498 | loop goes in the first half of EXIT_BB (we split EXIT_BB so | |
2499 | that we can inherit all the edges going out of the loop | |
2500 | body). */ | |
2501 | list = alloc_stmt_list (); | |
953ff289 DN |
2502 | |
2503 | t = build2 (PLUS_EXPR, type, fd->v, fd->step); | |
2504 | t = build2 (MODIFY_EXPR, void_type_node, fd->v, t); | |
50674e96 | 2505 | gimplify_and_add (t, &list); |
953ff289 DN |
2506 | |
2507 | t = build2 (fd->cond_code, boolean_type_node, fd->v, iend); | |
50674e96 DN |
2508 | t = get_formal_tmp_var (t, &list); |
2509 | t = build3 (COND_EXPR, void_type_node, t, build_and_jump (&l1), | |
2510 | build_and_jump (&l2)); | |
2511 | append_to_statement_list (t, &list); | |
2512 | ||
2513 | si = bsi_last (exit_bb); | |
2514 | t = bsi_stmt (si); | |
2515 | gcc_assert (t && TREE_CODE (t) == OMP_RETURN_EXPR); | |
2516 | bsi_remove (&si, true); | |
2517 | exit_edge = split_block (exit_bb, t); | |
2518 | exit_edge->flags = EDGE_FALSE_VALUE; | |
2519 | ||
2520 | si = bsi_last (exit_bb); | |
2521 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
2522 | ||
2523 | /* Emit code to get the next parallel iteration in L2_BB. */ | |
2524 | list = alloc_stmt_list (); | |
2525 | t = build1 (LABEL_EXPR, void_type_node, l2); | |
2526 | gimplify_and_add (t, &list); | |
2527 | ||
2528 | t = build_fold_addr_expr (iend0); | |
2529 | args = tree_cons (NULL, t, NULL); | |
2530 | t = build_fold_addr_expr (istart0); | |
2531 | args = tree_cons (NULL, t, args); | |
2532 | t = build_function_call_expr (built_in_decls[next_fn], args); | |
2533 | t = get_formal_tmp_var (t, &list); | |
2534 | t = build3 (COND_EXPR, void_type_node, t, build_and_jump (&l0), | |
2535 | build_and_jump (&l3)); | |
2536 | append_to_statement_list (t, &list); | |
2537 | ||
2538 | l2_bb = exit_edge->dest; | |
2539 | si = bsi_start (l2_bb); | |
2540 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
953ff289 | 2541 | |
50674e96 DN |
2542 | /* Insert exit label on EXIT_EDGE. */ |
2543 | exit_edge = single_succ_edge (l2_bb); | |
2544 | t = build1 (LABEL_EXPR, void_type_node, l3); | |
2545 | bsi_insert_on_edge_immediate (exit_edge, t); | |
2546 | exit_edge->flags = EDGE_FALSE_VALUE; | |
2547 | ||
2548 | /* Connect the new blocks. */ | |
2549 | remove_edge (single_succ_edge (entry_bb)); | |
953ff289 | 2550 | if (in_combined_parallel) |
50674e96 | 2551 | make_edge (entry_bb, l2_bb, EDGE_FALLTHRU); |
953ff289 DN |
2552 | else |
2553 | { | |
50674e96 DN |
2554 | make_edge (entry_bb, l0_bb, EDGE_TRUE_VALUE); |
2555 | make_edge (entry_bb, exit_edge->dest, EDGE_FALSE_VALUE); | |
953ff289 DN |
2556 | } |
2557 | ||
50674e96 DN |
2558 | make_edge (l0_bb, l1_bb, EDGE_FALLTHRU); |
2559 | make_edge (exit_bb, l1_bb, EDGE_TRUE_VALUE); | |
2560 | make_edge (l2_bb, l0_bb, EDGE_TRUE_VALUE); | |
2561 | ||
2562 | return exit_edge->dest; | |
953ff289 DN |
2563 | } |
2564 | ||
2565 | ||
50674e96 DN |
2566 | /* A subroutine of expand_omp_for. Generate code for a parallel |
2567 | loop with static schedule and no specified chunk size. Given | |
2568 | parameters: | |
953ff289 DN |
2569 | |
2570 | for (V = N1; V cond N2; V += STEP) BODY; | |
2571 | ||
2572 | where COND is "<" or ">", we generate pseudocode | |
2573 | ||
2574 | if (cond is <) | |
2575 | adj = STEP - 1; | |
2576 | else | |
2577 | adj = STEP + 1; | |
2578 | n = (adj + N2 - N1) / STEP; | |
2579 | q = n / nthreads; | |
2580 | q += (q * nthreads != n); | |
2581 | s0 = q * threadid; | |
2582 | e0 = min(s0 + q, n); | |
2583 | if (s0 >= e0) goto L2; else goto L0; | |
2584 | L0: | |
2585 | V = s0 * STEP + N1; | |
2586 | e = e0 * STEP + N1; | |
2587 | L1: | |
2588 | BODY; | |
2589 | V += STEP; | |
2590 | if (V cond e) goto L1; | |
953ff289 DN |
2591 | L2: |
2592 | */ | |
2593 | ||
50674e96 DN |
2594 | static basic_block |
2595 | expand_omp_for_static_nochunk (struct omp_region *region, | |
2596 | struct omp_for_data *fd) | |
953ff289 DN |
2597 | { |
2598 | tree l0, l1, l2, n, q, s0, e0, e, t, nthreads, threadid; | |
50674e96 DN |
2599 | tree type, utype, list; |
2600 | basic_block entry_bb, exit_bb, seq_start_bb, body_bb, new_exit_bb; | |
2601 | block_stmt_iterator si; | |
2602 | edge exit_edge; | |
953ff289 DN |
2603 | |
2604 | l0 = create_artificial_label (); | |
2605 | l1 = create_artificial_label (); | |
2606 | l2 = create_artificial_label (); | |
2607 | ||
2608 | type = TREE_TYPE (fd->v); | |
2609 | utype = lang_hooks.types.unsigned_type (type); | |
2610 | ||
50674e96 DN |
2611 | entry_bb = bb_for_stmt (region->entry); |
2612 | body_bb = single_succ (entry_bb); | |
2613 | exit_bb = bb_for_stmt (region->exit); | |
2614 | ||
2615 | /* Iteration space partitioning goes in ENTRY_BB. */ | |
2616 | list = alloc_stmt_list (); | |
953ff289 DN |
2617 | t = built_in_decls[BUILT_IN_OMP_GET_NUM_THREADS]; |
2618 | t = build_function_call_expr (t, NULL); | |
2619 | t = fold_convert (utype, t); | |
50674e96 | 2620 | nthreads = get_formal_tmp_var (t, &list); |
953ff289 DN |
2621 | |
2622 | t = built_in_decls[BUILT_IN_OMP_GET_THREAD_NUM]; | |
2623 | t = build_function_call_expr (t, NULL); | |
2624 | t = fold_convert (utype, t); | |
50674e96 | 2625 | threadid = get_formal_tmp_var (t, &list); |
953ff289 DN |
2626 | |
2627 | fd->n1 = fold_convert (type, fd->n1); | |
2628 | if (!is_gimple_val (fd->n1)) | |
50674e96 | 2629 | fd->n1 = get_formal_tmp_var (fd->n1, &list); |
953ff289 DN |
2630 | |
2631 | fd->n2 = fold_convert (type, fd->n2); | |
2632 | if (!is_gimple_val (fd->n2)) | |
50674e96 | 2633 | fd->n2 = get_formal_tmp_var (fd->n2, &list); |
953ff289 DN |
2634 | |
2635 | fd->step = fold_convert (type, fd->step); | |
2636 | if (!is_gimple_val (fd->step)) | |
50674e96 | 2637 | fd->step = get_formal_tmp_var (fd->step, &list); |
953ff289 DN |
2638 | |
2639 | t = build_int_cst (type, (fd->cond_code == LT_EXPR ? -1 : 1)); | |
2640 | t = fold_build2 (PLUS_EXPR, type, fd->step, t); | |
2641 | t = fold_build2 (PLUS_EXPR, type, t, fd->n2); | |
2642 | t = fold_build2 (MINUS_EXPR, type, t, fd->n1); | |
2643 | t = fold_build2 (TRUNC_DIV_EXPR, type, t, fd->step); | |
2644 | t = fold_convert (utype, t); | |
2645 | if (is_gimple_val (t)) | |
2646 | n = t; | |
2647 | else | |
50674e96 | 2648 | n = get_formal_tmp_var (t, &list); |
953ff289 DN |
2649 | |
2650 | t = build2 (TRUNC_DIV_EXPR, utype, n, nthreads); | |
50674e96 | 2651 | q = get_formal_tmp_var (t, &list); |
953ff289 DN |
2652 | |
2653 | t = build2 (MULT_EXPR, utype, q, nthreads); | |
2654 | t = build2 (NE_EXPR, utype, t, n); | |
2655 | t = build2 (PLUS_EXPR, utype, q, t); | |
50674e96 | 2656 | q = get_formal_tmp_var (t, &list); |
953ff289 DN |
2657 | |
2658 | t = build2 (MULT_EXPR, utype, q, threadid); | |
50674e96 | 2659 | s0 = get_formal_tmp_var (t, &list); |
953ff289 DN |
2660 | |
2661 | t = build2 (PLUS_EXPR, utype, s0, q); | |
2662 | t = build2 (MIN_EXPR, utype, t, n); | |
50674e96 | 2663 | e0 = get_formal_tmp_var (t, &list); |
953ff289 DN |
2664 | |
2665 | t = build2 (GE_EXPR, boolean_type_node, s0, e0); | |
50674e96 DN |
2666 | t = build3 (COND_EXPR, void_type_node, t, build_and_jump (&l2), |
2667 | build_and_jump (&l0)); | |
2668 | append_to_statement_list (t, &list); | |
2669 | ||
2670 | si = bsi_last (entry_bb); | |
2671 | gcc_assert (bsi_stmt (si) && TREE_CODE (bsi_stmt (si)) == OMP_FOR); | |
2672 | bsi_remove (&si, true); | |
2673 | si = bsi_last (entry_bb); | |
2674 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
2675 | ||
2676 | /* Setup code for sequential iteration goes in SEQ_START_BB. */ | |
2677 | list = alloc_stmt_list (); | |
953ff289 DN |
2678 | |
2679 | t = build1 (LABEL_EXPR, void_type_node, l0); | |
50674e96 | 2680 | gimplify_and_add (t, &list); |
953ff289 DN |
2681 | |
2682 | t = fold_convert (type, s0); | |
2683 | t = build2 (MULT_EXPR, type, t, fd->step); | |
2684 | t = build2 (PLUS_EXPR, type, t, fd->n1); | |
2685 | t = build2 (MODIFY_EXPR, void_type_node, fd->v, t); | |
50674e96 | 2686 | gimplify_and_add (t, &list); |
953ff289 DN |
2687 | |
2688 | t = fold_convert (type, e0); | |
2689 | t = build2 (MULT_EXPR, type, t, fd->step); | |
2690 | t = build2 (PLUS_EXPR, type, t, fd->n1); | |
50674e96 | 2691 | e = get_formal_tmp_var (t, &list); |
953ff289 | 2692 | |
50674e96 DN |
2693 | seq_start_bb = create_empty_bb (entry_bb); |
2694 | si = bsi_start (seq_start_bb); | |
2695 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
953ff289 | 2696 | |
50674e96 DN |
2697 | /* Original body goes in BODY_BB. */ |
2698 | si = bsi_start (body_bb); | |
2699 | t = build1 (LABEL_EXPR, void_type_node, l1); | |
2700 | bsi_insert_before (&si, t, BSI_CONTINUE_LINKING); | |
2701 | ||
2702 | /* Split EXIT_BB at the OMP_RETURN. The code controlling the | |
2703 | sequential loop goes in the original EXIT_BB. The exit out of | |
2704 | the parallel loop goes in the new block (NEW_EXIT_BB). */ | |
2705 | si = bsi_last (exit_bb); | |
2706 | t = bsi_stmt (si); | |
2707 | bsi_remove (&si, true); | |
2708 | gcc_assert (t && TREE_CODE (t) == OMP_RETURN_EXPR); | |
2709 | exit_edge = split_block (exit_bb, t); | |
2710 | new_exit_bb = exit_edge->dest; | |
2711 | list = alloc_stmt_list (); | |
953ff289 DN |
2712 | |
2713 | t = build2 (PLUS_EXPR, type, fd->v, fd->step); | |
2714 | t = build2 (MODIFY_EXPR, void_type_node, fd->v, t); | |
50674e96 | 2715 | gimplify_and_add (t, &list); |
953ff289 DN |
2716 | |
2717 | t = build2 (fd->cond_code, boolean_type_node, fd->v, e); | |
50674e96 DN |
2718 | t = get_formal_tmp_var (t, &list); |
2719 | t = build3 (COND_EXPR, void_type_node, t, build_and_jump (&l1), | |
2720 | build_and_jump (&l2)); | |
2721 | append_to_statement_list (t, &list); | |
953ff289 | 2722 | |
50674e96 DN |
2723 | si = bsi_last (exit_bb); |
2724 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
2725 | ||
2726 | /* Add the exit label to NEW_EXIT_BB. */ | |
2727 | si = bsi_start (new_exit_bb); | |
953ff289 | 2728 | t = build1 (LABEL_EXPR, void_type_node, l2); |
50674e96 DN |
2729 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); |
2730 | single_succ_edge (new_exit_bb)->flags = EDGE_FALLTHRU; | |
2731 | ||
2732 | /* Connect all the blocks. */ | |
2733 | make_edge (seq_start_bb, body_bb, EDGE_FALLTHRU); | |
2734 | ||
2735 | remove_edge (single_succ_edge (entry_bb)); | |
2736 | make_edge (entry_bb, new_exit_bb, EDGE_TRUE_VALUE); | |
2737 | make_edge (entry_bb, seq_start_bb, EDGE_FALSE_VALUE); | |
2738 | ||
2739 | make_edge (exit_bb, body_bb, EDGE_TRUE_VALUE); | |
2740 | find_edge (exit_bb, new_exit_bb)->flags = EDGE_FALSE_VALUE; | |
2741 | ||
2742 | return new_exit_bb; | |
953ff289 DN |
2743 | } |
2744 | ||
50674e96 DN |
2745 | |
2746 | /* A subroutine of expand_omp_for. Generate code for a parallel | |
2747 | loop with static schedule and a specified chunk size. Given | |
2748 | parameters: | |
953ff289 DN |
2749 | |
2750 | for (V = N1; V cond N2; V += STEP) BODY; | |
2751 | ||
2752 | where COND is "<" or ">", we generate pseudocode | |
2753 | ||
2754 | if (cond is <) | |
2755 | adj = STEP - 1; | |
2756 | else | |
2757 | adj = STEP + 1; | |
2758 | n = (adj + N2 - N1) / STEP; | |
2759 | trip = 0; | |
2760 | L0: | |
2761 | s0 = (trip * nthreads + threadid) * CHUNK; | |
2762 | e0 = min(s0 + CHUNK, n); | |
2763 | if (s0 < n) goto L1; else goto L4; | |
2764 | L1: | |
2765 | V = s0 * STEP + N1; | |
2766 | e = e0 * STEP + N1; | |
2767 | L2: | |
2768 | BODY; | |
2769 | V += STEP; | |
2770 | if (V cond e) goto L2; else goto L3; | |
2771 | L3: | |
2772 | trip += 1; | |
2773 | goto L0; | |
2774 | L4: | |
953ff289 DN |
2775 | */ |
2776 | ||
50674e96 DN |
2777 | static basic_block |
2778 | expand_omp_for_static_chunk (struct omp_region *region, struct omp_for_data *fd) | |
953ff289 | 2779 | { |
50674e96 | 2780 | tree l0, l1, l2, l3, l4, n, s0, e0, e, t; |
953ff289 DN |
2781 | tree trip, nthreads, threadid; |
2782 | tree type, utype; | |
50674e96 DN |
2783 | basic_block entry_bb, exit_bb, body_bb, seq_start_bb, iter_part_bb; |
2784 | basic_block trip_update_bb, new_exit_bb; | |
2785 | edge exit_edge; | |
2786 | tree list; | |
2787 | block_stmt_iterator si; | |
953ff289 DN |
2788 | |
2789 | l0 = create_artificial_label (); | |
2790 | l1 = create_artificial_label (); | |
2791 | l2 = create_artificial_label (); | |
2792 | l3 = create_artificial_label (); | |
2793 | l4 = create_artificial_label (); | |
953ff289 DN |
2794 | |
2795 | type = TREE_TYPE (fd->v); | |
2796 | utype = lang_hooks.types.unsigned_type (type); | |
2797 | ||
50674e96 DN |
2798 | entry_bb = bb_for_stmt (region->entry); |
2799 | body_bb = single_succ (entry_bb); | |
2800 | ||
2801 | exit_bb = bb_for_stmt (region->exit); | |
2802 | ||
2803 | /* Trip and adjustment setup goes in ENTRY_BB. */ | |
2804 | list = alloc_stmt_list (); | |
2805 | ||
953ff289 DN |
2806 | t = built_in_decls[BUILT_IN_OMP_GET_NUM_THREADS]; |
2807 | t = build_function_call_expr (t, NULL); | |
2808 | t = fold_convert (utype, t); | |
50674e96 | 2809 | nthreads = get_formal_tmp_var (t, &list); |
953ff289 DN |
2810 | |
2811 | t = built_in_decls[BUILT_IN_OMP_GET_THREAD_NUM]; | |
2812 | t = build_function_call_expr (t, NULL); | |
2813 | t = fold_convert (utype, t); | |
50674e96 | 2814 | threadid = get_formal_tmp_var (t, &list); |
953ff289 DN |
2815 | |
2816 | fd->n1 = fold_convert (type, fd->n1); | |
2817 | if (!is_gimple_val (fd->n1)) | |
50674e96 | 2818 | fd->n1 = get_formal_tmp_var (fd->n1, &list); |
953ff289 DN |
2819 | |
2820 | fd->n2 = fold_convert (type, fd->n2); | |
2821 | if (!is_gimple_val (fd->n2)) | |
50674e96 | 2822 | fd->n2 = get_formal_tmp_var (fd->n2, &list); |
953ff289 DN |
2823 | |
2824 | fd->step = fold_convert (type, fd->step); | |
2825 | if (!is_gimple_val (fd->step)) | |
50674e96 | 2826 | fd->step = get_formal_tmp_var (fd->step, &list); |
953ff289 DN |
2827 | |
2828 | fd->chunk_size = fold_convert (utype, fd->chunk_size); | |
2829 | if (!is_gimple_val (fd->chunk_size)) | |
50674e96 | 2830 | fd->chunk_size = get_formal_tmp_var (fd->chunk_size, &list); |
953ff289 DN |
2831 | |
2832 | t = build_int_cst (type, (fd->cond_code == LT_EXPR ? -1 : 1)); | |
2833 | t = fold_build2 (PLUS_EXPR, type, fd->step, t); | |
2834 | t = fold_build2 (PLUS_EXPR, type, t, fd->n2); | |
2835 | t = fold_build2 (MINUS_EXPR, type, t, fd->n1); | |
2836 | t = fold_build2 (TRUNC_DIV_EXPR, type, t, fd->step); | |
2837 | t = fold_convert (utype, t); | |
2838 | if (is_gimple_val (t)) | |
2839 | n = t; | |
2840 | else | |
50674e96 | 2841 | n = get_formal_tmp_var (t, &list); |
953ff289 DN |
2842 | |
2843 | t = build_int_cst (utype, 0); | |
50674e96 DN |
2844 | trip = get_initialized_tmp_var (t, &list, NULL); |
2845 | ||
2846 | si = bsi_last (entry_bb); | |
2847 | gcc_assert (bsi_stmt (si) && TREE_CODE (bsi_stmt (si)) == OMP_FOR); | |
2848 | bsi_remove (&si, true); | |
2849 | si = bsi_last (entry_bb); | |
2850 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
2851 | ||
2852 | /* Iteration space partitioning goes in ITER_PART_BB. */ | |
2853 | list = alloc_stmt_list (); | |
953ff289 DN |
2854 | |
2855 | t = build1 (LABEL_EXPR, void_type_node, l0); | |
50674e96 | 2856 | gimplify_and_add (t, &list); |
953ff289 DN |
2857 | |
2858 | t = build2 (MULT_EXPR, utype, trip, nthreads); | |
2859 | t = build2 (PLUS_EXPR, utype, t, threadid); | |
2860 | t = build2 (MULT_EXPR, utype, t, fd->chunk_size); | |
50674e96 | 2861 | s0 = get_formal_tmp_var (t, &list); |
953ff289 DN |
2862 | |
2863 | t = build2 (PLUS_EXPR, utype, s0, fd->chunk_size); | |
2864 | t = build2 (MIN_EXPR, utype, t, n); | |
50674e96 | 2865 | e0 = get_formal_tmp_var (t, &list); |
953ff289 DN |
2866 | |
2867 | t = build2 (LT_EXPR, boolean_type_node, s0, n); | |
2868 | t = build3 (COND_EXPR, void_type_node, t, | |
2869 | build_and_jump (&l1), build_and_jump (&l4)); | |
50674e96 DN |
2870 | append_to_statement_list (t, &list); |
2871 | ||
2872 | iter_part_bb = create_empty_bb (entry_bb); | |
2873 | si = bsi_start (iter_part_bb); | |
2874 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
2875 | ||
2876 | /* Setup code for sequential iteration goes in SEQ_START_BB. */ | |
2877 | list = alloc_stmt_list (); | |
953ff289 DN |
2878 | |
2879 | t = build1 (LABEL_EXPR, void_type_node, l1); | |
50674e96 | 2880 | gimplify_and_add (t, &list); |
953ff289 DN |
2881 | |
2882 | t = fold_convert (type, s0); | |
2883 | t = build2 (MULT_EXPR, type, t, fd->step); | |
2884 | t = build2 (PLUS_EXPR, type, t, fd->n1); | |
2885 | t = build2 (MODIFY_EXPR, void_type_node, fd->v, t); | |
50674e96 | 2886 | gimplify_and_add (t, &list); |
953ff289 DN |
2887 | |
2888 | t = fold_convert (type, e0); | |
2889 | t = build2 (MULT_EXPR, type, t, fd->step); | |
2890 | t = build2 (PLUS_EXPR, type, t, fd->n1); | |
50674e96 DN |
2891 | e = get_formal_tmp_var (t, &list); |
2892 | ||
2893 | seq_start_bb = create_empty_bb (iter_part_bb); | |
2894 | si = bsi_start (seq_start_bb); | |
2895 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
953ff289 | 2896 | |
50674e96 DN |
2897 | /* Main loop body goes in BODY_BB. */ |
2898 | si = bsi_start (body_bb); | |
953ff289 | 2899 | t = build1 (LABEL_EXPR, void_type_node, l2); |
50674e96 | 2900 | bsi_insert_before (&si, t, BSI_CONTINUE_LINKING); |
953ff289 | 2901 | |
50674e96 DN |
2902 | /* Split EXIT_BB. The code controlling the sequential loop goes in |
2903 | the first half. The trip update code goes into the second half | |
2904 | (TRIP_UPDATE_BB). */ | |
2905 | list = alloc_stmt_list (); | |
953ff289 DN |
2906 | |
2907 | t = build2 (PLUS_EXPR, type, fd->v, fd->step); | |
2908 | t = build2 (MODIFY_EXPR, void_type_node, fd->v, t); | |
50674e96 | 2909 | gimplify_and_add (t, &list); |
953ff289 DN |
2910 | |
2911 | t = build2 (fd->cond_code, boolean_type_node, fd->v, e); | |
50674e96 | 2912 | t = get_formal_tmp_var (t, &list); |
953ff289 DN |
2913 | t = build3 (COND_EXPR, void_type_node, t, |
2914 | build_and_jump (&l2), build_and_jump (&l3)); | |
50674e96 DN |
2915 | append_to_statement_list (t, &list); |
2916 | ||
2917 | si = bsi_last (exit_bb); | |
2918 | t = bsi_stmt (si); | |
2919 | gcc_assert (t && TREE_CODE (t) == OMP_RETURN_EXPR); | |
2920 | bsi_remove (&si, true); | |
2921 | exit_edge = split_block (exit_bb, t); | |
2922 | si = bsi_last (exit_bb); | |
2923 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
2924 | ||
2925 | /* Trip update code goes into TRIP_UPDATE_BB. */ | |
2926 | trip_update_bb = exit_edge->dest; | |
2927 | list = alloc_stmt_list (); | |
953ff289 DN |
2928 | |
2929 | t = build1 (LABEL_EXPR, void_type_node, l3); | |
50674e96 | 2930 | gimplify_and_add (t, &list); |
953ff289 DN |
2931 | |
2932 | t = build_int_cst (utype, 1); | |
2933 | t = build2 (PLUS_EXPR, utype, trip, t); | |
2934 | t = build2 (MODIFY_EXPR, void_type_node, trip, t); | |
50674e96 | 2935 | gimplify_and_add (t, &list); |
953ff289 | 2936 | |
50674e96 DN |
2937 | si = bsi_start (trip_update_bb); |
2938 | bsi_insert_after (&si, list, BSI_CONTINUE_LINKING); | |
2939 | exit_edge = single_succ_edge (trip_update_bb); | |
2940 | exit_edge->flags = EDGE_FALLTHRU; | |
2941 | new_exit_bb = exit_edge->dest; | |
953ff289 | 2942 | |
50674e96 | 2943 | /* Insert exit label on EXIT_EDGE. */ |
953ff289 | 2944 | t = build1 (LABEL_EXPR, void_type_node, l4); |
50674e96 | 2945 | bsi_insert_on_edge_immediate (exit_edge, t); |
953ff289 | 2946 | |
50674e96 DN |
2947 | /* Connect the new blocks. */ |
2948 | remove_edge (single_succ_edge (entry_bb)); | |
2949 | make_edge (entry_bb, iter_part_bb, EDGE_FALLTHRU); | |
953ff289 | 2950 | |
50674e96 DN |
2951 | make_edge (iter_part_bb, seq_start_bb, EDGE_TRUE_VALUE); |
2952 | make_edge (iter_part_bb, new_exit_bb, EDGE_FALSE_VALUE); | |
2953 | remove_edge (exit_edge); | |
2954 | ||
2955 | make_edge (seq_start_bb, body_bb, EDGE_FALLTHRU); | |
2956 | ||
2957 | make_edge (exit_bb, body_bb, EDGE_TRUE_VALUE); | |
2958 | find_edge (exit_bb, trip_update_bb)->flags = EDGE_FALSE_VALUE; | |
2959 | ||
2960 | make_edge (trip_update_bb, iter_part_bb, EDGE_FALLTHRU); | |
2961 | ||
2962 | return new_exit_bb; | |
953ff289 DN |
2963 | } |
2964 | ||
953ff289 | 2965 | |
50674e96 | 2966 | /* Expand the OpenMP loop defined by REGION. */ |
953ff289 | 2967 | |
50674e96 DN |
2968 | static void |
2969 | expand_omp_for (struct omp_region *region) | |
2970 | { | |
2971 | struct omp_for_data fd; | |
2972 | basic_block last_bb = NULL; | |
953ff289 | 2973 | |
50674e96 | 2974 | push_gimplify_context (); |
953ff289 | 2975 | |
50674e96 | 2976 | extract_omp_for_data (region->entry, &fd); |
953ff289 DN |
2977 | |
2978 | if (fd.sched_kind == OMP_CLAUSE_SCHEDULE_STATIC && !fd.have_ordered) | |
2979 | { | |
2980 | if (fd.chunk_size == NULL) | |
50674e96 | 2981 | last_bb = expand_omp_for_static_nochunk (region, &fd); |
953ff289 | 2982 | else |
50674e96 | 2983 | last_bb = expand_omp_for_static_chunk (region, &fd); |
953ff289 DN |
2984 | } |
2985 | else | |
2986 | { | |
50674e96 DN |
2987 | int fn_index = fd.sched_kind + fd.have_ordered * 4; |
2988 | int start_ix = BUILT_IN_GOMP_LOOP_STATIC_START + fn_index; | |
2989 | int next_ix = BUILT_IN_GOMP_LOOP_STATIC_NEXT + fn_index; | |
2990 | last_bb = expand_omp_for_generic (region, &fd, start_ix, next_ix); | |
953ff289 DN |
2991 | } |
2992 | ||
50674e96 | 2993 | pop_gimplify_context (NULL); |
953ff289 DN |
2994 | } |
2995 | ||
953ff289 DN |
2996 | |
2997 | /* Expand code for an OpenMP sections directive. In pseudo code, we generate | |
2998 | ||
953ff289 DN |
2999 | v = GOMP_sections_start (n); |
3000 | L0: | |
3001 | switch (v) | |
3002 | { | |
3003 | case 0: | |
3004 | goto L2; | |
3005 | case 1: | |
3006 | section 1; | |
3007 | goto L1; | |
3008 | case 2: | |
3009 | ... | |
3010 | case n: | |
3011 | ... | |
953ff289 DN |
3012 | default: |
3013 | abort (); | |
3014 | } | |
3015 | L1: | |
3016 | v = GOMP_sections_next (); | |
3017 | goto L0; | |
3018 | L2: | |
3019 | reduction; | |
3020 | ||
50674e96 DN |
3021 | If this is a combined parallel sections, replace the call to |
3022 | GOMP_sections_start with 'goto L1'. */ | |
953ff289 DN |
3023 | |
3024 | static void | |
50674e96 | 3025 | expand_omp_sections (struct omp_region *region) |
953ff289 | 3026 | { |
50674e96 | 3027 | tree label_vec, l0, l1, l2, t, u, v; |
953ff289 | 3028 | unsigned i, len; |
50674e96 DN |
3029 | basic_block entry_bb, exit_bb, l0_bb, l1_bb, default_bb; |
3030 | edge e, entry_edge, exit_edge; | |
3031 | edge_iterator ei; | |
3032 | block_stmt_iterator si; | |
953ff289 | 3033 | |
50674e96 DN |
3034 | entry_bb = bb_for_stmt (region->entry); |
3035 | exit_bb = bb_for_stmt (region->exit); | |
953ff289 DN |
3036 | |
3037 | l0 = create_artificial_label (); | |
3038 | l1 = create_artificial_label (); | |
3039 | l2 = create_artificial_label (); | |
50674e96 | 3040 | |
953ff289 | 3041 | v = create_tmp_var (unsigned_type_node, ".section"); |
50674e96 DN |
3042 | |
3043 | /* We will build a switch() with enough cases for all the | |
3044 | OMP_SECTION regions, a '0' case to handle the end of more work | |
3045 | and a default case to abort if something goes wrong. */ | |
3046 | len = EDGE_COUNT (entry_bb->succs); | |
953ff289 DN |
3047 | label_vec = make_tree_vec (len + 2); |
3048 | ||
50674e96 DN |
3049 | /* Split ENTRY_BB. The call to GOMP_sections_start goes in the |
3050 | first half. The second half contains the switch(). */ | |
3051 | si = bsi_last (entry_bb); | |
3052 | t = bsi_stmt (si); | |
3053 | gcc_assert (t && TREE_CODE (t) == OMP_SECTIONS); | |
3054 | bsi_remove (&si, true); | |
3055 | entry_edge = split_block (entry_bb, t); | |
3056 | l0_bb = entry_edge->dest; | |
953ff289 | 3057 | |
50674e96 | 3058 | if (!is_combined_parallel (region)) |
953ff289 | 3059 | { |
50674e96 DN |
3060 | /* If we are not inside a combined parallel+sections region, |
3061 | call GOMP_sections_start. */ | |
3062 | t = build_int_cst (unsigned_type_node, len); | |
3063 | t = tree_cons (NULL, t, NULL); | |
953ff289 DN |
3064 | u = built_in_decls[BUILT_IN_GOMP_SECTIONS_START]; |
3065 | t = build_function_call_expr (u, t); | |
3066 | t = build2 (MODIFY_EXPR, void_type_node, v, t); | |
50674e96 DN |
3067 | si = bsi_last (entry_bb); |
3068 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
953ff289 DN |
3069 | } |
3070 | ||
50674e96 DN |
3071 | /* The switch() statement replacing OMP_SECTIONS goes in L0_BB. */ |
3072 | si = bsi_last (l0_bb); | |
953ff289 | 3073 | |
50674e96 DN |
3074 | t = build1 (LABEL_EXPR, void_type_node, l0); |
3075 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
953ff289 DN |
3076 | |
3077 | t = build3 (SWITCH_EXPR, void_type_node, v, NULL, label_vec); | |
50674e96 | 3078 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); |
953ff289 DN |
3079 | |
3080 | t = build3 (CASE_LABEL_EXPR, void_type_node, | |
3081 | build_int_cst (unsigned_type_node, 0), NULL, l2); | |
3082 | TREE_VEC_ELT (label_vec, 0) = t; | |
3083 | ||
50674e96 DN |
3084 | /* Convert each OMP_SECTION into a CASE_LABEL_EXPR. */ |
3085 | i = 1; | |
3086 | FOR_EACH_EDGE (e, ei, l0_bb->succs) | |
953ff289 | 3087 | { |
50674e96 DN |
3088 | basic_block s_entry_bb, s_exit_bb; |
3089 | ||
3090 | e->flags = 0; | |
3091 | s_entry_bb = e->dest; | |
3092 | si = bsi_last (s_entry_bb); | |
3093 | t = bsi_stmt (si); | |
3094 | gcc_assert (t && TREE_CODE (t) == OMP_SECTION); | |
3095 | s_exit_bb = bb_for_stmt (lookup_omp_region (t)->exit); | |
3096 | bsi_remove (&si, true); | |
953ff289 DN |
3097 | |
3098 | t = create_artificial_label (); | |
50674e96 | 3099 | u = build_int_cst (unsigned_type_node, i); |
953ff289 | 3100 | u = build3 (CASE_LABEL_EXPR, void_type_node, u, NULL, t); |
50674e96 | 3101 | TREE_VEC_ELT (label_vec, i) = u; |
953ff289 | 3102 | t = build1 (LABEL_EXPR, void_type_node, t); |
50674e96 DN |
3103 | si = bsi_last (s_entry_bb); |
3104 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
3105 | i++; | |
3106 | single_succ_edge (s_entry_bb)->flags = EDGE_FALLTHRU; | |
3107 | ||
3108 | si = bsi_last (s_exit_bb); | |
3109 | t = bsi_stmt (si); | |
3110 | gcc_assert (t && TREE_CODE (t) == OMP_RETURN_EXPR); | |
3111 | bsi_remove (&si, true); | |
3112 | single_succ_edge (s_exit_bb)->flags = EDGE_FALLTHRU; | |
953ff289 DN |
3113 | } |
3114 | ||
50674e96 DN |
3115 | /* Error handling code goes in DEFAULT_BB. */ |
3116 | default_bb = create_empty_bb (entry_bb); | |
3117 | si = bsi_start (default_bb); | |
953ff289 DN |
3118 | t = create_artificial_label (); |
3119 | u = build3 (CASE_LABEL_EXPR, void_type_node, NULL, NULL, t); | |
3120 | TREE_VEC_ELT (label_vec, len + 1) = u; | |
3121 | t = build1 (LABEL_EXPR, void_type_node, t); | |
50674e96 | 3122 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); |
953ff289 DN |
3123 | |
3124 | t = built_in_decls[BUILT_IN_TRAP]; | |
3125 | t = build_function_call_expr (t, NULL); | |
50674e96 DN |
3126 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); |
3127 | ||
3128 | make_edge (l0_bb, default_bb, 0); | |
3129 | ||
3130 | /* Code to get the next section goes in L1_BB. */ | |
3131 | si = bsi_last (exit_bb); | |
3132 | t = bsi_stmt (si); | |
3133 | gcc_assert (t && TREE_CODE (t) == OMP_RETURN_EXPR); | |
3134 | bsi_remove (&si, true); | |
3135 | exit_edge = split_block (exit_bb, t); | |
3136 | l1_bb = exit_edge->src; | |
3137 | exit_bb = exit_edge->dest; | |
3138 | si = bsi_start (l1_bb); | |
953ff289 | 3139 | t = build1 (LABEL_EXPR, void_type_node, l1); |
50674e96 | 3140 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); |
953ff289 | 3141 | |
50674e96 DN |
3142 | t = built_in_decls[BUILT_IN_GOMP_SECTIONS_NEXT]; |
3143 | t = build_function_call_expr (t, NULL); | |
3144 | t = build2 (MODIFY_EXPR, void_type_node, v, t); | |
3145 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
3146 | ||
3147 | remove_edge (single_succ_edge (l1_bb)); | |
3148 | make_edge (l1_bb, l0_bb, EDGE_FALLTHRU); | |
3149 | ||
3150 | /* Exit label in EXIT_BB. */ | |
3151 | si = bsi_last (exit_bb); | |
3152 | t = build1 (LABEL_EXPR, void_type_node, l2); | |
3153 | bsi_insert_after (&si, t, BSI_CONTINUE_LINKING); | |
3154 | ||
3155 | make_edge (l0_bb, exit_bb, 0); | |
3156 | single_succ_edge (exit_bb)->flags = EDGE_FALLTHRU; | |
3157 | ||
3158 | if (is_combined_parallel (region)) | |
953ff289 | 3159 | { |
50674e96 DN |
3160 | /* If this was a combined parallel+sections region, we did not |
3161 | emit a GOMP_sections_start in the entry block, so we just | |
3162 | need to jump to L1_BB to get the next section. */ | |
3163 | remove_edge (single_succ_edge (entry_bb)); | |
3164 | make_edge (entry_bb, l1_bb, EDGE_FALLTHRU); | |
953ff289 | 3165 | } |
50674e96 | 3166 | } |
953ff289 | 3167 | |
953ff289 | 3168 | |
50674e96 DN |
3169 | /* Generic expansion for OpenMP synchronization directives: single, |
3170 | master, ordered and critical. All we need to do here is remove the | |
3171 | entry and exit markers for REGION. */ | |
3172 | ||
3173 | static void | |
3174 | expand_omp_synch (struct omp_region *region) | |
3175 | { | |
3176 | basic_block entry_bb, exit_bb; | |
3177 | block_stmt_iterator si; | |
3178 | tree t; | |
3179 | ||
3180 | entry_bb = bb_for_stmt (region->entry); | |
3181 | exit_bb = bb_for_stmt (region->exit); | |
3182 | ||
3183 | si = bsi_last (entry_bb); | |
3184 | t = bsi_stmt (si); | |
3185 | gcc_assert (t | |
3186 | && (TREE_CODE (t) == OMP_SINGLE | |
3187 | || TREE_CODE (t) == OMP_MASTER | |
3188 | || TREE_CODE (t) == OMP_ORDERED | |
3189 | || TREE_CODE (t) == OMP_CRITICAL)); | |
3190 | bsi_remove (&si, true); | |
3191 | single_succ_edge (entry_bb)->flags = EDGE_FALLTHRU; | |
3192 | ||
3193 | si = bsi_last (exit_bb); | |
3194 | t = bsi_stmt (si); | |
3195 | gcc_assert (t && TREE_CODE (t) == OMP_RETURN_EXPR); | |
3196 | bsi_remove (&si, true); | |
3197 | single_succ_edge (exit_bb)->flags = EDGE_FALLTHRU; | |
3198 | } | |
953ff289 | 3199 | |
953ff289 | 3200 | |
50674e96 DN |
3201 | /* Expand the parallel region tree rooted at REGION. Expansion |
3202 | proceeds in depth-first order. Innermost regions are expanded | |
3203 | first. This way, parallel regions that require a new function to | |
3204 | be created (e.g., OMP_PARALLEL) can be expanded without having any | |
3205 | internal dependencies in their body. */ | |
3206 | ||
3207 | static void | |
3208 | expand_omp (struct omp_region *region) | |
3209 | { | |
3210 | while (region) | |
3211 | { | |
3212 | enum tree_code code = TREE_CODE (region->entry); | |
3213 | ||
3214 | if (region->inner) | |
3215 | expand_omp (region->inner); | |
3216 | ||
3217 | switch (code) | |
3218 | { | |
3219 | case OMP_PARALLEL: | |
3220 | expand_omp_parallel (region); | |
3221 | break; | |
3222 | ||
3223 | case OMP_FOR: | |
3224 | expand_omp_for (region); | |
3225 | break; | |
3226 | ||
3227 | case OMP_SECTIONS: | |
3228 | expand_omp_sections (region); | |
3229 | break; | |
3230 | ||
3231 | case OMP_SECTION: | |
3232 | /* Individual omp sections are handled together with their | |
3233 | parent OMP_SECTIONS region. */ | |
3234 | break; | |
3235 | ||
3236 | case OMP_SINGLE: | |
3237 | case OMP_MASTER: | |
3238 | case OMP_ORDERED: | |
3239 | case OMP_CRITICAL: | |
3240 | expand_omp_synch (region); | |
3241 | break; | |
3242 | ||
3243 | default: | |
3244 | gcc_unreachable (); | |
3245 | } | |
3246 | ||
3247 | region = region->next; | |
3248 | } | |
3249 | } | |
3250 | ||
3251 | ||
3252 | /* Helper for build_omp_regions. Scan the dominator tree starting at | |
3253 | block BB. PARENT is the region that contains BB. */ | |
3254 | ||
3255 | static void | |
3256 | build_omp_regions_1 (basic_block bb, struct omp_region *parent) | |
3257 | { | |
3258 | block_stmt_iterator si; | |
3259 | tree stmt; | |
3260 | basic_block son; | |
3261 | ||
3262 | si = bsi_last (bb); | |
3263 | if (!bsi_end_p (si) && OMP_DIRECTIVE_P (bsi_stmt (si))) | |
3264 | { | |
3265 | struct omp_region *region; | |
3266 | ||
3267 | stmt = bsi_stmt (si); | |
3268 | ||
3269 | if (TREE_CODE (stmt) == OMP_RETURN_EXPR) | |
3270 | { | |
3271 | /* STMT is the return point out of region PARENT. Mark it | |
3272 | as the exit point and make PARENT the immediately | |
3273 | enclosing region. */ | |
3274 | gcc_assert (parent); | |
3275 | region = parent; | |
3276 | region->exit = stmt; | |
3277 | parent = parent->outer; | |
3278 | ||
3279 | /* If REGION is a parallel region, determine whether it is | |
3280 | a combined parallel+workshare region. */ | |
3281 | if (TREE_CODE (region->entry) == OMP_PARALLEL) | |
3282 | determine_parallel_type (region); | |
3283 | } | |
3284 | else | |
3285 | { | |
3286 | /* Otherwise, this directive becomes the parent for a new | |
3287 | region. */ | |
3288 | region = new_omp_region (stmt, parent); | |
3289 | parent = region; | |
3290 | } | |
3291 | ||
3292 | gcc_assert (region); | |
3293 | if (omp_regions == NULL) | |
3294 | { | |
3295 | omp_regions = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
3296 | root_omp_region = region; | |
3297 | } | |
3298 | ||
3299 | splay_tree_insert (omp_regions, (splay_tree_key) stmt, | |
3300 | (splay_tree_value) region); | |
3301 | } | |
3302 | ||
3303 | for (son = first_dom_son (CDI_DOMINATORS, bb); | |
3304 | son; | |
3305 | son = next_dom_son (CDI_DOMINATORS, son)) | |
3306 | build_omp_regions_1 (son, parent); | |
3307 | } | |
3308 | ||
3309 | ||
3310 | /* Scan the CFG and build a tree of OMP regions. Return the root of | |
3311 | the OMP region tree. */ | |
3312 | ||
3313 | static void | |
3314 | build_omp_regions (void) | |
3315 | { | |
3316 | gcc_assert (omp_regions == NULL && root_omp_region == NULL); | |
3317 | calculate_dominance_info (CDI_DOMINATORS); | |
3318 | build_omp_regions_1 (ENTRY_BLOCK_PTR, NULL); | |
3319 | } | |
3320 | ||
3321 | ||
3322 | /* Main entry point for expanding OMP-GIMPLE into runtime calls. */ | |
3323 | ||
3324 | static void | |
3325 | execute_expand_omp (void) | |
3326 | { | |
3327 | build_omp_regions (); | |
3328 | ||
3329 | if (root_omp_region) | |
3330 | { | |
3331 | if (dump_file) | |
3332 | { | |
3333 | fprintf (dump_file, "\nOMP region tree\n\n"); | |
3334 | dump_omp_region (dump_file, root_omp_region, 0); | |
3335 | fprintf (dump_file, "\n"); | |
3336 | } | |
3337 | ||
3338 | expand_omp (root_omp_region); | |
3339 | splay_tree_delete (omp_regions); | |
3340 | root_omp_region = NULL; | |
3341 | omp_regions = NULL; | |
3342 | free_dominance_info (CDI_DOMINATORS); | |
3343 | free_dominance_info (CDI_POST_DOMINATORS); | |
3344 | } | |
3345 | ||
3346 | /* Expansion adds basic blocks that may be merged. */ | |
3347 | cleanup_tree_cfg (); | |
3348 | } | |
3349 | ||
3350 | static bool | |
3351 | gate_expand_omp (void) | |
3352 | { | |
3353 | return flag_openmp != 0 && errorcount == 0; | |
3354 | } | |
3355 | ||
3356 | struct tree_opt_pass pass_expand_omp = | |
3357 | { | |
3358 | "ompexp", /* name */ | |
3359 | gate_expand_omp, /* gate */ | |
3360 | execute_expand_omp, /* execute */ | |
3361 | NULL, /* sub */ | |
3362 | NULL, /* next */ | |
3363 | 0, /* static_pass_number */ | |
3364 | 0, /* tv_id */ | |
3365 | PROP_gimple_any, /* properties_required */ | |
3366 | PROP_gimple_lomp, /* properties_provided */ | |
3367 | 0, /* properties_destroyed */ | |
3368 | 0, /* todo_flags_start */ | |
3369 | TODO_dump_func, /* todo_flags_finish */ | |
3370 | 0 /* letter */ | |
3371 | }; | |
3372 | \f | |
3373 | /* Routines to lower OpenMP directives into OMP-GIMPLE. */ | |
3374 | ||
3375 | /* Lower the OpenMP sections directive in *STMT_P. */ | |
3376 | ||
3377 | static void | |
3378 | lower_omp_sections (tree *stmt_p, omp_context *ctx) | |
3379 | { | |
3380 | tree new_stmt, stmt, body, bind, block, ilist, olist, new_body; | |
3381 | tree dlist, region_exit; | |
3382 | tree_stmt_iterator tsi; | |
3383 | unsigned i, len; | |
3384 | ||
3385 | stmt = *stmt_p; | |
3386 | ||
3387 | gcc_assert (OMP_SECTIONS_SECTIONS (stmt) == NULL_TREE); | |
3388 | ||
3389 | push_gimplify_context (); | |
3390 | ||
3391 | dlist = NULL; | |
3392 | ilist = NULL; | |
3393 | lower_rec_input_clauses (OMP_SECTIONS_CLAUSES (stmt), &ilist, &dlist, ctx); | |
3394 | ||
3395 | tsi = tsi_start (OMP_SECTIONS_BODY (stmt)); | |
3396 | for (len = 0; !tsi_end_p (tsi); len++, tsi_next (&tsi)) | |
3397 | continue; | |
3398 | ||
3399 | /* There are two markers per section and one end marker for the | |
3400 | whole construct. */ | |
3401 | OMP_SECTIONS_SECTIONS (stmt) = make_tree_vec (2 * len + 1); | |
3402 | ||
3403 | tsi = tsi_start (OMP_SECTIONS_BODY (stmt)); | |
3404 | body = alloc_stmt_list (); | |
3405 | for (i = 0; i < len; i++, tsi_next (&tsi)) | |
3406 | { | |
3407 | omp_context *sctx; | |
3408 | tree sec_start, sec_end, sec_body; | |
3409 | ||
3410 | sec_start = tsi_stmt (tsi); | |
3411 | sec_body = alloc_stmt_list (); | |
3412 | sctx = maybe_lookup_ctx (sec_start); | |
3413 | gcc_assert (sctx); | |
3414 | ||
3415 | lower_omp (&OMP_SECTION_BODY (sec_start), sctx); | |
3416 | append_to_statement_list (OMP_SECTION_BODY (sec_start), &sec_body); | |
3417 | ||
3418 | if (i == len - 1) | |
3419 | { | |
3420 | tree l = alloc_stmt_list (); | |
3421 | lower_lastprivate_clauses (OMP_SECTIONS_CLAUSES (stmt), NULL, | |
3422 | &l, ctx); | |
3423 | append_to_statement_list (l, &sec_body); | |
3424 | } | |
3425 | ||
3426 | sec_end = make_node (OMP_RETURN_EXPR); | |
3427 | ||
3428 | OMP_SECTION_BODY (sec_start) = sec_body; | |
3429 | append_to_statement_list (sec_start, &body); | |
3430 | append_to_statement_list (sec_end, &body); | |
3431 | ||
3432 | TREE_VEC_ELT (OMP_SECTIONS_SECTIONS (stmt), i * 2) = sec_start; | |
3433 | TREE_VEC_ELT (OMP_SECTIONS_SECTIONS (stmt), i * 2 + 1) = sec_end; | |
3434 | } | |
953ff289 DN |
3435 | |
3436 | block = make_node (BLOCK); | |
50674e96 | 3437 | bind = build3 (BIND_EXPR, void_type_node, NULL, body, block); |
953ff289 | 3438 | maybe_catch_exception (&BIND_EXPR_BODY (bind)); |
953ff289 | 3439 | |
50674e96 DN |
3440 | olist = NULL_TREE; |
3441 | lower_reduction_clauses (OMP_SECTIONS_CLAUSES (stmt), &olist, ctx); | |
3442 | ||
3443 | /* Unless there's a nowait clause, add a barrier afterward. */ | |
3444 | if (!find_omp_clause (OMP_SECTIONS_CLAUSES (stmt), OMP_CLAUSE_NOWAIT)) | |
3445 | build_omp_barrier (&olist); | |
3446 | ||
3447 | pop_gimplify_context (NULL_TREE); | |
3448 | record_vars_into (ctx->block_vars, ctx->cb.dst_fn); | |
3449 | ||
3450 | new_stmt = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL); | |
3451 | TREE_SIDE_EFFECTS (new_stmt) = 1; | |
3452 | OMP_SECTIONS_BODY (stmt) = body; | |
3453 | ||
3454 | region_exit = make_node (OMP_RETURN_EXPR); | |
3455 | ||
3456 | new_body = alloc_stmt_list (); | |
3457 | append_to_statement_list (ilist, &new_body); | |
3458 | append_to_statement_list (stmt, &new_body); | |
3459 | append_to_statement_list (region_exit, &new_body); | |
3460 | append_to_statement_list (olist, &new_body); | |
3461 | append_to_statement_list (dlist, &new_body); | |
3462 | BIND_EXPR_BODY (new_stmt) = new_body; | |
3463 | ||
3464 | TREE_VEC_ELT (OMP_SECTIONS_SECTIONS (stmt), 2 * len) = region_exit; | |
3465 | ||
3466 | *stmt_p = new_stmt; | |
953ff289 DN |
3467 | } |
3468 | ||
3469 | ||
50674e96 | 3470 | /* A subroutine of lower_omp_single. Expand the simple form of |
953ff289 DN |
3471 | an OMP_SINGLE, without a copyprivate clause: |
3472 | ||
3473 | if (GOMP_single_start ()) | |
3474 | BODY; | |
3475 | [ GOMP_barrier (); ] -> unless 'nowait' is present. | |
50674e96 DN |
3476 | |
3477 | FIXME. It may be better to delay expanding the logic of this until | |
3478 | pass_expand_omp. The expanded logic may make the job more difficult | |
3479 | to a synchronization analysis pass. */ | |
953ff289 DN |
3480 | |
3481 | static void | |
50674e96 | 3482 | lower_omp_single_simple (tree single_stmt, tree *pre_p) |
953ff289 DN |
3483 | { |
3484 | tree t; | |
3485 | ||
3486 | t = built_in_decls[BUILT_IN_GOMP_SINGLE_START]; | |
3487 | t = build_function_call_expr (t, NULL); | |
3488 | t = build3 (COND_EXPR, void_type_node, t, | |
3489 | OMP_SINGLE_BODY (single_stmt), NULL); | |
3490 | gimplify_and_add (t, pre_p); | |
3491 | ||
3492 | if (!find_omp_clause (OMP_SINGLE_CLAUSES (single_stmt), OMP_CLAUSE_NOWAIT)) | |
3493 | build_omp_barrier (pre_p); | |
3494 | } | |
3495 | ||
50674e96 DN |
3496 | |
3497 | /* A subroutine of lower_omp_single. Expand the simple form of | |
953ff289 DN |
3498 | an OMP_SINGLE, with a copyprivate clause: |
3499 | ||
3500 | #pragma omp single copyprivate (a, b, c) | |
3501 | ||
3502 | Create a new structure to hold copies of 'a', 'b' and 'c' and emit: | |
3503 | ||
3504 | { | |
3505 | if ((copyout_p = GOMP_single_copy_start ()) == NULL) | |
3506 | { | |
3507 | BODY; | |
3508 | copyout.a = a; | |
3509 | copyout.b = b; | |
3510 | copyout.c = c; | |
3511 | GOMP_single_copy_end (©out); | |
3512 | } | |
3513 | else | |
3514 | { | |
3515 | a = copyout_p->a; | |
3516 | b = copyout_p->b; | |
3517 | c = copyout_p->c; | |
3518 | } | |
3519 | GOMP_barrier (); | |
3520 | } | |
50674e96 DN |
3521 | |
3522 | FIXME. It may be better to delay expanding the logic of this until | |
3523 | pass_expand_omp. The expanded logic may make the job more difficult | |
3524 | to a synchronization analysis pass. */ | |
953ff289 DN |
3525 | |
3526 | static void | |
50674e96 | 3527 | lower_omp_single_copy (tree single_stmt, tree *pre_p, omp_context *ctx) |
953ff289 DN |
3528 | { |
3529 | tree ptr_type, t, args, l0, l1, l2, copyin_seq; | |
3530 | ||
3531 | ctx->sender_decl = create_tmp_var (ctx->record_type, ".omp_copy_o"); | |
3532 | ||
3533 | ptr_type = build_pointer_type (ctx->record_type); | |
3534 | ctx->receiver_decl = create_tmp_var (ptr_type, ".omp_copy_i"); | |
3535 | ||
3536 | l0 = create_artificial_label (); | |
3537 | l1 = create_artificial_label (); | |
3538 | l2 = create_artificial_label (); | |
3539 | ||
3540 | t = built_in_decls[BUILT_IN_GOMP_SINGLE_COPY_START]; | |
3541 | t = build_function_call_expr (t, NULL); | |
3542 | t = fold_convert (ptr_type, t); | |
3543 | t = build2 (MODIFY_EXPR, void_type_node, ctx->receiver_decl, t); | |
3544 | gimplify_and_add (t, pre_p); | |
3545 | ||
3546 | t = build2 (EQ_EXPR, boolean_type_node, ctx->receiver_decl, | |
3547 | build_int_cst (ptr_type, 0)); | |
3548 | t = build3 (COND_EXPR, void_type_node, t, | |
3549 | build_and_jump (&l0), build_and_jump (&l1)); | |
3550 | gimplify_and_add (t, pre_p); | |
3551 | ||
3552 | t = build1 (LABEL_EXPR, void_type_node, l0); | |
3553 | gimplify_and_add (t, pre_p); | |
3554 | ||
3555 | append_to_statement_list (OMP_SINGLE_BODY (single_stmt), pre_p); | |
3556 | ||
3557 | copyin_seq = NULL; | |
50674e96 | 3558 | lower_copyprivate_clauses (OMP_SINGLE_CLAUSES (single_stmt), pre_p, |
953ff289 DN |
3559 | ©in_seq, ctx); |
3560 | ||
3561 | t = build_fold_addr_expr (ctx->sender_decl); | |
3562 | args = tree_cons (NULL, t, NULL); | |
3563 | t = built_in_decls[BUILT_IN_GOMP_SINGLE_COPY_END]; | |
3564 | t = build_function_call_expr (t, args); | |
3565 | gimplify_and_add (t, pre_p); | |
3566 | ||
3567 | t = build_and_jump (&l2); | |
3568 | gimplify_and_add (t, pre_p); | |
3569 | ||
3570 | t = build1 (LABEL_EXPR, void_type_node, l1); | |
3571 | gimplify_and_add (t, pre_p); | |
3572 | ||
3573 | append_to_statement_list (copyin_seq, pre_p); | |
3574 | ||
3575 | t = build1 (LABEL_EXPR, void_type_node, l2); | |
3576 | gimplify_and_add (t, pre_p); | |
3577 | ||
3578 | build_omp_barrier (pre_p); | |
3579 | } | |
3580 | ||
50674e96 | 3581 | |
953ff289 DN |
3582 | /* Expand code for an OpenMP single directive. */ |
3583 | ||
3584 | static void | |
50674e96 | 3585 | lower_omp_single (tree *stmt_p, omp_context *ctx) |
953ff289 | 3586 | { |
50674e96 | 3587 | tree t, bind, block, single_stmt = *stmt_p, dlist; |
953ff289 DN |
3588 | |
3589 | push_gimplify_context (); | |
3590 | ||
3591 | block = make_node (BLOCK); | |
3592 | bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, block); | |
50674e96 | 3593 | TREE_SIDE_EFFECTS (bind) = 1; |
953ff289 | 3594 | |
50674e96 DN |
3595 | lower_rec_input_clauses (OMP_SINGLE_CLAUSES (single_stmt), |
3596 | &BIND_EXPR_BODY (bind), &dlist, ctx); | |
3597 | lower_omp (&OMP_SINGLE_BODY (single_stmt), ctx); | |
953ff289 DN |
3598 | |
3599 | if (ctx->record_type) | |
50674e96 | 3600 | lower_omp_single_copy (single_stmt, &BIND_EXPR_BODY (bind), ctx); |
953ff289 | 3601 | else |
50674e96 | 3602 | lower_omp_single_simple (single_stmt, &BIND_EXPR_BODY (bind)); |
953ff289 DN |
3603 | |
3604 | append_to_statement_list (dlist, &BIND_EXPR_BODY (bind)); | |
50674e96 DN |
3605 | t = make_node (OMP_RETURN_EXPR); |
3606 | append_to_statement_list (t, &BIND_EXPR_BODY (bind)); | |
953ff289 DN |
3607 | maybe_catch_exception (&BIND_EXPR_BODY (bind)); |
3608 | pop_gimplify_context (bind); | |
50674e96 | 3609 | |
953ff289 DN |
3610 | BIND_EXPR_VARS (bind) = chainon (BIND_EXPR_VARS (bind), ctx->block_vars); |
3611 | BLOCK_VARS (block) = BIND_EXPR_VARS (bind); | |
50674e96 DN |
3612 | |
3613 | OMP_SINGLE_BODY (single_stmt) = alloc_stmt_list (); | |
3614 | append_to_statement_list (bind, &OMP_SINGLE_BODY (single_stmt)); | |
953ff289 DN |
3615 | } |
3616 | ||
50674e96 | 3617 | |
953ff289 DN |
3618 | /* Expand code for an OpenMP master directive. */ |
3619 | ||
3620 | static void | |
50674e96 | 3621 | lower_omp_master (tree *stmt_p, omp_context *ctx) |
953ff289 DN |
3622 | { |
3623 | tree bind, block, stmt = *stmt_p, lab = NULL, x; | |
3624 | ||
3625 | push_gimplify_context (); | |
3626 | ||
3627 | block = make_node (BLOCK); | |
3628 | bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, block); | |
50674e96 | 3629 | TREE_SIDE_EFFECTS (bind) = 1; |
953ff289 DN |
3630 | |
3631 | x = built_in_decls[BUILT_IN_OMP_GET_THREAD_NUM]; | |
3632 | x = build_function_call_expr (x, NULL); | |
3633 | x = build2 (EQ_EXPR, boolean_type_node, x, integer_zero_node); | |
3634 | x = build3 (COND_EXPR, void_type_node, x, NULL, build_and_jump (&lab)); | |
3635 | gimplify_and_add (x, &BIND_EXPR_BODY (bind)); | |
3636 | ||
50674e96 | 3637 | lower_omp (&OMP_MASTER_BODY (stmt), ctx); |
953ff289 DN |
3638 | append_to_statement_list (OMP_MASTER_BODY (stmt), &BIND_EXPR_BODY (bind)); |
3639 | ||
3640 | x = build1 (LABEL_EXPR, void_type_node, lab); | |
3641 | gimplify_and_add (x, &BIND_EXPR_BODY (bind)); | |
50674e96 DN |
3642 | x = make_node (OMP_RETURN_EXPR); |
3643 | append_to_statement_list (x, &BIND_EXPR_BODY (bind)); | |
953ff289 DN |
3644 | maybe_catch_exception (&BIND_EXPR_BODY (bind)); |
3645 | pop_gimplify_context (bind); | |
50674e96 | 3646 | |
953ff289 DN |
3647 | BIND_EXPR_VARS (bind) = chainon (BIND_EXPR_VARS (bind), ctx->block_vars); |
3648 | BLOCK_VARS (block) = BIND_EXPR_VARS (bind); | |
50674e96 DN |
3649 | |
3650 | OMP_MASTER_BODY (stmt) = alloc_stmt_list (); | |
3651 | append_to_statement_list (bind, &OMP_MASTER_BODY (stmt)); | |
953ff289 DN |
3652 | } |
3653 | ||
50674e96 | 3654 | |
953ff289 DN |
3655 | /* Expand code for an OpenMP ordered directive. */ |
3656 | ||
3657 | static void | |
50674e96 | 3658 | lower_omp_ordered (tree *stmt_p, omp_context *ctx) |
953ff289 DN |
3659 | { |
3660 | tree bind, block, stmt = *stmt_p, x; | |
3661 | ||
3662 | push_gimplify_context (); | |
3663 | ||
3664 | block = make_node (BLOCK); | |
3665 | bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, block); | |
50674e96 | 3666 | TREE_SIDE_EFFECTS (bind) = 1; |
953ff289 DN |
3667 | |
3668 | x = built_in_decls[BUILT_IN_GOMP_ORDERED_START]; | |
3669 | x = build_function_call_expr (x, NULL); | |
3670 | gimplify_and_add (x, &BIND_EXPR_BODY (bind)); | |
3671 | ||
50674e96 | 3672 | lower_omp (&OMP_ORDERED_BODY (stmt), ctx); |
953ff289 DN |
3673 | append_to_statement_list (OMP_ORDERED_BODY (stmt), &BIND_EXPR_BODY (bind)); |
3674 | ||
3675 | x = built_in_decls[BUILT_IN_GOMP_ORDERED_END]; | |
3676 | x = build_function_call_expr (x, NULL); | |
3677 | gimplify_and_add (x, &BIND_EXPR_BODY (bind)); | |
50674e96 DN |
3678 | x = make_node (OMP_RETURN_EXPR); |
3679 | append_to_statement_list (x, &BIND_EXPR_BODY (bind)); | |
953ff289 DN |
3680 | maybe_catch_exception (&BIND_EXPR_BODY (bind)); |
3681 | pop_gimplify_context (bind); | |
50674e96 | 3682 | |
953ff289 DN |
3683 | BIND_EXPR_VARS (bind) = chainon (BIND_EXPR_VARS (bind), ctx->block_vars); |
3684 | BLOCK_VARS (block) = BIND_EXPR_VARS (bind); | |
50674e96 DN |
3685 | |
3686 | OMP_ORDERED_BODY (stmt) = alloc_stmt_list (); | |
3687 | append_to_statement_list (bind, &OMP_ORDERED_BODY (stmt)); | |
953ff289 DN |
3688 | } |
3689 | ||
953ff289 DN |
3690 | |
3691 | /* Gimplify an OMP_CRITICAL statement. This is a relatively simple | |
3692 | substitution of a couple of function calls. But in the NAMED case, | |
3693 | requires that languages coordinate a symbol name. It is therefore | |
3694 | best put here in common code. */ | |
3695 | ||
3696 | static GTY((param1_is (tree), param2_is (tree))) | |
3697 | splay_tree critical_name_mutexes; | |
3698 | ||
3699 | static void | |
50674e96 | 3700 | lower_omp_critical (tree *stmt_p, omp_context *ctx) |
953ff289 DN |
3701 | { |
3702 | tree bind, block, stmt = *stmt_p; | |
50674e96 | 3703 | tree t, lock, unlock, name; |
953ff289 DN |
3704 | |
3705 | name = OMP_CRITICAL_NAME (stmt); | |
3706 | if (name) | |
3707 | { | |
3708 | tree decl, args; | |
3709 | splay_tree_node n; | |
3710 | ||
3711 | if (!critical_name_mutexes) | |
3712 | critical_name_mutexes | |
3713 | = splay_tree_new_ggc (splay_tree_compare_pointers); | |
3714 | ||
3715 | n = splay_tree_lookup (critical_name_mutexes, (splay_tree_key) name); | |
3716 | if (n == NULL) | |
3717 | { | |
3718 | char *new_str; | |
3719 | ||
3720 | decl = create_tmp_var_raw (ptr_type_node, NULL); | |
3721 | ||
3722 | new_str = ACONCAT ((".gomp_critical_user_", | |
3723 | IDENTIFIER_POINTER (name), NULL)); | |
3724 | DECL_NAME (decl) = get_identifier (new_str); | |
3725 | TREE_PUBLIC (decl) = 1; | |
3726 | TREE_STATIC (decl) = 1; | |
3727 | DECL_COMMON (decl) = 1; | |
3728 | DECL_ARTIFICIAL (decl) = 1; | |
3729 | DECL_IGNORED_P (decl) = 1; | |
3730 | cgraph_varpool_finalize_decl (decl); | |
3731 | ||
3732 | splay_tree_insert (critical_name_mutexes, (splay_tree_key) name, | |
3733 | (splay_tree_value) decl); | |
3734 | } | |
3735 | else | |
3736 | decl = (tree) n->value; | |
3737 | ||
3738 | args = tree_cons (NULL, build_fold_addr_expr (decl), NULL); | |
3739 | lock = built_in_decls[BUILT_IN_GOMP_CRITICAL_NAME_START]; | |
3740 | lock = build_function_call_expr (lock, args); | |
3741 | ||
3742 | args = tree_cons (NULL, build_fold_addr_expr (decl), NULL); | |
3743 | unlock = built_in_decls[BUILT_IN_GOMP_CRITICAL_NAME_END]; | |
3744 | unlock = build_function_call_expr (unlock, args); | |
3745 | } | |
3746 | else | |
3747 | { | |
3748 | lock = built_in_decls[BUILT_IN_GOMP_CRITICAL_START]; | |
3749 | lock = build_function_call_expr (lock, NULL); | |
3750 | ||
3751 | unlock = built_in_decls[BUILT_IN_GOMP_CRITICAL_END]; | |
3752 | unlock = build_function_call_expr (unlock, NULL); | |
3753 | } | |
3754 | ||
3755 | push_gimplify_context (); | |
3756 | ||
3757 | block = make_node (BLOCK); | |
3758 | bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, block); | |
50674e96 | 3759 | TREE_SIDE_EFFECTS (bind) = 1; |
953ff289 DN |
3760 | |
3761 | gimplify_and_add (lock, &BIND_EXPR_BODY (bind)); | |
3762 | ||
50674e96 | 3763 | lower_omp (&OMP_CRITICAL_BODY (stmt), ctx); |
953ff289 DN |
3764 | maybe_catch_exception (&OMP_CRITICAL_BODY (stmt)); |
3765 | append_to_statement_list (OMP_CRITICAL_BODY (stmt), &BIND_EXPR_BODY (bind)); | |
3766 | ||
3767 | gimplify_and_add (unlock, &BIND_EXPR_BODY (bind)); | |
50674e96 DN |
3768 | t = make_node (OMP_RETURN_EXPR); |
3769 | append_to_statement_list (t, &BIND_EXPR_BODY (bind)); | |
953ff289 DN |
3770 | |
3771 | pop_gimplify_context (bind); | |
3772 | BIND_EXPR_VARS (bind) = chainon (BIND_EXPR_VARS (bind), ctx->block_vars); | |
3773 | BLOCK_VARS (block) = BIND_EXPR_VARS (bind); | |
50674e96 DN |
3774 | |
3775 | OMP_CRITICAL_BODY (stmt) = alloc_stmt_list (); | |
3776 | append_to_statement_list (bind, &OMP_CRITICAL_BODY (stmt)); | |
3777 | } | |
3778 | ||
3779 | ||
3780 | /* A subroutine of lower_omp_for. Generate code to emit the predicate | |
3781 | for a lastprivate clause. Given a loop control predicate of (V | |
3782 | cond N2), we gate the clause on (!(V cond N2)). The lowered form | |
3783 | is appended to *BODY_P. */ | |
3784 | ||
3785 | static void | |
3786 | lower_omp_for_lastprivate (struct omp_for_data *fd, tree *body_p, | |
3787 | struct omp_context *ctx) | |
3788 | { | |
3789 | tree clauses, cond; | |
3790 | enum tree_code cond_code; | |
3791 | ||
3792 | cond_code = fd->cond_code; | |
3793 | cond_code = cond_code == LT_EXPR ? GE_EXPR : LE_EXPR; | |
3794 | ||
3795 | /* When possible, use a strict equality expression. This can let VRP | |
3796 | type optimizations deduce the value and remove a copy. */ | |
3797 | if (host_integerp (fd->step, 0)) | |
3798 | { | |
3799 | HOST_WIDE_INT step = TREE_INT_CST_LOW (fd->step); | |
3800 | if (step == 1 || step == -1) | |
3801 | cond_code = EQ_EXPR; | |
3802 | } | |
3803 | ||
3804 | cond = build2 (cond_code, boolean_type_node, fd->v, fd->n2); | |
3805 | ||
3806 | clauses = OMP_FOR_CLAUSES (fd->for_stmt); | |
3807 | lower_lastprivate_clauses (clauses, cond, body_p, ctx); | |
3808 | } | |
3809 | ||
3810 | ||
3811 | /* Lower code for an OpenMP loop directive. */ | |
3812 | ||
3813 | static void | |
3814 | lower_omp_for (tree *stmt_p, omp_context *ctx) | |
3815 | { | |
3816 | tree t, stmt, ilist, dlist, new_stmt, *body_p, *rhs_p; | |
3817 | struct omp_for_data fd; | |
3818 | ||
3819 | stmt = *stmt_p; | |
3820 | ||
3821 | push_gimplify_context (); | |
3822 | ||
3823 | lower_omp (&OMP_FOR_PRE_BODY (stmt), ctx); | |
3824 | lower_omp (&OMP_FOR_BODY (stmt), ctx); | |
3825 | ||
3826 | /* Move declaration of temporaries in the loop body before we make | |
3827 | it go away. */ | |
3828 | if (TREE_CODE (OMP_FOR_BODY (stmt)) == BIND_EXPR) | |
3829 | record_vars_into (BIND_EXPR_VARS (OMP_FOR_BODY (stmt)), ctx->cb.dst_fn); | |
3830 | ||
3831 | new_stmt = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL); | |
3832 | TREE_SIDE_EFFECTS (new_stmt) = 1; | |
3833 | body_p = &BIND_EXPR_BODY (new_stmt); | |
3834 | ||
3835 | /* The pre-body and input clauses go before the lowered OMP_FOR. */ | |
3836 | ilist = NULL; | |
3837 | dlist = NULL; | |
3838 | append_to_statement_list (OMP_FOR_PRE_BODY (stmt), body_p); | |
3839 | lower_rec_input_clauses (OMP_FOR_CLAUSES (stmt), body_p, &dlist, ctx); | |
3840 | ||
3841 | /* Lower the header expressions. At this point, we can assume that | |
3842 | the header is of the form: | |
3843 | ||
3844 | #pragma omp for (V = VAL1; V {<|>|<=|>=} VAL2; V = V [+-] VAL3) | |
3845 | ||
3846 | We just need to make sure that VAL1, VAL2 and VAL3 are lowered | |
3847 | using the .omp_data_s mapping, if needed. */ | |
3848 | rhs_p = &TREE_OPERAND (OMP_FOR_INIT (stmt), 1); | |
3849 | if (!is_gimple_min_invariant (*rhs_p)) | |
3850 | *rhs_p = get_formal_tmp_var (*rhs_p, body_p); | |
3851 | ||
3852 | rhs_p = &TREE_OPERAND (OMP_FOR_COND (stmt), 1); | |
3853 | if (!is_gimple_min_invariant (*rhs_p)) | |
3854 | *rhs_p = get_formal_tmp_var (*rhs_p, body_p); | |
3855 | ||
3856 | rhs_p = &TREE_OPERAND (TREE_OPERAND (OMP_FOR_INCR (stmt), 1), 1); | |
3857 | if (!is_gimple_min_invariant (*rhs_p)) | |
3858 | *rhs_p = get_formal_tmp_var (*rhs_p, body_p); | |
3859 | ||
3860 | /* Once lowered, extract the bounds and clauses. */ | |
3861 | extract_omp_for_data (stmt, &fd); | |
3862 | ||
3863 | /* Region exit marker goes at the end of the loop body. */ | |
3864 | t = make_node (OMP_RETURN_EXPR); | |
3865 | append_to_statement_list (t, &OMP_FOR_BODY (stmt)); | |
3866 | maybe_catch_exception (&OMP_FOR_BODY (stmt)); | |
3867 | append_to_statement_list (stmt, body_p); | |
3868 | ||
3869 | /* After the loop, add exit clauses. */ | |
3870 | lower_omp_for_lastprivate (&fd, &dlist, ctx); | |
3871 | lower_reduction_clauses (OMP_FOR_CLAUSES (stmt), body_p, ctx); | |
3872 | append_to_statement_list (dlist, body_p); | |
3873 | ||
3874 | /* Add a barrier unless the user specified NOWAIT. Note that if | |
3875 | this is a combined parallel+loop construct, the barrier will be | |
3876 | optimized away during expansion (see expand_omp_for). */ | |
3877 | if (!fd.have_nowait) | |
3878 | { | |
3879 | tree stmt = alloc_stmt_list (); | |
3880 | build_omp_barrier (&stmt); | |
3881 | append_to_statement_list (stmt, body_p); | |
3882 | } | |
3883 | ||
3884 | pop_gimplify_context (NULL_TREE); | |
3885 | record_vars_into (ctx->block_vars, ctx->cb.dst_fn); | |
3886 | ||
3887 | OMP_FOR_PRE_BODY (stmt) = NULL_TREE; | |
3888 | *stmt_p = new_stmt; | |
953ff289 DN |
3889 | } |
3890 | ||
50674e96 DN |
3891 | |
3892 | /* Lower the OpenMP parallel directive in *STMT_P. CTX holds context | |
3893 | information for the directive. */ | |
3894 | ||
3895 | static void | |
3896 | lower_omp_parallel (tree *stmt_p, omp_context *ctx) | |
3897 | { | |
3898 | tree clauses, par_bind, par_body, new_body, bind; | |
3899 | tree olist, ilist, par_olist, par_ilist; | |
3900 | tree stmt, child_fn, t; | |
3901 | ||
3902 | stmt = *stmt_p; | |
3903 | ||
3904 | clauses = OMP_PARALLEL_CLAUSES (stmt); | |
3905 | par_bind = OMP_PARALLEL_BODY (stmt); | |
3906 | par_body = BIND_EXPR_BODY (par_bind); | |
3907 | child_fn = ctx->cb.dst_fn; | |
3908 | ||
3909 | push_gimplify_context (); | |
3910 | ||
3911 | par_olist = NULL_TREE; | |
3912 | par_ilist = NULL_TREE; | |
3913 | lower_rec_input_clauses (clauses, &par_ilist, &par_olist, ctx); | |
3914 | lower_omp (&par_body, ctx); | |
3915 | maybe_catch_exception (&par_body); | |
3916 | lower_reduction_clauses (clauses, &par_olist, ctx); | |
3917 | ||
3918 | /* Declare all the variables created by mapping and the variables | |
3919 | declared in the scope of the parallel body. */ | |
3920 | record_vars_into (ctx->block_vars, child_fn); | |
3921 | record_vars_into (BIND_EXPR_VARS (par_bind), child_fn); | |
3922 | ||
3923 | if (ctx->record_type) | |
3924 | { | |
3925 | ctx->sender_decl = create_tmp_var (ctx->record_type, ".omp_data_o"); | |
3926 | OMP_PARALLEL_DATA_ARG (stmt) = ctx->sender_decl; | |
3927 | } | |
3928 | ||
3929 | olist = NULL_TREE; | |
3930 | ilist = NULL_TREE; | |
3931 | lower_send_clauses (clauses, &ilist, &olist, ctx); | |
3932 | lower_send_shared_vars (&ilist, &olist, ctx); | |
3933 | ||
3934 | /* Once all the expansions are done, sequence all the different | |
3935 | fragments inside OMP_PARALLEL_BODY. */ | |
3936 | bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL); | |
3937 | append_to_statement_list (ilist, &BIND_EXPR_BODY (bind)); | |
3938 | ||
3939 | new_body = alloc_stmt_list (); | |
3940 | ||
3941 | if (ctx->record_type) | |
3942 | { | |
3943 | t = build_fold_addr_expr (ctx->sender_decl); | |
3944 | t = build2 (MODIFY_EXPR, void_type_node, ctx->receiver_decl, t); | |
3945 | append_to_statement_list (t, &new_body); | |
3946 | } | |
3947 | ||
3948 | append_to_statement_list (par_ilist, &new_body); | |
3949 | append_to_statement_list (par_body, &new_body); | |
3950 | append_to_statement_list (par_olist, &new_body); | |
3951 | t = make_node (OMP_RETURN_EXPR); | |
3952 | append_to_statement_list (t, &new_body); | |
3953 | OMP_PARALLEL_BODY (stmt) = new_body; | |
3954 | ||
3955 | append_to_statement_list (stmt, &BIND_EXPR_BODY (bind)); | |
3956 | append_to_statement_list (olist, &BIND_EXPR_BODY (bind)); | |
3957 | ||
3958 | *stmt_p = bind; | |
3959 | ||
3960 | pop_gimplify_context (NULL_TREE); | |
3961 | } | |
3962 | ||
3963 | ||
953ff289 DN |
3964 | /* Pass *TP back through the gimplifier within the context determined by WI. |
3965 | This handles replacement of DECL_VALUE_EXPR, as well as adjusting the | |
3966 | flags on ADDR_EXPR. */ | |
3967 | ||
3968 | static void | |
50674e96 | 3969 | lower_regimplify (tree *tp, struct walk_stmt_info *wi) |
953ff289 DN |
3970 | { |
3971 | enum gimplify_status gs; | |
3972 | tree pre = NULL; | |
3973 | ||
3974 | if (wi->is_lhs) | |
3975 | gs = gimplify_expr (tp, &pre, NULL, is_gimple_lvalue, fb_lvalue); | |
3976 | else if (wi->val_only) | |
3977 | gs = gimplify_expr (tp, &pre, NULL, is_gimple_val, fb_rvalue); | |
3978 | else | |
3979 | gs = gimplify_expr (tp, &pre, NULL, is_gimple_formal_tmp_var, fb_rvalue); | |
3980 | gcc_assert (gs == GS_ALL_DONE); | |
3981 | ||
3982 | if (pre) | |
3983 | tsi_link_before (&wi->tsi, pre, TSI_SAME_STMT); | |
3984 | } | |
3985 | ||
50674e96 DN |
3986 | |
3987 | /* Callback for walk_stmts. Lower the OpenMP directive pointed by TP. */ | |
3988 | ||
953ff289 | 3989 | static tree |
50674e96 | 3990 | lower_omp_1 (tree *tp, int *walk_subtrees, void *data) |
953ff289 DN |
3991 | { |
3992 | struct walk_stmt_info *wi = data; | |
3993 | omp_context *ctx = wi->info; | |
3994 | tree t = *tp; | |
3995 | ||
50674e96 DN |
3996 | /* If we have issued syntax errors, avoid doing any heavy lifting. |
3997 | Just replace the OpenMP directives with a NOP to avoid | |
3998 | confusing RTL expansion. */ | |
3999 | if (errorcount && OMP_DIRECTIVE_P (*tp)) | |
4000 | { | |
4001 | *tp = build_empty_stmt (); | |
4002 | return NULL_TREE; | |
4003 | } | |
4004 | ||
953ff289 DN |
4005 | *walk_subtrees = 0; |
4006 | switch (TREE_CODE (*tp)) | |
4007 | { | |
4008 | case OMP_PARALLEL: | |
4009 | ctx = maybe_lookup_ctx (t); | |
50674e96 | 4010 | lower_omp_parallel (tp, ctx); |
953ff289 DN |
4011 | break; |
4012 | ||
4013 | case OMP_FOR: | |
4014 | ctx = maybe_lookup_ctx (t); | |
4015 | gcc_assert (ctx); | |
50674e96 | 4016 | lower_omp_for (tp, ctx); |
953ff289 DN |
4017 | break; |
4018 | ||
4019 | case OMP_SECTIONS: | |
4020 | ctx = maybe_lookup_ctx (t); | |
4021 | gcc_assert (ctx); | |
50674e96 | 4022 | lower_omp_sections (tp, ctx); |
953ff289 DN |
4023 | break; |
4024 | ||
4025 | case OMP_SINGLE: | |
4026 | ctx = maybe_lookup_ctx (t); | |
4027 | gcc_assert (ctx); | |
50674e96 | 4028 | lower_omp_single (tp, ctx); |
953ff289 DN |
4029 | break; |
4030 | ||
4031 | case OMP_MASTER: | |
4032 | ctx = maybe_lookup_ctx (t); | |
4033 | gcc_assert (ctx); | |
50674e96 | 4034 | lower_omp_master (tp, ctx); |
953ff289 DN |
4035 | break; |
4036 | ||
4037 | case OMP_ORDERED: | |
4038 | ctx = maybe_lookup_ctx (t); | |
4039 | gcc_assert (ctx); | |
50674e96 | 4040 | lower_omp_ordered (tp, ctx); |
953ff289 DN |
4041 | break; |
4042 | ||
4043 | case OMP_CRITICAL: | |
4044 | ctx = maybe_lookup_ctx (t); | |
4045 | gcc_assert (ctx); | |
50674e96 | 4046 | lower_omp_critical (tp, ctx); |
953ff289 DN |
4047 | break; |
4048 | ||
4049 | case VAR_DECL: | |
4050 | if (ctx && DECL_HAS_VALUE_EXPR_P (t)) | |
50674e96 | 4051 | lower_regimplify (tp, wi); |
953ff289 DN |
4052 | break; |
4053 | ||
4054 | case ADDR_EXPR: | |
4055 | if (ctx) | |
50674e96 | 4056 | lower_regimplify (tp, wi); |
953ff289 DN |
4057 | break; |
4058 | ||
4059 | case ARRAY_REF: | |
4060 | case ARRAY_RANGE_REF: | |
4061 | case REALPART_EXPR: | |
4062 | case IMAGPART_EXPR: | |
4063 | case COMPONENT_REF: | |
4064 | case VIEW_CONVERT_EXPR: | |
4065 | if (ctx) | |
50674e96 | 4066 | lower_regimplify (tp, wi); |
953ff289 DN |
4067 | break; |
4068 | ||
4069 | case INDIRECT_REF: | |
4070 | if (ctx) | |
4071 | { | |
4072 | wi->is_lhs = false; | |
4073 | wi->val_only = true; | |
50674e96 | 4074 | lower_regimplify (&TREE_OPERAND (t, 0), wi); |
953ff289 DN |
4075 | } |
4076 | break; | |
4077 | ||
4078 | default: | |
4079 | if (!TYPE_P (t) && !DECL_P (t)) | |
4080 | *walk_subtrees = 1; | |
4081 | break; | |
4082 | } | |
4083 | ||
4084 | return NULL_TREE; | |
4085 | } | |
4086 | ||
4087 | static void | |
50674e96 | 4088 | lower_omp (tree *stmt_p, omp_context *ctx) |
953ff289 DN |
4089 | { |
4090 | struct walk_stmt_info wi; | |
4091 | ||
4092 | memset (&wi, 0, sizeof (wi)); | |
50674e96 | 4093 | wi.callback = lower_omp_1; |
953ff289 DN |
4094 | wi.info = ctx; |
4095 | wi.val_only = true; | |
4096 | wi.want_locations = true; | |
4097 | ||
4098 | walk_stmts (&wi, stmt_p); | |
4099 | } | |
4100 | \f | |
4101 | /* Main entry point. */ | |
4102 | ||
4103 | static void | |
4104 | execute_lower_omp (void) | |
4105 | { | |
4106 | all_contexts = splay_tree_new (splay_tree_compare_pointers, 0, | |
4107 | delete_omp_context); | |
4108 | ||
4109 | scan_omp (&DECL_SAVED_TREE (current_function_decl), NULL); | |
4110 | gcc_assert (parallel_nesting_level == 0); | |
4111 | ||
4112 | if (all_contexts->root) | |
50674e96 | 4113 | lower_omp (&DECL_SAVED_TREE (current_function_decl), NULL); |
953ff289 | 4114 | |
50674e96 DN |
4115 | if (all_contexts) |
4116 | { | |
4117 | splay_tree_delete (all_contexts); | |
4118 | all_contexts = NULL; | |
4119 | } | |
953ff289 DN |
4120 | } |
4121 | ||
4122 | static bool | |
4123 | gate_lower_omp (void) | |
4124 | { | |
4125 | return flag_openmp != 0; | |
4126 | } | |
4127 | ||
4128 | struct tree_opt_pass pass_lower_omp = | |
4129 | { | |
4130 | "omplower", /* name */ | |
4131 | gate_lower_omp, /* gate */ | |
4132 | execute_lower_omp, /* execute */ | |
4133 | NULL, /* sub */ | |
4134 | NULL, /* next */ | |
4135 | 0, /* static_pass_number */ | |
4136 | 0, /* tv_id */ | |
4137 | PROP_gimple_any, /* properties_required */ | |
4138 | PROP_gimple_lomp, /* properties_provided */ | |
4139 | 0, /* properties_destroyed */ | |
4140 | 0, /* todo_flags_start */ | |
4141 | TODO_dump_func, /* todo_flags_finish */ | |
4142 | 0 /* letter */ | |
4143 | }; | |
953ff289 DN |
4144 | \f |
4145 | /* The following is a utility to diagnose OpenMP structured block violations. | |
4146 | It's part of the "omplower" pass, as that's invoked too late. It should | |
4147 | be invoked by the respective front ends after gimplification. */ | |
4148 | ||
4149 | static splay_tree all_labels; | |
4150 | ||
4151 | /* Check for mismatched contexts and generate an error if needed. Return | |
4152 | true if an error is detected. */ | |
4153 | ||
4154 | static bool | |
4155 | diagnose_sb_0 (tree *stmt_p, tree branch_ctx, tree label_ctx) | |
4156 | { | |
4157 | bool exit_p = true; | |
4158 | ||
4159 | if ((label_ctx ? TREE_VALUE (label_ctx) : NULL) == branch_ctx) | |
4160 | return false; | |
4161 | ||
4162 | /* Try to avoid confusing the user by producing and error message | |
4163 | with correct "exit" or "enter" verbage. We prefer "exit" | |
4164 | unless we can show that LABEL_CTX is nested within BRANCH_CTX. */ | |
4165 | if (branch_ctx == NULL) | |
4166 | exit_p = false; | |
4167 | else | |
4168 | { | |
4169 | while (label_ctx) | |
4170 | { | |
4171 | if (TREE_VALUE (label_ctx) == branch_ctx) | |
4172 | { | |
4173 | exit_p = false; | |
4174 | break; | |
4175 | } | |
4176 | label_ctx = TREE_CHAIN (label_ctx); | |
4177 | } | |
4178 | } | |
4179 | ||
4180 | if (exit_p) | |
4181 | error ("invalid exit from OpenMP structured block"); | |
4182 | else | |
4183 | error ("invalid entry to OpenMP structured block"); | |
4184 | ||
4185 | *stmt_p = build_empty_stmt (); | |
4186 | return true; | |
4187 | } | |
4188 | ||
4189 | /* Pass 1: Create a minimal tree of OpenMP structured blocks, and record | |
4190 | where in the tree each label is found. */ | |
4191 | ||
4192 | static tree | |
4193 | diagnose_sb_1 (tree *tp, int *walk_subtrees, void *data) | |
4194 | { | |
4195 | struct walk_stmt_info *wi = data; | |
4196 | tree context = (tree) wi->info; | |
4197 | tree inner_context; | |
4198 | tree t = *tp; | |
4199 | ||
4200 | *walk_subtrees = 0; | |
4201 | switch (TREE_CODE (t)) | |
4202 | { | |
4203 | case OMP_PARALLEL: | |
4204 | case OMP_SECTIONS: | |
4205 | case OMP_SINGLE: | |
4206 | walk_tree (&OMP_CLAUSES (t), diagnose_sb_1, wi, NULL); | |
4207 | /* FALLTHRU */ | |
4208 | case OMP_SECTION: | |
4209 | case OMP_MASTER: | |
4210 | case OMP_ORDERED: | |
4211 | case OMP_CRITICAL: | |
4212 | /* The minimal context here is just a tree of statements. */ | |
4213 | inner_context = tree_cons (NULL, t, context); | |
4214 | wi->info = inner_context; | |
4215 | walk_stmts (wi, &OMP_BODY (t)); | |
4216 | wi->info = context; | |
4217 | break; | |
4218 | ||
4219 | case OMP_FOR: | |
4220 | walk_tree (&OMP_FOR_CLAUSES (t), diagnose_sb_1, wi, NULL); | |
4221 | inner_context = tree_cons (NULL, t, context); | |
4222 | wi->info = inner_context; | |
4223 | walk_tree (&OMP_FOR_INIT (t), diagnose_sb_1, wi, NULL); | |
4224 | walk_tree (&OMP_FOR_COND (t), diagnose_sb_1, wi, NULL); | |
4225 | walk_tree (&OMP_FOR_INCR (t), diagnose_sb_1, wi, NULL); | |
4226 | walk_stmts (wi, &OMP_FOR_PRE_BODY (t)); | |
4227 | walk_stmts (wi, &OMP_FOR_BODY (t)); | |
4228 | wi->info = context; | |
4229 | break; | |
4230 | ||
4231 | case LABEL_EXPR: | |
4232 | splay_tree_insert (all_labels, (splay_tree_key) LABEL_EXPR_LABEL (t), | |
4233 | (splay_tree_value) context); | |
4234 | break; | |
4235 | ||
4236 | default: | |
4237 | break; | |
4238 | } | |
4239 | ||
4240 | return NULL_TREE; | |
4241 | } | |
4242 | ||
4243 | /* Pass 2: Check each branch and see if its context differs from that of | |
4244 | the destination label's context. */ | |
4245 | ||
4246 | static tree | |
4247 | diagnose_sb_2 (tree *tp, int *walk_subtrees, void *data) | |
4248 | { | |
4249 | struct walk_stmt_info *wi = data; | |
4250 | tree context = (tree) wi->info; | |
4251 | splay_tree_node n; | |
4252 | tree t = *tp; | |
4253 | ||
4254 | *walk_subtrees = 0; | |
4255 | switch (TREE_CODE (t)) | |
4256 | { | |
4257 | case OMP_PARALLEL: | |
4258 | case OMP_SECTIONS: | |
4259 | case OMP_SINGLE: | |
4260 | walk_tree (&OMP_CLAUSES (t), diagnose_sb_2, wi, NULL); | |
4261 | /* FALLTHRU */ | |
4262 | case OMP_SECTION: | |
4263 | case OMP_MASTER: | |
4264 | case OMP_ORDERED: | |
4265 | case OMP_CRITICAL: | |
4266 | wi->info = t; | |
4267 | walk_stmts (wi, &OMP_BODY (t)); | |
4268 | wi->info = context; | |
4269 | break; | |
4270 | ||
4271 | case OMP_FOR: | |
4272 | walk_tree (&OMP_FOR_CLAUSES (t), diagnose_sb_2, wi, NULL); | |
4273 | wi->info = t; | |
4274 | walk_tree (&OMP_FOR_INIT (t), diagnose_sb_2, wi, NULL); | |
4275 | walk_tree (&OMP_FOR_COND (t), diagnose_sb_2, wi, NULL); | |
4276 | walk_tree (&OMP_FOR_INCR (t), diagnose_sb_2, wi, NULL); | |
4277 | walk_stmts (wi, &OMP_FOR_PRE_BODY (t)); | |
4278 | walk_stmts (wi, &OMP_FOR_BODY (t)); | |
4279 | wi->info = context; | |
4280 | break; | |
4281 | ||
4282 | case GOTO_EXPR: | |
4283 | { | |
4284 | tree lab = GOTO_DESTINATION (t); | |
4285 | if (TREE_CODE (lab) != LABEL_DECL) | |
4286 | break; | |
4287 | ||
4288 | n = splay_tree_lookup (all_labels, (splay_tree_key) lab); | |
4289 | diagnose_sb_0 (tp, context, n ? (tree) n->value : NULL_TREE); | |
4290 | } | |
4291 | break; | |
4292 | ||
4293 | case SWITCH_EXPR: | |
4294 | { | |
4295 | tree vec = SWITCH_LABELS (t); | |
4296 | int i, len = TREE_VEC_LENGTH (vec); | |
4297 | for (i = 0; i < len; ++i) | |
4298 | { | |
4299 | tree lab = CASE_LABEL (TREE_VEC_ELT (vec, i)); | |
4300 | n = splay_tree_lookup (all_labels, (splay_tree_key) lab); | |
4301 | if (diagnose_sb_0 (tp, context, (tree) n->value)) | |
4302 | break; | |
4303 | } | |
4304 | } | |
4305 | break; | |
4306 | ||
4307 | case RETURN_EXPR: | |
4308 | diagnose_sb_0 (tp, context, NULL_TREE); | |
4309 | break; | |
4310 | ||
4311 | default: | |
4312 | break; | |
4313 | } | |
4314 | ||
4315 | return NULL_TREE; | |
4316 | } | |
4317 | ||
4318 | void | |
4319 | diagnose_omp_structured_block_errors (tree fndecl) | |
4320 | { | |
4321 | tree save_current = current_function_decl; | |
4322 | struct walk_stmt_info wi; | |
4323 | ||
4324 | current_function_decl = fndecl; | |
4325 | ||
4326 | all_labels = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
4327 | ||
4328 | memset (&wi, 0, sizeof (wi)); | |
4329 | wi.callback = diagnose_sb_1; | |
4330 | walk_stmts (&wi, &DECL_SAVED_TREE (fndecl)); | |
4331 | ||
4332 | memset (&wi, 0, sizeof (wi)); | |
4333 | wi.callback = diagnose_sb_2; | |
4334 | wi.want_locations = true; | |
4335 | wi.want_return_expr = true; | |
4336 | walk_stmts (&wi, &DECL_SAVED_TREE (fndecl)); | |
4337 | ||
4338 | splay_tree_delete (all_labels); | |
4339 | all_labels = NULL; | |
4340 | ||
4341 | current_function_decl = save_current; | |
4342 | } | |
4343 | ||
4344 | #include "gt-omp-low.h" |