?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
* backtrace.c: Revert last two changes. Don't call mmap
[official-gcc.git] / gcc / fortran / trans-openmp.c
blob795175d701a4876524622e991eb521a0729a5174
1 /* OpenMP directive translation -- generate GCC trees from gfc_code.
2 Copyright (C) 2005-2018 Free Software Foundation, Inc.
3 Contributed by Jakub Jelinek <jakub@redhat.com>
4
5 This file is part of GCC.
6
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
10 version.
11
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
20
21
22 #include "config.h"
23 #include "system.h"
24 #include "coretypes.h"
25 #include "options.h"
26 #include "tree.h"
27 #include "gfortran.h"
28 #include "gimple-expr.h"
29 #include "trans.h"
30 #include "stringpool.h"
31 #include "fold-const.h"
32 #include "gimplify.h" /* For create_tmp_var_raw. */
33 #include "trans-stmt.h"
34 #include "trans-types.h"
35 #include "trans-array.h"
36 #include "trans-const.h"
37 #include "arith.h"
38 #include "gomp-constants.h"
39 #include "omp-general.h"
40 #include "omp-low.h"
41 #undef GCC_DIAG_STYLE
42 #define GCC_DIAG_STYLE __gcc_tdiag__
43 #include "diagnostic-core.h"
44 #undef GCC_DIAG_STYLE
45 #define GCC_DIAG_STYLE __gcc_gfc__
46
47 int ompws_flags;
48
49 /* True if OpenMP should privatize what this DECL points to rather
50 than the DECL itself. */
51
52 bool
53 gfc_omp_privatize_by_reference (const_tree decl)
54 {
55 tree type = TREE_TYPE (decl);
56
57 if (TREE_CODE (type) == REFERENCE_TYPE
58 && (!DECL_ARTIFICIAL (decl) || TREE_CODE (decl) == PARM_DECL))
59 return true;
60
61 if (TREE_CODE (type) == POINTER_TYPE)
62 {
63 /* Array POINTER/ALLOCATABLE have aggregate types, all user variables
64 that have POINTER_TYPE type and aren't scalar pointers, scalar
65 allocatables, Cray pointees or C pointers are supposed to be
66 privatized by reference. */
67 if (GFC_DECL_GET_SCALAR_POINTER (decl)
68 || GFC_DECL_GET_SCALAR_ALLOCATABLE (decl)
69 || GFC_DECL_CRAY_POINTEE (decl)
70 || GFC_DECL_ASSOCIATE_VAR_P (decl)
71 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (decl))))
72 return false;
73
74 if (!DECL_ARTIFICIAL (decl)
75 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
76 return true;
77
78 /* Some arrays are expanded as DECL_ARTIFICIAL pointers
79 by the frontend. */
80 if (DECL_LANG_SPECIFIC (decl)
81 && GFC_DECL_SAVED_DESCRIPTOR (decl))
82 return true;
83 }
84
85 return false;
86 }
87
88 /* True if OpenMP sharing attribute of DECL is predetermined. */
89
90 enum omp_clause_default_kind
91 gfc_omp_predetermined_sharing (tree decl)
92 {
93 /* Associate names preserve the association established during ASSOCIATE.
94 As they are implemented either as pointers to the selector or array
95 descriptor and shouldn't really change in the ASSOCIATE region,
96 this decl can be either shared or firstprivate. If it is a pointer,
97 use firstprivate, as it is cheaper that way, otherwise make it shared. */
98 if (GFC_DECL_ASSOCIATE_VAR_P (decl))
99 {
100 if (TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE)
101 return OMP_CLAUSE_DEFAULT_FIRSTPRIVATE;
102 else
103 return OMP_CLAUSE_DEFAULT_SHARED;
104 }
105
106 if (DECL_ARTIFICIAL (decl)
107 && ! GFC_DECL_RESULT (decl)
108 && ! (DECL_LANG_SPECIFIC (decl)
109 && GFC_DECL_SAVED_DESCRIPTOR (decl)))
110 return OMP_CLAUSE_DEFAULT_SHARED;
111
112 /* Cray pointees shouldn't be listed in any clauses and should be
113 gimplified to dereference of the corresponding Cray pointer.
114 Make them all private, so that they are emitted in the debug
115 information. */
116 if (GFC_DECL_CRAY_POINTEE (decl))
117 return OMP_CLAUSE_DEFAULT_PRIVATE;
118
119 /* Assumed-size arrays are predetermined shared. */
120 if (TREE_CODE (decl) == PARM_DECL
121 && GFC_ARRAY_TYPE_P (TREE_TYPE (decl))
122 && GFC_TYPE_ARRAY_AKIND (TREE_TYPE (decl)) == GFC_ARRAY_UNKNOWN
123 && GFC_TYPE_ARRAY_UBOUND (TREE_TYPE (decl),
124 GFC_TYPE_ARRAY_RANK (TREE_TYPE (decl)) - 1)
125 == NULL)
126 return OMP_CLAUSE_DEFAULT_SHARED;
127
128 /* Dummy procedures aren't considered variables by OpenMP, thus are
129 disallowed in OpenMP clauses. They are represented as PARM_DECLs
130 in the middle-end, so return OMP_CLAUSE_DEFAULT_FIRSTPRIVATE here
131 to avoid complaining about their uses with default(none). */
132 if (TREE_CODE (decl) == PARM_DECL
133 && TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
134 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == FUNCTION_TYPE)
135 return OMP_CLAUSE_DEFAULT_FIRSTPRIVATE;
136
137 /* COMMON and EQUIVALENCE decls are shared. They
138 are only referenced through DECL_VALUE_EXPR of the variables
139 contained in them. If those are privatized, they will not be
140 gimplified to the COMMON or EQUIVALENCE decls. */
141 if (GFC_DECL_COMMON_OR_EQUIV (decl) && ! DECL_HAS_VALUE_EXPR_P (decl))
142 return OMP_CLAUSE_DEFAULT_SHARED;
143
144 if (GFC_DECL_RESULT (decl) && ! DECL_HAS_VALUE_EXPR_P (decl))
145 return OMP_CLAUSE_DEFAULT_SHARED;
146
147 /* These are either array or derived parameters, or vtables.
148 In the former cases, the OpenMP standard doesn't consider them to be
149 variables at all (they can't be redefined), but they can nevertheless appear
150 in parallel/task regions and for default(none) purposes treat them as shared.
151 For vtables likely the same handling is desirable. */
152 if (VAR_P (decl) && TREE_READONLY (decl) && TREE_STATIC (decl))
153 return OMP_CLAUSE_DEFAULT_SHARED;
154
155 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
156 }
157
158 /* Return decl that should be used when reporting DEFAULT(NONE)
159 diagnostics. */
160
161 tree
162 gfc_omp_report_decl (tree decl)
163 {
164 if (DECL_ARTIFICIAL (decl)
165 && DECL_LANG_SPECIFIC (decl)
166 && GFC_DECL_SAVED_DESCRIPTOR (decl))
167 return GFC_DECL_SAVED_DESCRIPTOR (decl);
168
169 return decl;
170 }
171
172 /* Return true if TYPE has any allocatable components. */
173
174 static bool
175 gfc_has_alloc_comps (tree type, tree decl)
176 {
177 tree field, ftype;
178
179 if (POINTER_TYPE_P (type))
180 {
181 if (GFC_DECL_GET_SCALAR_ALLOCATABLE (decl))
182 type = TREE_TYPE (type);
183 else if (GFC_DECL_GET_SCALAR_POINTER (decl))
184 return false;
185 }
186
187 if (GFC_DESCRIPTOR_TYPE_P (type) || GFC_ARRAY_TYPE_P (type))
188 type = gfc_get_element_type (type);
189
190 if (TREE_CODE (type) != RECORD_TYPE)
191 return false;
192
193 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
194 {
195 ftype = TREE_TYPE (field);
196 if (GFC_DECL_GET_SCALAR_ALLOCATABLE (field))
197 return true;
198 if (GFC_DESCRIPTOR_TYPE_P (ftype)
199 && GFC_TYPE_ARRAY_AKIND (ftype) == GFC_ARRAY_ALLOCATABLE)
200 return true;
201 if (gfc_has_alloc_comps (ftype, field))
202 return true;
203 }
204 return false;
205 }
206
207 /* Return true if DECL in private clause needs
208 OMP_CLAUSE_PRIVATE_OUTER_REF on the private clause. */
209 bool
210 gfc_omp_private_outer_ref (tree decl)
211 {
212 tree type = TREE_TYPE (decl);
213
214 if (gfc_omp_privatize_by_reference (decl))
215 type = TREE_TYPE (type);
216
217 if (GFC_DESCRIPTOR_TYPE_P (type)
218 && GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ALLOCATABLE)
219 return true;
220
221 if (GFC_DECL_GET_SCALAR_ALLOCATABLE (decl))
222 return true;
223
224 if (gfc_has_alloc_comps (type, decl))
225 return true;
226
227 return false;
228 }
229
230 /* Callback for gfc_omp_unshare_expr. */
231
232 static tree
233 gfc_omp_unshare_expr_r (tree *tp, int *walk_subtrees, void *)
234 {
235 tree t = *tp;
236 enum tree_code code = TREE_CODE (t);
237
238 /* Stop at types, decls, constants like copy_tree_r. */
239 if (TREE_CODE_CLASS (code) == tcc_type
240 || TREE_CODE_CLASS (code) == tcc_declaration
241 || TREE_CODE_CLASS (code) == tcc_constant
242 || code == BLOCK)
243 *walk_subtrees = 0;
244 else if (handled_component_p (t)
245 || TREE_CODE (t) == MEM_REF)
246 {
247 *tp = unshare_expr (t);
248 *walk_subtrees = 0;
249 }
250
251 return NULL_TREE;
252 }
253
254 /* Unshare in expr anything that the FE which normally doesn't
255 care much about tree sharing (because during gimplification
256 everything is unshared) could cause problems with tree sharing
257 at omp-low.c time. */
258
259 static tree
260 gfc_omp_unshare_expr (tree expr)
261 {
262 walk_tree (&expr, gfc_omp_unshare_expr_r, NULL, NULL);
263 return expr;
264 }
265
266 enum walk_alloc_comps
267 {
268 WALK_ALLOC_COMPS_DTOR,
269 WALK_ALLOC_COMPS_DEFAULT_CTOR,
270 WALK_ALLOC_COMPS_COPY_CTOR
271 };
272
273 /* Handle allocatable components in OpenMP clauses. */
274
275 static tree
276 gfc_walk_alloc_comps (tree decl, tree dest, tree var,
277 enum walk_alloc_comps kind)
278 {
279 stmtblock_t block, tmpblock;
280 tree type = TREE_TYPE (decl), then_b, tem, field;
281 gfc_init_block (&block);
282
283 if (GFC_ARRAY_TYPE_P (type) || GFC_DESCRIPTOR_TYPE_P (type))
284 {
285 if (GFC_DESCRIPTOR_TYPE_P (type))
286 {
287 gfc_init_block (&tmpblock);
288 tem = gfc_full_array_size (&tmpblock, decl,
289 GFC_TYPE_ARRAY_RANK (type));
290 then_b = gfc_finish_block (&tmpblock);
291 gfc_add_expr_to_block (&block, gfc_omp_unshare_expr (then_b));
292 tem = gfc_omp_unshare_expr (tem);
293 tem = fold_build2_loc (input_location, MINUS_EXPR,
294 gfc_array_index_type, tem,
295 gfc_index_one_node);
296 }
297 else
298 {
299 if (!TYPE_DOMAIN (type)
300 || TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL_TREE
301 || TYPE_MIN_VALUE (TYPE_DOMAIN (type)) == error_mark_node
302 || TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == error_mark_node)
303 {
304 tem = fold_build2 (EXACT_DIV_EXPR, sizetype,
305 TYPE_SIZE_UNIT (type),
306 TYPE_SIZE_UNIT (TREE_TYPE (type)));
307 tem = size_binop (MINUS_EXPR, tem, size_one_node);
308 }
309 else
310 tem = array_type_nelts (type);
311 tem = fold_convert (gfc_array_index_type, tem);
312 }
313
314 tree nelems = gfc_evaluate_now (tem, &block);
315 tree index = gfc_create_var (gfc_array_index_type, "S");
316
317 gfc_init_block (&tmpblock);
318 tem = gfc_conv_array_data (decl);
319 tree declvar = build_fold_indirect_ref_loc (input_location, tem);
320 tree declvref = gfc_build_array_ref (declvar, index, NULL);
321 tree destvar, destvref = NULL_TREE;
322 if (dest)
323 {
324 tem = gfc_conv_array_data (dest);
325 destvar = build_fold_indirect_ref_loc (input_location, tem);
326 destvref = gfc_build_array_ref (destvar, index, NULL);
327 }
328 gfc_add_expr_to_block (&tmpblock,
329 gfc_walk_alloc_comps (declvref, destvref,
330 var, kind));
331
332 gfc_loopinfo loop;
333 gfc_init_loopinfo (&loop);
334 loop.dimen = 1;
335 loop.from[0] = gfc_index_zero_node;
336 loop.loopvar[0] = index;
337 loop.to[0] = nelems;
338 gfc_trans_scalarizing_loops (&loop, &tmpblock);
339 gfc_add_block_to_block (&block, &loop.pre);
340 return gfc_finish_block (&block);
341 }
342 else if (GFC_DECL_GET_SCALAR_ALLOCATABLE (var))
343 {
344 decl = build_fold_indirect_ref_loc (input_location, decl);
345 if (dest)
346 dest = build_fold_indirect_ref_loc (input_location, dest);
347 type = TREE_TYPE (decl);
348 }
349
350 gcc_assert (TREE_CODE (type) == RECORD_TYPE);
351 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
352 {
353 tree ftype = TREE_TYPE (field);
354 tree declf, destf = NULL_TREE;
355 bool has_alloc_comps = gfc_has_alloc_comps (ftype, field);
356 if ((!GFC_DESCRIPTOR_TYPE_P (ftype)
357 || GFC_TYPE_ARRAY_AKIND (ftype) != GFC_ARRAY_ALLOCATABLE)
358 && !GFC_DECL_GET_SCALAR_ALLOCATABLE (field)
359 && !has_alloc_comps)
360 continue;
361 declf = fold_build3_loc (input_location, COMPONENT_REF, ftype,
362 decl, field, NULL_TREE);
363 if (dest)
364 destf = fold_build3_loc (input_location, COMPONENT_REF, ftype,
365 dest, field, NULL_TREE);
366
367 tem = NULL_TREE;
368 switch (kind)
369 {
370 case WALK_ALLOC_COMPS_DTOR:
371 break;
372 case WALK_ALLOC_COMPS_DEFAULT_CTOR:
373 if (GFC_DESCRIPTOR_TYPE_P (ftype)
374 && GFC_TYPE_ARRAY_AKIND (ftype) == GFC_ARRAY_ALLOCATABLE)
375 {
376 gfc_add_modify (&block, unshare_expr (destf),
377 unshare_expr (declf));
378 tem = gfc_duplicate_allocatable_nocopy
379 (destf, declf, ftype,
380 GFC_TYPE_ARRAY_RANK (ftype));
381 }
382 else if (GFC_DECL_GET_SCALAR_ALLOCATABLE (field))
383 tem = gfc_duplicate_allocatable_nocopy (destf, declf, ftype, 0);
384 break;
385 case WALK_ALLOC_COMPS_COPY_CTOR:
386 if (GFC_DESCRIPTOR_TYPE_P (ftype)
387 && GFC_TYPE_ARRAY_AKIND (ftype) == GFC_ARRAY_ALLOCATABLE)
388 tem = gfc_duplicate_allocatable (destf, declf, ftype,
389 GFC_TYPE_ARRAY_RANK (ftype),
390 NULL_TREE);
391 else if (GFC_DECL_GET_SCALAR_ALLOCATABLE (field))
392 tem = gfc_duplicate_allocatable (destf, declf, ftype, 0,
393 NULL_TREE);
394 break;
395 }
396 if (tem)
397 gfc_add_expr_to_block (&block, gfc_omp_unshare_expr (tem));
398 if (has_alloc_comps)
399 {
400 gfc_init_block (&tmpblock);
401 gfc_add_expr_to_block (&tmpblock,
402 gfc_walk_alloc_comps (declf, destf,
403 field, kind));
404 then_b = gfc_finish_block (&tmpblock);
405 if (GFC_DESCRIPTOR_TYPE_P (ftype)
406 && GFC_TYPE_ARRAY_AKIND (ftype) == GFC_ARRAY_ALLOCATABLE)
407 tem = gfc_conv_descriptor_data_get (unshare_expr (declf));
408 else if (GFC_DECL_GET_SCALAR_ALLOCATABLE (field))
409 tem = unshare_expr (declf);
410 else
411 tem = NULL_TREE;
412 if (tem)
413 {
414 tem = fold_convert (pvoid_type_node, tem);
415 tem = fold_build2_loc (input_location, NE_EXPR,
416 logical_type_node, tem,
417 null_pointer_node);
418 then_b = build3_loc (input_location, COND_EXPR, void_type_node,
419 tem, then_b,
420 build_empty_stmt (input_location));
421 }
422 gfc_add_expr_to_block (&block, then_b);
423 }
424 if (kind == WALK_ALLOC_COMPS_DTOR)
425 {
426 if (GFC_DESCRIPTOR_TYPE_P (ftype)
427 && GFC_TYPE_ARRAY_AKIND (ftype) == GFC_ARRAY_ALLOCATABLE)
428 {
429 tem = gfc_conv_descriptor_data_get (unshare_expr (declf));
430 tem = gfc_deallocate_with_status (tem, NULL_TREE, NULL_TREE,
431 NULL_TREE, NULL_TREE, true,
432 NULL,
433 GFC_CAF_COARRAY_NOCOARRAY);
434 gfc_add_expr_to_block (&block, gfc_omp_unshare_expr (tem));
435 }
436 else if (GFC_DECL_GET_SCALAR_ALLOCATABLE (field))
437 {
438 tem = gfc_call_free (unshare_expr (declf));
439 gfc_add_expr_to_block (&block, gfc_omp_unshare_expr (tem));
440 }
441 }
442 }
443
444 return gfc_finish_block (&block);
445 }
446
447 /* Return code to initialize DECL with its default constructor, or
448 NULL if there's nothing to do. */
449
450 tree
451 gfc_omp_clause_default_ctor (tree clause, tree decl, tree outer)
452 {
453 tree type = TREE_TYPE (decl), size, ptr, cond, then_b, else_b;
454 stmtblock_t block, cond_block;
455
456 gcc_assert (OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_PRIVATE
457 || OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_LASTPRIVATE
458 || OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_LINEAR
459 || OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_REDUCTION);
460
461 if ((! GFC_DESCRIPTOR_TYPE_P (type)
462 || GFC_TYPE_ARRAY_AKIND (type) != GFC_ARRAY_ALLOCATABLE)
463 && !GFC_DECL_GET_SCALAR_ALLOCATABLE (OMP_CLAUSE_DECL (clause)))
464 {
465 if (gfc_has_alloc_comps (type, OMP_CLAUSE_DECL (clause)))
466 {
467 gcc_assert (outer);
468 gfc_start_block (&block);
469 tree tem = gfc_walk_alloc_comps (outer, decl,
470 OMP_CLAUSE_DECL (clause),
471 WALK_ALLOC_COMPS_DEFAULT_CTOR);
472 gfc_add_expr_to_block (&block, tem);
473 return gfc_finish_block (&block);
474 }
475 return NULL_TREE;
476 }
477
478 gcc_assert (outer != NULL_TREE);
479
480 /* Allocatable arrays and scalars in PRIVATE clauses need to be set to
481 "not currently allocated" allocation status if outer
482 array is "not currently allocated", otherwise should be allocated. */
483 gfc_start_block (&block);
484
485 gfc_init_block (&cond_block);
486
487 if (GFC_DESCRIPTOR_TYPE_P (type))
488 {
489 gfc_add_modify (&cond_block, decl, outer);
490 tree rank = gfc_rank_cst[GFC_TYPE_ARRAY_RANK (type) - 1];
491 size = gfc_conv_descriptor_ubound_get (decl, rank);
492 size = fold_build2_loc (input_location, MINUS_EXPR, gfc_array_index_type,
493 size,
494 gfc_conv_descriptor_lbound_get (decl, rank));
495 size = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
496 size, gfc_index_one_node);
497 if (GFC_TYPE_ARRAY_RANK (type) > 1)
498 size = fold_build2_loc (input_location, MULT_EXPR,
499 gfc_array_index_type, size,
500 gfc_conv_descriptor_stride_get (decl, rank));
501 tree esize = fold_convert (gfc_array_index_type,
502 TYPE_SIZE_UNIT (gfc_get_element_type (type)));
503 size = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
504 size, esize);
505 size = unshare_expr (size);
506 size = gfc_evaluate_now (fold_convert (size_type_node, size),
507 &cond_block);
508 }
509 else
510 size = fold_convert (size_type_node, TYPE_SIZE_UNIT (TREE_TYPE (type)));
511 ptr = gfc_create_var (pvoid_type_node, NULL);
512 gfc_allocate_using_malloc (&cond_block, ptr, size, NULL_TREE);
513 if (GFC_DESCRIPTOR_TYPE_P (type))
514 gfc_conv_descriptor_data_set (&cond_block, unshare_expr (decl), ptr);
515 else
516 gfc_add_modify (&cond_block, unshare_expr (decl),
517 fold_convert (TREE_TYPE (decl), ptr));
518 if (gfc_has_alloc_comps (type, OMP_CLAUSE_DECL (clause)))
519 {
520 tree tem = gfc_walk_alloc_comps (outer, decl,
521 OMP_CLAUSE_DECL (clause),
522 WALK_ALLOC_COMPS_DEFAULT_CTOR);
523 gfc_add_expr_to_block (&cond_block, tem);
524 }
525 then_b = gfc_finish_block (&cond_block);
526
527 /* Reduction clause requires allocated ALLOCATABLE. */
528 if (OMP_CLAUSE_CODE (clause) != OMP_CLAUSE_REDUCTION)
529 {
530 gfc_init_block (&cond_block);
531 if (GFC_DESCRIPTOR_TYPE_P (type))
532 gfc_conv_descriptor_data_set (&cond_block, unshare_expr (decl),
533 null_pointer_node);
534 else
535 gfc_add_modify (&cond_block, unshare_expr (decl),
536 build_zero_cst (TREE_TYPE (decl)));
537 else_b = gfc_finish_block (&cond_block);
538
539 tree tem = fold_convert (pvoid_type_node,
540 GFC_DESCRIPTOR_TYPE_P (type)
541 ? gfc_conv_descriptor_data_get (outer) : outer);
542 tem = unshare_expr (tem);
543 cond = fold_build2_loc (input_location, NE_EXPR, logical_type_node,
544 tem, null_pointer_node);
545 gfc_add_expr_to_block (&block,
546 build3_loc (input_location, COND_EXPR,
547 void_type_node, cond, then_b,
548 else_b));
549 }
550 else
551 gfc_add_expr_to_block (&block, then_b);
552
553 return gfc_finish_block (&block);
554 }
555
556 /* Build and return code for a copy constructor from SRC to DEST. */
557
558 tree
559 gfc_omp_clause_copy_ctor (tree clause, tree dest, tree src)
560 {
561 tree type = TREE_TYPE (dest), ptr, size, call;
562 tree cond, then_b, else_b;
563 stmtblock_t block, cond_block;
564
565 gcc_assert (OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_FIRSTPRIVATE
566 || OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_LINEAR);
567
568 if ((! GFC_DESCRIPTOR_TYPE_P (type)
569 || GFC_TYPE_ARRAY_AKIND (type) != GFC_ARRAY_ALLOCATABLE)
570 && !GFC_DECL_GET_SCALAR_ALLOCATABLE (OMP_CLAUSE_DECL (clause)))
571 {
572 if (gfc_has_alloc_comps (type, OMP_CLAUSE_DECL (clause)))
573 {
574 gfc_start_block (&block);
575 gfc_add_modify (&block, dest, src);
576 tree tem = gfc_walk_alloc_comps (src, dest, OMP_CLAUSE_DECL (clause),
577 WALK_ALLOC_COMPS_COPY_CTOR);
578 gfc_add_expr_to_block (&block, tem);
579 return gfc_finish_block (&block);
580 }
581 else
582 return build2_v (MODIFY_EXPR, dest, src);
583 }
584
585 /* Allocatable arrays in FIRSTPRIVATE clauses need to be allocated
586 and copied from SRC. */
587 gfc_start_block (&block);
588
589 gfc_init_block (&cond_block);
590
591 gfc_add_modify (&cond_block, dest, src);
592 if (GFC_DESCRIPTOR_TYPE_P (type))
593 {
594 tree rank = gfc_rank_cst[GFC_TYPE_ARRAY_RANK (type) - 1];
595 size = gfc_conv_descriptor_ubound_get (dest, rank);
596 size = fold_build2_loc (input_location, MINUS_EXPR, gfc_array_index_type,
597 size,
598 gfc_conv_descriptor_lbound_get (dest, rank));
599 size = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
600 size, gfc_index_one_node);
601 if (GFC_TYPE_ARRAY_RANK (type) > 1)
602 size = fold_build2_loc (input_location, MULT_EXPR,
603 gfc_array_index_type, size,
604 gfc_conv_descriptor_stride_get (dest, rank));
605 tree esize = fold_convert (gfc_array_index_type,
606 TYPE_SIZE_UNIT (gfc_get_element_type (type)));
607 size = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
608 size, esize);
609 size = unshare_expr (size);
610 size = gfc_evaluate_now (fold_convert (size_type_node, size),
611 &cond_block);
612 }
613 else
614 size = fold_convert (size_type_node, TYPE_SIZE_UNIT (TREE_TYPE (type)));
615 ptr = gfc_create_var (pvoid_type_node, NULL);
616 gfc_allocate_using_malloc (&cond_block, ptr, size, NULL_TREE);
617 if (GFC_DESCRIPTOR_TYPE_P (type))
618 gfc_conv_descriptor_data_set (&cond_block, unshare_expr (dest), ptr);
619 else
620 gfc_add_modify (&cond_block, unshare_expr (dest),
621 fold_convert (TREE_TYPE (dest), ptr));
622
623 tree srcptr = GFC_DESCRIPTOR_TYPE_P (type)
624 ? gfc_conv_descriptor_data_get (src) : src;
625 srcptr = unshare_expr (srcptr);
626 srcptr = fold_convert (pvoid_type_node, srcptr);
627 call = build_call_expr_loc (input_location,
628 builtin_decl_explicit (BUILT_IN_MEMCPY), 3, ptr,
629 srcptr, size);
630 gfc_add_expr_to_block (&cond_block, fold_convert (void_type_node, call));
631 if (gfc_has_alloc_comps (type, OMP_CLAUSE_DECL (clause)))
632 {
633 tree tem = gfc_walk_alloc_comps (src, dest,
634 OMP_CLAUSE_DECL (clause),
635 WALK_ALLOC_COMPS_COPY_CTOR);
636 gfc_add_expr_to_block (&cond_block, tem);
637 }
638 then_b = gfc_finish_block (&cond_block);
639
640 gfc_init_block (&cond_block);
641 if (GFC_DESCRIPTOR_TYPE_P (type))
642 gfc_conv_descriptor_data_set (&cond_block, unshare_expr (dest),
643 null_pointer_node);
644 else
645 gfc_add_modify (&cond_block, unshare_expr (dest),
646 build_zero_cst (TREE_TYPE (dest)));
647 else_b = gfc_finish_block (&cond_block);
648
649 cond = fold_build2_loc (input_location, NE_EXPR, logical_type_node,
650 unshare_expr (srcptr), null_pointer_node);
651 gfc_add_expr_to_block (&block,
652 build3_loc (input_location, COND_EXPR,
653 void_type_node, cond, then_b, else_b));
654
655 return gfc_finish_block (&block);
656 }
657
658 /* Similarly, except use an intrinsic or pointer assignment operator
659 instead. */
660
661 tree
662 gfc_omp_clause_assign_op (tree clause, tree dest, tree src)
663 {
664 tree type = TREE_TYPE (dest), ptr, size, call, nonalloc;
665 tree cond, then_b, else_b;
666 stmtblock_t block, cond_block, cond_block2, inner_block;
667
668 if ((! GFC_DESCRIPTOR_TYPE_P (type)
669 || GFC_TYPE_ARRAY_AKIND (type) != GFC_ARRAY_ALLOCATABLE)
670 && !GFC_DECL_GET_SCALAR_ALLOCATABLE (OMP_CLAUSE_DECL (clause)))
671 {
672 if (gfc_has_alloc_comps (type, OMP_CLAUSE_DECL (clause)))
673 {
674 gfc_start_block (&block);
675 /* First dealloc any allocatable components in DEST. */
676 tree tem = gfc_walk_alloc_comps (dest, NULL_TREE,
677 OMP_CLAUSE_DECL (clause),
678 WALK_ALLOC_COMPS_DTOR);
679 gfc_add_expr_to_block (&block, tem);
680 /* Then copy over toplevel data. */
681 gfc_add_modify (&block, dest, src);
682 /* Finally allocate any allocatable components and copy. */
683 tem = gfc_walk_alloc_comps (src, dest, OMP_CLAUSE_DECL (clause),
684 WALK_ALLOC_COMPS_COPY_CTOR);
685 gfc_add_expr_to_block (&block, tem);
686 return gfc_finish_block (&block);
687 }
688 else
689 return build2_v (MODIFY_EXPR, dest, src);
690 }
691
692 gfc_start_block (&block);
693
694 if (gfc_has_alloc_comps (type, OMP_CLAUSE_DECL (clause)))
695 {
696 then_b = gfc_walk_alloc_comps (dest, NULL_TREE, OMP_CLAUSE_DECL (clause),
697 WALK_ALLOC_COMPS_DTOR);
698 tree tem = fold_convert (pvoid_type_node,
699 GFC_DESCRIPTOR_TYPE_P (type)
700 ? gfc_conv_descriptor_data_get (dest) : dest);
701 tem = unshare_expr (tem);
702 cond = fold_build2_loc (input_location, NE_EXPR, logical_type_node,
703 tem, null_pointer_node);
704 tem = build3_loc (input_location, COND_EXPR, void_type_node, cond,
705 then_b, build_empty_stmt (input_location));
706 gfc_add_expr_to_block (&block, tem);
707 }
708
709 gfc_init_block (&cond_block);
710
711 if (GFC_DESCRIPTOR_TYPE_P (type))
712 {
713 tree rank = gfc_rank_cst[GFC_TYPE_ARRAY_RANK (type) - 1];
714 size = gfc_conv_descriptor_ubound_get (src, rank);
715 size = fold_build2_loc (input_location, MINUS_EXPR, gfc_array_index_type,
716 size,
717 gfc_conv_descriptor_lbound_get (src, rank));
718 size = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
719 size, gfc_index_one_node);
720 if (GFC_TYPE_ARRAY_RANK (type) > 1)
721 size = fold_build2_loc (input_location, MULT_EXPR,
722 gfc_array_index_type, size,
723 gfc_conv_descriptor_stride_get (src, rank));
724 tree esize = fold_convert (gfc_array_index_type,
725 TYPE_SIZE_UNIT (gfc_get_element_type (type)));
726 size = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
727 size, esize);
728 size = unshare_expr (size);
729 size = gfc_evaluate_now (fold_convert (size_type_node, size),
730 &cond_block);
731 }
732 else
733 size = fold_convert (size_type_node, TYPE_SIZE_UNIT (TREE_TYPE (type)));
734 ptr = gfc_create_var (pvoid_type_node, NULL);
735
736 tree destptr = GFC_DESCRIPTOR_TYPE_P (type)
737 ? gfc_conv_descriptor_data_get (dest) : dest;
738 destptr = unshare_expr (destptr);
739 destptr = fold_convert (pvoid_type_node, destptr);
740 gfc_add_modify (&cond_block, ptr, destptr);
741
742 nonalloc = fold_build2_loc (input_location, EQ_EXPR, logical_type_node,
743 destptr, null_pointer_node);
744 cond = nonalloc;
745 if (GFC_DESCRIPTOR_TYPE_P (type))
746 {
747 int i;
748 for (i = 0; i < GFC_TYPE_ARRAY_RANK (type); i++)
749 {
750 tree rank = gfc_rank_cst[i];
751 tree tem = gfc_conv_descriptor_ubound_get (src, rank);
752 tem = fold_build2_loc (input_location, MINUS_EXPR,
753 gfc_array_index_type, tem,
754 gfc_conv_descriptor_lbound_get (src, rank));
755 tem = fold_build2_loc (input_location, PLUS_EXPR,
756 gfc_array_index_type, tem,
757 gfc_conv_descriptor_lbound_get (dest, rank));
758 tem = fold_build2_loc (input_location, NE_EXPR, logical_type_node,
759 tem, gfc_conv_descriptor_ubound_get (dest,
760 rank));
761 cond = fold_build2_loc (input_location, TRUTH_ORIF_EXPR,
762 logical_type_node, cond, tem);
763 }
764 }
765
766 gfc_init_block (&cond_block2);
767
768 if (GFC_DESCRIPTOR_TYPE_P (type))
769 {
770 gfc_init_block (&inner_block);
771 gfc_allocate_using_malloc (&inner_block, ptr, size, NULL_TREE);
772 then_b = gfc_finish_block (&inner_block);
773
774 gfc_init_block (&inner_block);
775 gfc_add_modify (&inner_block, ptr,
776 gfc_call_realloc (&inner_block, ptr, size));
777 else_b = gfc_finish_block (&inner_block);
778
779 gfc_add_expr_to_block (&cond_block2,
780 build3_loc (input_location, COND_EXPR,
781 void_type_node,
782 unshare_expr (nonalloc),
783 then_b, else_b));
784 gfc_add_modify (&cond_block2, dest, src);
785 gfc_conv_descriptor_data_set (&cond_block2, unshare_expr (dest), ptr);
786 }
787 else
788 {
789 gfc_allocate_using_malloc (&cond_block2, ptr, size, NULL_TREE);
790 gfc_add_modify (&cond_block2, unshare_expr (dest),
791 fold_convert (type, ptr));
792 }
793 then_b = gfc_finish_block (&cond_block2);
794 else_b = build_empty_stmt (input_location);
795
796 gfc_add_expr_to_block (&cond_block,
797 build3_loc (input_location, COND_EXPR,
798 void_type_node, unshare_expr (cond),
799 then_b, else_b));
800
801 tree srcptr = GFC_DESCRIPTOR_TYPE_P (type)
802 ? gfc_conv_descriptor_data_get (src) : src;
803 srcptr = unshare_expr (srcptr);
804 srcptr = fold_convert (pvoid_type_node, srcptr);
805 call = build_call_expr_loc (input_location,
806 builtin_decl_explicit (BUILT_IN_MEMCPY), 3, ptr,
807 srcptr, size);
808 gfc_add_expr_to_block (&cond_block, fold_convert (void_type_node, call));
809 if (gfc_has_alloc_comps (type, OMP_CLAUSE_DECL (clause)))
810 {
811 tree tem = gfc_walk_alloc_comps (src, dest,
812 OMP_CLAUSE_DECL (clause),
813 WALK_ALLOC_COMPS_COPY_CTOR);
814 gfc_add_expr_to_block (&cond_block, tem);
815 }
816 then_b = gfc_finish_block (&cond_block);
817
818 if (OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_COPYIN)
819 {
820 gfc_init_block (&cond_block);
821 if (GFC_DESCRIPTOR_TYPE_P (type))
822 {
823 tree tmp = gfc_conv_descriptor_data_get (unshare_expr (dest));
824 tmp = gfc_deallocate_with_status (tmp, NULL_TREE, NULL_TREE,
825 NULL_TREE, NULL_TREE, true, NULL,
826 GFC_CAF_COARRAY_NOCOARRAY);
827 gfc_add_expr_to_block (&cond_block, tmp);
828 }
829 else
830 {
831 destptr = gfc_evaluate_now (destptr, &cond_block);
832 gfc_add_expr_to_block (&cond_block, gfc_call_free (destptr));
833 gfc_add_modify (&cond_block, unshare_expr (dest),
834 build_zero_cst (TREE_TYPE (dest)));
835 }
836 else_b = gfc_finish_block (&cond_block);
837
838 cond = fold_build2_loc (input_location, NE_EXPR, logical_type_node,
839 unshare_expr (srcptr), null_pointer_node);
840 gfc_add_expr_to_block (&block,
841 build3_loc (input_location, COND_EXPR,
842 void_type_node, cond,
843 then_b, else_b));
844 }
845 else
846 gfc_add_expr_to_block (&block, then_b);
847
848 return gfc_finish_block (&block);
849 }
850
851 static void
852 gfc_omp_linear_clause_add_loop (stmtblock_t *block, tree dest, tree src,
853 tree add, tree nelems)
854 {
855 stmtblock_t tmpblock;
856 tree desta, srca, index = gfc_create_var (gfc_array_index_type, "S");
857 nelems = gfc_evaluate_now (nelems, block);
858
859 gfc_init_block (&tmpblock);
860 if (TREE_CODE (TREE_TYPE (dest)) == ARRAY_TYPE)
861 {
862 desta = gfc_build_array_ref (dest, index, NULL);
863 srca = gfc_build_array_ref (src, index, NULL);
864 }
865 else
866 {
867 gcc_assert (POINTER_TYPE_P (TREE_TYPE (dest)));
868 tree idx = fold_build2 (MULT_EXPR, sizetype,
869 fold_convert (sizetype, index),
870 TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (dest))));
871 desta = build_fold_indirect_ref (fold_build2 (POINTER_PLUS_EXPR,
872 TREE_TYPE (dest), dest,
873 idx));
874 srca = build_fold_indirect_ref (fold_build2 (POINTER_PLUS_EXPR,
875 TREE_TYPE (src), src,
876 idx));
877 }
878 gfc_add_modify (&tmpblock, desta,
879 fold_build2 (PLUS_EXPR, TREE_TYPE (desta),
880 srca, add));
881
882 gfc_loopinfo loop;
883 gfc_init_loopinfo (&loop);
884 loop.dimen = 1;
885 loop.from[0] = gfc_index_zero_node;
886 loop.loopvar[0] = index;
887 loop.to[0] = nelems;
888 gfc_trans_scalarizing_loops (&loop, &tmpblock);
889 gfc_add_block_to_block (block, &loop.pre);
890 }
891
892 /* Build and return code for a constructor of DEST that initializes
893 it to SRC plus ADD (ADD is scalar integer). */
894
895 tree
896 gfc_omp_clause_linear_ctor (tree clause, tree dest, tree src, tree add)
897 {
898 tree type = TREE_TYPE (dest), ptr, size, nelems = NULL_TREE;
899 stmtblock_t block;
900
901 gcc_assert (OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_LINEAR);
902
903 gfc_start_block (&block);
904 add = gfc_evaluate_now (add, &block);
905
906 if ((! GFC_DESCRIPTOR_TYPE_P (type)
907 || GFC_TYPE_ARRAY_AKIND (type) != GFC_ARRAY_ALLOCATABLE)
908 && !GFC_DECL_GET_SCALAR_ALLOCATABLE (OMP_CLAUSE_DECL (clause)))
909 {
910 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
911 if (!TYPE_DOMAIN (type)
912 || TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL_TREE
913 || TYPE_MIN_VALUE (TYPE_DOMAIN (type)) == error_mark_node
914 || TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == error_mark_node)
915 {
916 nelems = fold_build2 (EXACT_DIV_EXPR, sizetype,
917 TYPE_SIZE_UNIT (type),
918 TYPE_SIZE_UNIT (TREE_TYPE (type)));
919 nelems = size_binop (MINUS_EXPR, nelems, size_one_node);
920 }
921 else
922 nelems = array_type_nelts (type);
923 nelems = fold_convert (gfc_array_index_type, nelems);
924
925 gfc_omp_linear_clause_add_loop (&block, dest, src, add, nelems);
926 return gfc_finish_block (&block);
927 }
928
929 /* Allocatable arrays in LINEAR clauses need to be allocated
930 and copied from SRC. */
931 gfc_add_modify (&block, dest, src);
932 if (GFC_DESCRIPTOR_TYPE_P (type))
933 {
934 tree rank = gfc_rank_cst[GFC_TYPE_ARRAY_RANK (type) - 1];
935 size = gfc_conv_descriptor_ubound_get (dest, rank);
936 size = fold_build2_loc (input_location, MINUS_EXPR, gfc_array_index_type,
937 size,
938 gfc_conv_descriptor_lbound_get (dest, rank));
939 size = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
940 size, gfc_index_one_node);
941 if (GFC_TYPE_ARRAY_RANK (type) > 1)
942 size = fold_build2_loc (input_location, MULT_EXPR,
943 gfc_array_index_type, size,
944 gfc_conv_descriptor_stride_get (dest, rank));
945 tree esize = fold_convert (gfc_array_index_type,
946 TYPE_SIZE_UNIT (gfc_get_element_type (type)));
947 nelems = gfc_evaluate_now (unshare_expr (size), &block);
948 size = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
949 nelems, unshare_expr (esize));
950 size = gfc_evaluate_now (fold_convert (size_type_node, size),
951 &block);
952 nelems = fold_build2_loc (input_location, MINUS_EXPR,
953 gfc_array_index_type, nelems,
954 gfc_index_one_node);
955 }
956 else
957 size = fold_convert (size_type_node, TYPE_SIZE_UNIT (TREE_TYPE (type)));
958 ptr = gfc_create_var (pvoid_type_node, NULL);
959 gfc_allocate_using_malloc (&block, ptr, size, NULL_TREE);
960 if (GFC_DESCRIPTOR_TYPE_P (type))
961 {
962 gfc_conv_descriptor_data_set (&block, unshare_expr (dest), ptr);
963 tree etype = gfc_get_element_type (type);
964 ptr = fold_convert (build_pointer_type (etype), ptr);
965 tree srcptr = gfc_conv_descriptor_data_get (unshare_expr (src));
966 srcptr = fold_convert (build_pointer_type (etype), srcptr);
967 gfc_omp_linear_clause_add_loop (&block, ptr, srcptr, add, nelems);
968 }
969 else
970 {
971 gfc_add_modify (&block, unshare_expr (dest),
972 fold_convert (TREE_TYPE (dest), ptr));
973 ptr = fold_convert (TREE_TYPE (dest), ptr);
974 tree dstm = build_fold_indirect_ref (ptr);
975 tree srcm = build_fold_indirect_ref (unshare_expr (src));
976 gfc_add_modify (&block, dstm,
977 fold_build2 (PLUS_EXPR, TREE_TYPE (add), srcm, add));
978 }
979 return gfc_finish_block (&block);
980 }
981
982 /* Build and return code destructing DECL. Return NULL if nothing
983 to be done. */
984
985 tree
986 gfc_omp_clause_dtor (tree clause, tree decl)
987 {
988 tree type = TREE_TYPE (decl), tem;
989
990 if ((! GFC_DESCRIPTOR_TYPE_P (type)
991 || GFC_TYPE_ARRAY_AKIND (type) != GFC_ARRAY_ALLOCATABLE)
992 && !GFC_DECL_GET_SCALAR_ALLOCATABLE (OMP_CLAUSE_DECL (clause)))
993 {
994 if (gfc_has_alloc_comps (type, OMP_CLAUSE_DECL (clause)))
995 return gfc_walk_alloc_comps (decl, NULL_TREE,
996 OMP_CLAUSE_DECL (clause),
997 WALK_ALLOC_COMPS_DTOR);
998 return NULL_TREE;
999 }
1000
1001 if (GFC_DESCRIPTOR_TYPE_P (type))
1002 {
1003 /* Allocatable arrays in FIRSTPRIVATE/LASTPRIVATE etc. clauses need
1004 to be deallocated if they were allocated. */
1005 tem = gfc_conv_descriptor_data_get (decl);
1006 tem = gfc_deallocate_with_status (tem, NULL_TREE, NULL_TREE, NULL_TREE,
1007 NULL_TREE, true, NULL,
1008 GFC_CAF_COARRAY_NOCOARRAY);
1009 }
1010 else
1011 tem = gfc_call_free (decl);
1012 tem = gfc_omp_unshare_expr (tem);
1013
1014 if (gfc_has_alloc_comps (type, OMP_CLAUSE_DECL (clause)))
1015 {
1016 stmtblock_t block;
1017 tree then_b;
1018
1019 gfc_init_block (&block);
1020 gfc_add_expr_to_block (&block,
1021 gfc_walk_alloc_comps (decl, NULL_TREE,
1022 OMP_CLAUSE_DECL (clause),
1023 WALK_ALLOC_COMPS_DTOR));
1024 gfc_add_expr_to_block (&block, tem);
1025 then_b = gfc_finish_block (&block);
1026
1027 tem = fold_convert (pvoid_type_node,
1028 GFC_DESCRIPTOR_TYPE_P (type)
1029 ? gfc_conv_descriptor_data_get (decl) : decl);
1030 tem = unshare_expr (tem);
1031 tree cond = fold_build2_loc (input_location, NE_EXPR, logical_type_node,
1032 tem, null_pointer_node);
1033 tem = build3_loc (input_location, COND_EXPR, void_type_node, cond,
1034 then_b, build_empty_stmt (input_location));
1035 }
1036 return tem;
1037 }
1038
1039
1040 void
1041 gfc_omp_finish_clause (tree c, gimple_seq *pre_p)
1042 {
1043 if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_MAP)
1044 return;
1045
1046 tree decl = OMP_CLAUSE_DECL (c);
1047
1048 /* Assumed-size arrays can't be mapped implicitly, they have to be
1049 mapped explicitly using array sections. */
1050 if (TREE_CODE (decl) == PARM_DECL
1051 && GFC_ARRAY_TYPE_P (TREE_TYPE (decl))
1052 && GFC_TYPE_ARRAY_AKIND (TREE_TYPE (decl)) == GFC_ARRAY_UNKNOWN
1053 && GFC_TYPE_ARRAY_UBOUND (TREE_TYPE (decl),
1054 GFC_TYPE_ARRAY_RANK (TREE_TYPE (decl)) - 1)
1055 == NULL)
1056 {
1057 error_at (OMP_CLAUSE_LOCATION (c),
1058 "implicit mapping of assumed size array %qD", decl);
1059 return;
1060 }
1061
1062 tree c2 = NULL_TREE, c3 = NULL_TREE, c4 = NULL_TREE;
1063 if (POINTER_TYPE_P (TREE_TYPE (decl)))
1064 {
1065 if (!gfc_omp_privatize_by_reference (decl)
1066 && !GFC_DECL_GET_SCALAR_POINTER (decl)
1067 && !GFC_DECL_GET_SCALAR_ALLOCATABLE (decl)
1068 && !GFC_DECL_CRAY_POINTEE (decl)
1069 && !GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (TREE_TYPE (decl))))
1070 return;
1071 tree orig_decl = decl;
1072 c4 = build_omp_clause (OMP_CLAUSE_LOCATION (c), OMP_CLAUSE_MAP);
1073 OMP_CLAUSE_SET_MAP_KIND (c4, GOMP_MAP_POINTER);
1074 OMP_CLAUSE_DECL (c4) = decl;
1075 OMP_CLAUSE_SIZE (c4) = size_int (0);
1076 decl = build_fold_indirect_ref (decl);
1077 OMP_CLAUSE_DECL (c) = decl;
1078 OMP_CLAUSE_SIZE (c) = NULL_TREE;
1079 if (TREE_CODE (TREE_TYPE (orig_decl)) == REFERENCE_TYPE
1080 && (GFC_DECL_GET_SCALAR_POINTER (orig_decl)
1081 || GFC_DECL_GET_SCALAR_ALLOCATABLE (orig_decl)))
1082 {
1083 c3 = build_omp_clause (OMP_CLAUSE_LOCATION (c), OMP_CLAUSE_MAP);
1084 OMP_CLAUSE_SET_MAP_KIND (c3, GOMP_MAP_POINTER);
1085 OMP_CLAUSE_DECL (c3) = unshare_expr (decl);
1086 OMP_CLAUSE_SIZE (c3) = size_int (0);
1087 decl = build_fold_indirect_ref (decl);
1088 OMP_CLAUSE_DECL (c) = decl;
1089 }
1090 }
1091 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl)))
1092 {
1093 stmtblock_t block;
1094 gfc_start_block (&block);
1095 tree type = TREE_TYPE (decl);
1096 tree ptr = gfc_conv_descriptor_data_get (decl);
1097 ptr = fold_convert (build_pointer_type (char_type_node), ptr);
1098 ptr = build_fold_indirect_ref (ptr);
1099 OMP_CLAUSE_DECL (c) = ptr;
1100 c2 = build_omp_clause (input_location, OMP_CLAUSE_MAP);
1101 OMP_CLAUSE_SET_MAP_KIND (c2, GOMP_MAP_TO_PSET);
1102 OMP_CLAUSE_DECL (c2) = decl;
1103 OMP_CLAUSE_SIZE (c2) = TYPE_SIZE_UNIT (type);
1104 c3 = build_omp_clause (OMP_CLAUSE_LOCATION (c), OMP_CLAUSE_MAP);
1105 OMP_CLAUSE_SET_MAP_KIND (c3, GOMP_MAP_POINTER);
1106 OMP_CLAUSE_DECL (c3) = gfc_conv_descriptor_data_get (decl);
1107 OMP_CLAUSE_SIZE (c3) = size_int (0);
1108 tree size = create_tmp_var (gfc_array_index_type);
1109 tree elemsz = TYPE_SIZE_UNIT (gfc_get_element_type (type));
1110 elemsz = fold_convert (gfc_array_index_type, elemsz);
1111 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_POINTER
1112 || GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_POINTER_CONT)
1113 {
1114 stmtblock_t cond_block;
1115 tree tem, then_b, else_b, zero, cond;
1116
1117 gfc_init_block (&cond_block);
1118 tem = gfc_full_array_size (&cond_block, decl,
1119 GFC_TYPE_ARRAY_RANK (type));
1120 gfc_add_modify (&cond_block, size, tem);
1121 gfc_add_modify (&cond_block, size,
1122 fold_build2 (MULT_EXPR, gfc_array_index_type,
1123 size, elemsz));
1124 then_b = gfc_finish_block (&cond_block);
1125 gfc_init_block (&cond_block);
1126 zero = build_int_cst (gfc_array_index_type, 0);
1127 gfc_add_modify (&cond_block, size, zero);
1128 else_b = gfc_finish_block (&cond_block);
1129 tem = gfc_conv_descriptor_data_get (decl);
1130 tem = fold_convert (pvoid_type_node, tem);
1131 cond = fold_build2_loc (input_location, NE_EXPR,
1132 logical_type_node, tem, null_pointer_node);
1133 gfc_add_expr_to_block (&block, build3_loc (input_location, COND_EXPR,
1134 void_type_node, cond,
1135 then_b, else_b));
1136 }
1137 else
1138 {
1139 gfc_add_modify (&block, size,
1140 gfc_full_array_size (&block, decl,
1141 GFC_TYPE_ARRAY_RANK (type)));
1142 gfc_add_modify (&block, size,
1143 fold_build2 (MULT_EXPR, gfc_array_index_type,
1144 size, elemsz));
1145 }
1146 OMP_CLAUSE_SIZE (c) = size;
1147 tree stmt = gfc_finish_block (&block);
1148 gimplify_and_add (stmt, pre_p);
1149 }
1150 tree last = c;
1151 if (OMP_CLAUSE_SIZE (c) == NULL_TREE)
1152 OMP_CLAUSE_SIZE (c)
1153 = DECL_P (decl) ? DECL_SIZE_UNIT (decl)
1154 : TYPE_SIZE_UNIT (TREE_TYPE (decl));
1155 if (c2)
1156 {
1157 OMP_CLAUSE_CHAIN (c2) = OMP_CLAUSE_CHAIN (last);
1158 OMP_CLAUSE_CHAIN (last) = c2;
1159 last = c2;
1160 }
1161 if (c3)
1162 {
1163 OMP_CLAUSE_CHAIN (c3) = OMP_CLAUSE_CHAIN (last);
1164 OMP_CLAUSE_CHAIN (last) = c3;
1165 last = c3;
1166 }
1167 if (c4)
1168 {
1169 OMP_CLAUSE_CHAIN (c4) = OMP_CLAUSE_CHAIN (last);
1170 OMP_CLAUSE_CHAIN (last) = c4;
1171 last = c4;
1172 }
1173 }
1174
1175
1176 /* Return true if DECL is a scalar variable (for the purpose of
1177 implicit firstprivatization). */
1178
1179 bool
1180 gfc_omp_scalar_p (tree decl)
1181 {
1182 tree type = TREE_TYPE (decl);
1183 if (TREE_CODE (type) == REFERENCE_TYPE)
1184 type = TREE_TYPE (type);
1185 if (TREE_CODE (type) == POINTER_TYPE)
1186 {
1187 if (GFC_DECL_GET_SCALAR_ALLOCATABLE (decl)
1188 || GFC_DECL_GET_SCALAR_POINTER (decl))
1189 type = TREE_TYPE (type);
1190 if (GFC_ARRAY_TYPE_P (type)
1191 || GFC_CLASS_TYPE_P (type))
1192 return false;
1193 }
1194 if (TYPE_STRING_FLAG (type))
1195 return false;
1196 if (INTEGRAL_TYPE_P (type)
1197 || SCALAR_FLOAT_TYPE_P (type)
1198 || COMPLEX_FLOAT_TYPE_P (type))
1199 return true;
1200 return false;
1201 }
1202
1203
1204 /* Return true if DECL's DECL_VALUE_EXPR (if any) should be
1205 disregarded in OpenMP construct, because it is going to be
1206 remapped during OpenMP lowering. SHARED is true if DECL
1207 is going to be shared, false if it is going to be privatized. */
1208
1209 bool
1210 gfc_omp_disregard_value_expr (tree decl, bool shared)
1211 {
1212 if (GFC_DECL_COMMON_OR_EQUIV (decl)
1213 && DECL_HAS_VALUE_EXPR_P (decl))
1214 {
1215 tree value = DECL_VALUE_EXPR (decl);
1216
1217 if (TREE_CODE (value) == COMPONENT_REF
1218 && VAR_P (TREE_OPERAND (value, 0))
1219 && GFC_DECL_COMMON_OR_EQUIV (TREE_OPERAND (value, 0)))
1220 {
1221 /* If variable in COMMON or EQUIVALENCE is privatized, return
1222 true, as just that variable is supposed to be privatized,
1223 not the whole COMMON or whole EQUIVALENCE.
1224 For shared variables in COMMON or EQUIVALENCE, let them be
1225 gimplified to DECL_VALUE_EXPR, so that for multiple shared vars
1226 from the same COMMON or EQUIVALENCE just one sharing of the
1227 whole COMMON or EQUIVALENCE is enough. */
1228 return ! shared;
1229 }
1230 }
1231
1232 if (GFC_DECL_RESULT (decl) && DECL_HAS_VALUE_EXPR_P (decl))
1233 return ! shared;
1234
1235 return false;
1236 }
1237
1238 /* Return true if DECL that is shared iff SHARED is true should
1239 be put into OMP_CLAUSE_PRIVATE with OMP_CLAUSE_PRIVATE_DEBUG
1240 flag set. */
1241
1242 bool
1243 gfc_omp_private_debug_clause (tree decl, bool shared)
1244 {
1245 if (GFC_DECL_CRAY_POINTEE (decl))
1246 return true;
1247
1248 if (GFC_DECL_COMMON_OR_EQUIV (decl)
1249 && DECL_HAS_VALUE_EXPR_P (decl))
1250 {
1251 tree value = DECL_VALUE_EXPR (decl);
1252
1253 if (TREE_CODE (value) == COMPONENT_REF
1254 && VAR_P (TREE_OPERAND (value, 0))
1255 && GFC_DECL_COMMON_OR_EQUIV (TREE_OPERAND (value, 0)))
1256 return shared;
1257 }
1258
1259 return false;
1260 }
1261
1262 /* Register language specific type size variables as potentially OpenMP
1263 firstprivate variables. */
1264
1265 void
1266 gfc_omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
1267 {
1268 if (GFC_ARRAY_TYPE_P (type) || GFC_DESCRIPTOR_TYPE_P (type))
1269 {
1270 int r;
1271
1272 gcc_assert (TYPE_LANG_SPECIFIC (type) != NULL);
1273 for (r = 0; r < GFC_TYPE_ARRAY_RANK (type); r++)
1274 {
1275 omp_firstprivatize_variable (ctx, GFC_TYPE_ARRAY_LBOUND (type, r));
1276 omp_firstprivatize_variable (ctx, GFC_TYPE_ARRAY_UBOUND (type, r));
1277 omp_firstprivatize_variable (ctx, GFC_TYPE_ARRAY_STRIDE (type, r));
1278 }
1279 omp_firstprivatize_variable (ctx, GFC_TYPE_ARRAY_SIZE (type));
1280 omp_firstprivatize_variable (ctx, GFC_TYPE_ARRAY_OFFSET (type));
1281 }
1282 }
1283
1284
1285 static inline tree
1286 gfc_trans_add_clause (tree node, tree tail)
1287 {
1288 OMP_CLAUSE_CHAIN (node) = tail;
1289 return node;
1290 }
1291
1292 static tree
1293 gfc_trans_omp_variable (gfc_symbol *sym, bool declare_simd)
1294 {
1295 if (declare_simd)
1296 {
1297 int cnt = 0;
1298 gfc_symbol *proc_sym;
1299 gfc_formal_arglist *f;
1300
1301 gcc_assert (sym->attr.dummy);
1302 proc_sym = sym->ns->proc_name;
1303 if (proc_sym->attr.entry_master)
1304 ++cnt;
1305 if (gfc_return_by_reference (proc_sym))
1306 {
1307 ++cnt;
1308 if (proc_sym->ts.type == BT_CHARACTER)
1309 ++cnt;
1310 }
1311 for (f = gfc_sym_get_dummy_args (proc_sym); f; f = f->next)
1312 if (f->sym == sym)
1313 break;
1314 else if (f->sym)
1315 ++cnt;
1316 gcc_assert (f);
1317 return build_int_cst (integer_type_node, cnt);
1318 }
1319
1320 tree t = gfc_get_symbol_decl (sym);
1321 tree parent_decl;
1322 int parent_flag;
1323 bool return_value;
1324 bool alternate_entry;
1325 bool entry_master;
1326
1327 return_value = sym->attr.function && sym->result == sym;
1328 alternate_entry = sym->attr.function && sym->attr.entry
1329 && sym->result == sym;
1330 entry_master = sym->attr.result
1331 && sym->ns->proc_name->attr.entry_master
1332 && !gfc_return_by_reference (sym->ns->proc_name);
1333 parent_decl = current_function_decl
1334 ? DECL_CONTEXT (current_function_decl) : NULL_TREE;
1335
1336 if ((t == parent_decl && return_value)
1337 || (sym->ns && sym->ns->proc_name
1338 && sym->ns->proc_name->backend_decl == parent_decl
1339 && (alternate_entry || entry_master)))
1340 parent_flag = 1;
1341 else
1342 parent_flag = 0;
1343
1344 /* Special case for assigning the return value of a function.
1345 Self recursive functions must have an explicit return value. */
1346 if (return_value && (t == current_function_decl || parent_flag))
1347 t = gfc_get_fake_result_decl (sym, parent_flag);
1348
1349 /* Similarly for alternate entry points. */
1350 else if (alternate_entry
1351 && (sym->ns->proc_name->backend_decl == current_function_decl
1352 || parent_flag))
1353 {
1354 gfc_entry_list *el = NULL;
1355
1356 for (el = sym->ns->entries; el; el = el->next)
1357 if (sym == el->sym)
1358 {
1359 t = gfc_get_fake_result_decl (sym, parent_flag);
1360 break;
1361 }
1362 }
1363
1364 else if (entry_master
1365 && (sym->ns->proc_name->backend_decl == current_function_decl
1366 || parent_flag))
1367 t = gfc_get_fake_result_decl (sym, parent_flag);
1368
1369 return t;
1370 }
1371
1372 static tree
1373 gfc_trans_omp_variable_list (enum omp_clause_code code,
1374 gfc_omp_namelist *namelist, tree list,
1375 bool declare_simd)
1376 {
1377 for (; namelist != NULL; namelist = namelist->next)
1378 if (namelist->sym->attr.referenced || declare_simd)
1379 {
1380 tree t = gfc_trans_omp_variable (namelist->sym, declare_simd);
1381 if (t != error_mark_node)
1382 {
1383 tree node = build_omp_clause (input_location, code);
1384 OMP_CLAUSE_DECL (node) = t;
1385 list = gfc_trans_add_clause (node, list);
1386 }
1387 }
1388 return list;
1389 }
1390
1391 struct omp_udr_find_orig_data
1392 {
1393 gfc_omp_udr *omp_udr;
1394 bool omp_orig_seen;
1395 };
1396
1397 static int
1398 omp_udr_find_orig (gfc_expr **e, int *walk_subtrees ATTRIBUTE_UNUSED,
1399 void *data)
1400 {
1401 struct omp_udr_find_orig_data *cd = (struct omp_udr_find_orig_data *) data;
1402 if ((*e)->expr_type == EXPR_VARIABLE
1403 && (*e)->symtree->n.sym == cd->omp_udr->omp_orig)
1404 cd->omp_orig_seen = true;
1405
1406 return 0;
1407 }
1408
1409 static void
1410 gfc_trans_omp_array_reduction_or_udr (tree c, gfc_omp_namelist *n, locus where)
1411 {
1412 gfc_symbol *sym = n->sym;
1413 gfc_symtree *root1 = NULL, *root2 = NULL, *root3 = NULL, *root4 = NULL;
1414 gfc_symtree *symtree1, *symtree2, *symtree3, *symtree4 = NULL;
1415 gfc_symbol init_val_sym, outer_sym, intrinsic_sym;
1416 gfc_symbol omp_var_copy[4];
1417 gfc_expr *e1, *e2, *e3, *e4;
1418 gfc_ref *ref;
1419 tree decl, backend_decl, stmt, type, outer_decl;
1420 locus old_loc = gfc_current_locus;
1421 const char *iname;
1422 bool t;
1423 gfc_omp_udr *udr = n->udr ? n->udr->udr : NULL;
1424
1425 decl = OMP_CLAUSE_DECL (c);
1426 gfc_current_locus = where;
1427 type = TREE_TYPE (decl);
1428 outer_decl = create_tmp_var_raw (type);
1429 if (TREE_CODE (decl) == PARM_DECL
1430 && TREE_CODE (type) == REFERENCE_TYPE
1431 && GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (type))
1432 && GFC_TYPE_ARRAY_AKIND (TREE_TYPE (type)) == GFC_ARRAY_ALLOCATABLE)
1433 {
1434 decl = build_fold_indirect_ref (decl);
1435 type = TREE_TYPE (type);
1436 }
1437
1438 /* Create a fake symbol for init value. */
1439 memset (&init_val_sym, 0, sizeof (init_val_sym));
1440 init_val_sym.ns = sym->ns;
1441 init_val_sym.name = sym->name;
1442 init_val_sym.ts = sym->ts;
1443 init_val_sym.attr.referenced = 1;
1444 init_val_sym.declared_at = where;
1445 init_val_sym.attr.flavor = FL_VARIABLE;
1446 if (OMP_CLAUSE_REDUCTION_CODE (c) != ERROR_MARK)
1447 backend_decl = omp_reduction_init (c, gfc_sym_type (&init_val_sym));
1448 else if (udr->initializer_ns)
1449 backend_decl = NULL;
1450 else
1451 switch (sym->ts.type)
1452 {
1453 case BT_LOGICAL:
1454 case BT_INTEGER:
1455 case BT_REAL:
1456 case BT_COMPLEX:
1457 backend_decl = build_zero_cst (gfc_sym_type (&init_val_sym));
1458 break;
1459 default:
1460 backend_decl = NULL_TREE;
1461 break;
1462 }
1463 init_val_sym.backend_decl = backend_decl;
1464
1465 /* Create a fake symbol for the outer array reference. */
1466 outer_sym = *sym;
1467 if (sym->as)
1468 outer_sym.as = gfc_copy_array_spec (sym->as);
1469 outer_sym.attr.dummy = 0;
1470 outer_sym.attr.result = 0;
1471 outer_sym.attr.flavor = FL_VARIABLE;
1472 outer_sym.backend_decl = outer_decl;
1473 if (decl != OMP_CLAUSE_DECL (c))
1474 outer_sym.backend_decl = build_fold_indirect_ref (outer_decl);
1475
1476 /* Create fake symtrees for it. */
1477 symtree1 = gfc_new_symtree (&root1, sym->name);
1478 symtree1->n.sym = sym;
1479 gcc_assert (symtree1 == root1);
1480
1481 symtree2 = gfc_new_symtree (&root2, sym->name);
1482 symtree2->n.sym = &init_val_sym;
1483 gcc_assert (symtree2 == root2);
1484
1485 symtree3 = gfc_new_symtree (&root3, sym->name);
1486 symtree3->n.sym = &outer_sym;
1487 gcc_assert (symtree3 == root3);
1488
1489 memset (omp_var_copy, 0, sizeof omp_var_copy);
1490 if (udr)
1491 {
1492 omp_var_copy[0] = *udr->omp_out;
1493 omp_var_copy[1] = *udr->omp_in;
1494 *udr->omp_out = outer_sym;
1495 *udr->omp_in = *sym;
1496 if (udr->initializer_ns)
1497 {
1498 omp_var_copy[2] = *udr->omp_priv;
1499 omp_var_copy[3] = *udr->omp_orig;
1500 *udr->omp_priv = *sym;
1501 *udr->omp_orig = outer_sym;
1502 }
1503 }
1504
1505 /* Create expressions. */
1506 e1 = gfc_get_expr ();
1507 e1->expr_type = EXPR_VARIABLE;
1508 e1->where = where;
1509 e1->symtree = symtree1;
1510 e1->ts = sym->ts;
1511 if (sym->attr.dimension)
1512 {
1513 e1->ref = ref = gfc_get_ref ();
1514 ref->type = REF_ARRAY;
1515 ref->u.ar.where = where;
1516 ref->u.ar.as = sym->as;
1517 ref->u.ar.type = AR_FULL;
1518 ref->u.ar.dimen = 0;
1519 }
1520 t = gfc_resolve_expr (e1);
1521 gcc_assert (t);
1522
1523 e2 = NULL;
1524 if (backend_decl != NULL_TREE)
1525 {
1526 e2 = gfc_get_expr ();
1527 e2->expr_type = EXPR_VARIABLE;
1528 e2->where = where;
1529 e2->symtree = symtree2;
1530 e2->ts = sym->ts;
1531 t = gfc_resolve_expr (e2);
1532 gcc_assert (t);
1533 }
1534 else if (udr->initializer_ns == NULL)
1535 {
1536 gcc_assert (sym->ts.type == BT_DERIVED);
1537 e2 = gfc_default_initializer (&sym->ts);
1538 gcc_assert (e2);
1539 t = gfc_resolve_expr (e2);
1540 gcc_assert (t);
1541 }
1542 else if (n->udr->initializer->op == EXEC_ASSIGN)
1543 {
1544 e2 = gfc_copy_expr (n->udr->initializer->expr2);
1545 t = gfc_resolve_expr (e2);
1546 gcc_assert (t);
1547 }
1548 if (udr && udr->initializer_ns)
1549 {
1550 struct omp_udr_find_orig_data cd;
1551 cd.omp_udr = udr;
1552 cd.omp_orig_seen = false;
1553 gfc_code_walker (&n->udr->initializer,
1554 gfc_dummy_code_callback, omp_udr_find_orig, &cd);
1555 if (cd.omp_orig_seen)
1556 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c) = 1;
1557 }
1558
1559 e3 = gfc_copy_expr (e1);
1560 e3->symtree = symtree3;
1561 t = gfc_resolve_expr (e3);
1562 gcc_assert (t);
1563
1564 iname = NULL;
1565 e4 = NULL;
1566 switch (OMP_CLAUSE_REDUCTION_CODE (c))
1567 {
1568 case PLUS_EXPR:
1569 case MINUS_EXPR:
1570 e4 = gfc_add (e3, e1);
1571 break;
1572 case MULT_EXPR:
1573 e4 = gfc_multiply (e3, e1);
1574 break;
1575 case TRUTH_ANDIF_EXPR:
1576 e4 = gfc_and (e3, e1);
1577 break;
1578 case TRUTH_ORIF_EXPR:
1579 e4 = gfc_or (e3, e1);
1580 break;
1581 case EQ_EXPR:
1582 e4 = gfc_eqv (e3, e1);
1583 break;
1584 case NE_EXPR:
1585 e4 = gfc_neqv (e3, e1);
1586 break;
1587 case MIN_EXPR:
1588 iname = "min";
1589 break;
1590 case MAX_EXPR:
1591 iname = "max";
1592 break;
1593 case BIT_AND_EXPR:
1594 iname = "iand";
1595 break;
1596 case BIT_IOR_EXPR:
1597 iname = "ior";
1598 break;
1599 case BIT_XOR_EXPR:
1600 iname = "ieor";
1601 break;
1602 case ERROR_MARK:
1603 if (n->udr->combiner->op == EXEC_ASSIGN)
1604 {
1605 gfc_free_expr (e3);
1606 e3 = gfc_copy_expr (n->udr->combiner->expr1);
1607 e4 = gfc_copy_expr (n->udr->combiner->expr2);
1608 t = gfc_resolve_expr (e3);
1609 gcc_assert (t);
1610 t = gfc_resolve_expr (e4);
1611 gcc_assert (t);
1612 }
1613 break;
1614 default:
1615 gcc_unreachable ();
1616 }
1617 if (iname != NULL)
1618 {
1619 memset (&intrinsic_sym, 0, sizeof (intrinsic_sym));
1620 intrinsic_sym.ns = sym->ns;
1621 intrinsic_sym.name = iname;
1622 intrinsic_sym.ts = sym->ts;
1623 intrinsic_sym.attr.referenced = 1;
1624 intrinsic_sym.attr.intrinsic = 1;
1625 intrinsic_sym.attr.function = 1;
1626 intrinsic_sym.attr.implicit_type = 1;
1627 intrinsic_sym.result = &intrinsic_sym;
1628 intrinsic_sym.declared_at = where;
1629
1630 symtree4 = gfc_new_symtree (&root4, iname);
1631 symtree4->n.sym = &intrinsic_sym;
1632 gcc_assert (symtree4 == root4);
1633
1634 e4 = gfc_get_expr ();
1635 e4->expr_type = EXPR_FUNCTION;
1636 e4->where = where;
1637 e4->symtree = symtree4;
1638 e4->value.function.actual = gfc_get_actual_arglist ();
1639 e4->value.function.actual->expr = e3;
1640 e4->value.function.actual->next = gfc_get_actual_arglist ();
1641 e4->value.function.actual->next->expr = e1;
1642 }
1643 if (OMP_CLAUSE_REDUCTION_CODE (c) != ERROR_MARK)
1644 {
1645 /* e1 and e3 have been stored as arguments of e4, avoid sharing. */
1646 e1 = gfc_copy_expr (e1);
1647 e3 = gfc_copy_expr (e3);
1648 t = gfc_resolve_expr (e4);
1649 gcc_assert (t);
1650 }
1651
1652 /* Create the init statement list. */
1653 pushlevel ();
1654 if (e2)
1655 stmt = gfc_trans_assignment (e1, e2, false, false);
1656 else
1657 stmt = gfc_trans_call (n->udr->initializer, false,
1658 NULL_TREE, NULL_TREE, false);
1659 if (TREE_CODE (stmt) != BIND_EXPR)
1660 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
1661 else
1662 poplevel (0, 0);
1663 OMP_CLAUSE_REDUCTION_INIT (c) = stmt;
1664
1665 /* Create the merge statement list. */
1666 pushlevel ();
1667 if (e4)
1668 stmt = gfc_trans_assignment (e3, e4, false, true);
1669 else
1670 stmt = gfc_trans_call (n->udr->combiner, false,
1671 NULL_TREE, NULL_TREE, false);
1672 if (TREE_CODE (stmt) != BIND_EXPR)
1673 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
1674 else
1675 poplevel (0, 0);
1676 OMP_CLAUSE_REDUCTION_MERGE (c) = stmt;
1677
1678 /* And stick the placeholder VAR_DECL into the clause as well. */
1679 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) = outer_decl;
1680
1681 gfc_current_locus = old_loc;
1682
1683 gfc_free_expr (e1);
1684 if (e2)
1685 gfc_free_expr (e2);
1686 gfc_free_expr (e3);
1687 if (e4)
1688 gfc_free_expr (e4);
1689 free (symtree1);
1690 free (symtree2);
1691 free (symtree3);
1692 free (symtree4);
1693 if (outer_sym.as)
1694 gfc_free_array_spec (outer_sym.as);
1695
1696 if (udr)
1697 {
1698 *udr->omp_out = omp_var_copy[0];
1699 *udr->omp_in = omp_var_copy[1];
1700 if (udr->initializer_ns)
1701 {
1702 *udr->omp_priv = omp_var_copy[2];
1703 *udr->omp_orig = omp_var_copy[3];
1704 }
1705 }
1706 }
1707
1708 static tree
1709 gfc_trans_omp_reduction_list (gfc_omp_namelist *namelist, tree list,
1710 locus where, bool mark_addressable)
1711 {
1712 for (; namelist != NULL; namelist = namelist->next)
1713 if (namelist->sym->attr.referenced)
1714 {
1715 tree t = gfc_trans_omp_variable (namelist->sym, false);
1716 if (t != error_mark_node)
1717 {
1718 tree node = build_omp_clause (where.lb->location,
1719 OMP_CLAUSE_REDUCTION);
1720 OMP_CLAUSE_DECL (node) = t;
1721 if (mark_addressable)
1722 TREE_ADDRESSABLE (t) = 1;
1723 switch (namelist->u.reduction_op)
1724 {
1725 case OMP_REDUCTION_PLUS:
1726 OMP_CLAUSE_REDUCTION_CODE (node) = PLUS_EXPR;
1727 break;
1728 case OMP_REDUCTION_MINUS:
1729 OMP_CLAUSE_REDUCTION_CODE (node) = MINUS_EXPR;
1730 break;
1731 case OMP_REDUCTION_TIMES:
1732 OMP_CLAUSE_REDUCTION_CODE (node) = MULT_EXPR;
1733 break;
1734 case OMP_REDUCTION_AND:
1735 OMP_CLAUSE_REDUCTION_CODE (node) = TRUTH_ANDIF_EXPR;
1736 break;
1737 case OMP_REDUCTION_OR:
1738 OMP_CLAUSE_REDUCTION_CODE (node) = TRUTH_ORIF_EXPR;
1739 break;
1740 case OMP_REDUCTION_EQV:
1741 OMP_CLAUSE_REDUCTION_CODE (node) = EQ_EXPR;
1742 break;
1743 case OMP_REDUCTION_NEQV:
1744 OMP_CLAUSE_REDUCTION_CODE (node) = NE_EXPR;
1745 break;
1746 case OMP_REDUCTION_MAX:
1747 OMP_CLAUSE_REDUCTION_CODE (node) = MAX_EXPR;
1748 break;
1749 case OMP_REDUCTION_MIN:
1750 OMP_CLAUSE_REDUCTION_CODE (node) = MIN_EXPR;
1751 break;
1752 case OMP_REDUCTION_IAND:
1753 OMP_CLAUSE_REDUCTION_CODE (node) = BIT_AND_EXPR;
1754 break;
1755 case OMP_REDUCTION_IOR:
1756 OMP_CLAUSE_REDUCTION_CODE (node) = BIT_IOR_EXPR;
1757 break;
1758 case OMP_REDUCTION_IEOR:
1759 OMP_CLAUSE_REDUCTION_CODE (node) = BIT_XOR_EXPR;
1760 break;
1761 case OMP_REDUCTION_USER:
1762 OMP_CLAUSE_REDUCTION_CODE (node) = ERROR_MARK;
1763 break;
1764 default:
1765 gcc_unreachable ();
1766 }
1767 if (namelist->sym->attr.dimension
1768 || namelist->u.reduction_op == OMP_REDUCTION_USER
1769 || namelist->sym->attr.allocatable)
1770 gfc_trans_omp_array_reduction_or_udr (node, namelist, where);
1771 list = gfc_trans_add_clause (node, list);
1772 }
1773 }
1774 return list;
1775 }
1776
1777 static inline tree
1778 gfc_convert_expr_to_tree (stmtblock_t *block, gfc_expr *expr)
1779 {
1780 gfc_se se;
1781 tree result;
1782
1783 gfc_init_se (&se, NULL );
1784 gfc_conv_expr (&se, expr);
1785 gfc_add_block_to_block (block, &se.pre);
1786 result = gfc_evaluate_now (se.expr, block);
1787 gfc_add_block_to_block (block, &se.post);
1788
1789 return result;
1790 }
1791
1792 static vec<tree, va_heap, vl_embed> *doacross_steps;
1793
1794 static tree
1795 gfc_trans_omp_clauses (stmtblock_t *block, gfc_omp_clauses *clauses,
1796 locus where, bool declare_simd = false)
1797 {
1798 tree omp_clauses = NULL_TREE, chunk_size, c;
1799 int list, ifc;
1800 enum omp_clause_code clause_code;
1801 gfc_se se;
1802
1803 if (clauses == NULL)
1804 return NULL_TREE;
1805
1806 for (list = 0; list < OMP_LIST_NUM; list++)
1807 {
1808 gfc_omp_namelist *n = clauses->lists[list];
1809
1810 if (n == NULL)
1811 continue;
1812 switch (list)
1813 {
1814 case OMP_LIST_REDUCTION:
1815 /* An OpenACC async clause indicates the need to set reduction
1816 arguments addressable, to allow asynchronous copy-out. */
1817 omp_clauses = gfc_trans_omp_reduction_list (n, omp_clauses, where,
1818 clauses->async);
1819 break;
1820 case OMP_LIST_PRIVATE:
1821 clause_code = OMP_CLAUSE_PRIVATE;
1822 goto add_clause;
1823 case OMP_LIST_SHARED:
1824 clause_code = OMP_CLAUSE_SHARED;
1825 goto add_clause;
1826 case OMP_LIST_FIRSTPRIVATE:
1827 clause_code = OMP_CLAUSE_FIRSTPRIVATE;
1828 goto add_clause;
1829 case OMP_LIST_LASTPRIVATE:
1830 clause_code = OMP_CLAUSE_LASTPRIVATE;
1831 goto add_clause;
1832 case OMP_LIST_COPYIN:
1833 clause_code = OMP_CLAUSE_COPYIN;
1834 goto add_clause;
1835 case OMP_LIST_COPYPRIVATE:
1836 clause_code = OMP_CLAUSE_COPYPRIVATE;
1837 goto add_clause;
1838 case OMP_LIST_UNIFORM:
1839 clause_code = OMP_CLAUSE_UNIFORM;
1840 goto add_clause;
1841 case OMP_LIST_USE_DEVICE:
1842 case OMP_LIST_USE_DEVICE_PTR:
1843 clause_code = OMP_CLAUSE_USE_DEVICE_PTR;
1844 goto add_clause;
1845 case OMP_LIST_IS_DEVICE_PTR:
1846 clause_code = OMP_CLAUSE_IS_DEVICE_PTR;
1847 goto add_clause;
1848
1849 add_clause:
1850 omp_clauses
1851 = gfc_trans_omp_variable_list (clause_code, n, omp_clauses,
1852 declare_simd);
1853 break;
1854 case OMP_LIST_ALIGNED:
1855 for (; n != NULL; n = n->next)
1856 if (n->sym->attr.referenced || declare_simd)
1857 {
1858 tree t = gfc_trans_omp_variable (n->sym, declare_simd);
1859 if (t != error_mark_node)
1860 {
1861 tree node = build_omp_clause (input_location,
1862 OMP_CLAUSE_ALIGNED);
1863 OMP_CLAUSE_DECL (node) = t;
1864 if (n->expr)
1865 {
1866 tree alignment_var;
1867
1868 if (declare_simd)
1869 alignment_var = gfc_conv_constant_to_tree (n->expr);
1870 else
1871 {
1872 gfc_init_se (&se, NULL);
1873 gfc_conv_expr (&se, n->expr);
1874 gfc_add_block_to_block (block, &se.pre);
1875 alignment_var = gfc_evaluate_now (se.expr, block);
1876 gfc_add_block_to_block (block, &se.post);
1877 }
1878 OMP_CLAUSE_ALIGNED_ALIGNMENT (node) = alignment_var;
1879 }
1880 omp_clauses = gfc_trans_add_clause (node, omp_clauses);
1881 }
1882 }
1883 break;
1884 case OMP_LIST_LINEAR:
1885 {
1886 gfc_expr *last_step_expr = NULL;
1887 tree last_step = NULL_TREE;
1888 bool last_step_parm = false;
1889
1890 for (; n != NULL; n = n->next)
1891 {
1892 if (n->expr)
1893 {
1894 last_step_expr = n->expr;
1895 last_step = NULL_TREE;
1896 last_step_parm = false;
1897 }
1898 if (n->sym->attr.referenced || declare_simd)
1899 {
1900 tree t = gfc_trans_omp_variable (n->sym, declare_simd);
1901 if (t != error_mark_node)
1902 {
1903 tree node = build_omp_clause (input_location,
1904 OMP_CLAUSE_LINEAR);
1905 OMP_CLAUSE_DECL (node) = t;
1906 omp_clause_linear_kind kind;
1907 switch (n->u.linear_op)
1908 {
1909 case OMP_LINEAR_DEFAULT:
1910 kind = OMP_CLAUSE_LINEAR_DEFAULT;
1911 break;
1912 case OMP_LINEAR_REF:
1913 kind = OMP_CLAUSE_LINEAR_REF;
1914 break;
1915 case OMP_LINEAR_VAL:
1916 kind = OMP_CLAUSE_LINEAR_VAL;
1917 break;
1918 case OMP_LINEAR_UVAL:
1919 kind = OMP_CLAUSE_LINEAR_UVAL;
1920 break;
1921 default:
1922 gcc_unreachable ();
1923 }
1924 OMP_CLAUSE_LINEAR_KIND (node) = kind;
1925 if (last_step_expr && last_step == NULL_TREE)
1926 {
1927 if (!declare_simd)
1928 {
1929 gfc_init_se (&se, NULL);
1930 gfc_conv_expr (&se, last_step_expr);
1931 gfc_add_block_to_block (block, &se.pre);
1932 last_step = gfc_evaluate_now (se.expr, block);
1933 gfc_add_block_to_block (block, &se.post);
1934 }
1935 else if (last_step_expr->expr_type == EXPR_VARIABLE)
1936 {
1937 gfc_symbol *s = last_step_expr->symtree->n.sym;
1938 last_step = gfc_trans_omp_variable (s, true);
1939 last_step_parm = true;
1940 }
1941 else
1942 last_step
1943 = gfc_conv_constant_to_tree (last_step_expr);
1944 }
1945 if (last_step_parm)
1946 {
1947 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (node) = 1;
1948 OMP_CLAUSE_LINEAR_STEP (node) = last_step;
1949 }
1950 else
1951 {
1952 if (kind == OMP_CLAUSE_LINEAR_REF)
1953 {
1954 tree type;
1955 if (n->sym->attr.flavor == FL_PROCEDURE)
1956 {
1957 type = gfc_get_function_type (n->sym);
1958 type = build_pointer_type (type);
1959 }
1960 else
1961 type = gfc_sym_type (n->sym);
1962 if (POINTER_TYPE_P (type))
1963 type = TREE_TYPE (type);
1964 /* Otherwise to be determined what exactly
1965 should be done. */
1966 tree t = fold_convert (sizetype, last_step);
1967 t = size_binop (MULT_EXPR, t,
1968 TYPE_SIZE_UNIT (type));
1969 OMP_CLAUSE_LINEAR_STEP (node) = t;
1970 }
1971 else
1972 {
1973 tree type
1974 = gfc_typenode_for_spec (&n->sym->ts);
1975 OMP_CLAUSE_LINEAR_STEP (node)
1976 = fold_convert (type, last_step);
1977 }
1978 }
1979 if (n->sym->attr.dimension || n->sym->attr.allocatable)
1980 OMP_CLAUSE_LINEAR_ARRAY (node) = 1;
1981 omp_clauses = gfc_trans_add_clause (node, omp_clauses);
1982 }
1983 }
1984 }
1985 }
1986 break;
1987 case OMP_LIST_DEPEND:
1988 for (; n != NULL; n = n->next)
1989 {
1990 if (n->u.depend_op == OMP_DEPEND_SINK_FIRST)
1991 {
1992 tree vec = NULL_TREE;
1993 unsigned int i;
1994 for (i = 0; ; i++)
1995 {
1996 tree addend = integer_zero_node, t;
1997 bool neg = false;
1998 if (n->expr)
1999 {
2000 addend = gfc_conv_constant_to_tree (n->expr);
2001 if (TREE_CODE (addend) == INTEGER_CST
2002 && tree_int_cst_sgn (addend) == -1)
2003 {
2004 neg = true;
2005 addend = const_unop (NEGATE_EXPR,
2006 TREE_TYPE (addend), addend);
2007 }
2008 }
2009 t = gfc_trans_omp_variable (n->sym, false);
2010 if (t != error_mark_node)
2011 {
2012 if (i < vec_safe_length (doacross_steps)
2013 && !integer_zerop (addend)
2014 && (*doacross_steps)[i])
2015 {
2016 tree step = (*doacross_steps)[i];
2017 addend = fold_convert (TREE_TYPE (step), addend);
2018 addend = build2 (TRUNC_DIV_EXPR,
2019 TREE_TYPE (step), addend, step);
2020 }
2021 vec = tree_cons (addend, t, vec);
2022 if (neg)
2023 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (vec) = 1;
2024 }
2025 if (n->next == NULL
2026 || n->next->u.depend_op != OMP_DEPEND_SINK)
2027 break;
2028 n = n->next;
2029 }
2030 if (vec == NULL_TREE)
2031 continue;
2032
2033 tree node = build_omp_clause (input_location,
2034 OMP_CLAUSE_DEPEND);
2035 OMP_CLAUSE_DEPEND_KIND (node) = OMP_CLAUSE_DEPEND_SINK;
2036 OMP_CLAUSE_DECL (node) = nreverse (vec);
2037 omp_clauses = gfc_trans_add_clause (node, omp_clauses);
2038 continue;
2039 }
2040
2041 if (!n->sym->attr.referenced)
2042 continue;
2043
2044 tree node = build_omp_clause (input_location, OMP_CLAUSE_DEPEND);
2045 if (n->expr == NULL || n->expr->ref->u.ar.type == AR_FULL)
2046 {
2047 tree decl = gfc_get_symbol_decl (n->sym);
2048 if (gfc_omp_privatize_by_reference (decl))
2049 decl = build_fold_indirect_ref (decl);
2050 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl)))
2051 {
2052 decl = gfc_conv_descriptor_data_get (decl);
2053 decl = fold_convert (build_pointer_type (char_type_node),
2054 decl);
2055 decl = build_fold_indirect_ref (decl);
2056 }
2057 else if (DECL_P (decl))
2058 TREE_ADDRESSABLE (decl) = 1;
2059 OMP_CLAUSE_DECL (node) = decl;
2060 }
2061 else
2062 {
2063 tree ptr;
2064 gfc_init_se (&se, NULL);
2065 if (n->expr->ref->u.ar.type == AR_ELEMENT)
2066 {
2067 gfc_conv_expr_reference (&se, n->expr);
2068 ptr = se.expr;
2069 }
2070 else
2071 {
2072 gfc_conv_expr_descriptor (&se, n->expr);
2073 ptr = gfc_conv_array_data (se.expr);
2074 }
2075 gfc_add_block_to_block (block, &se.pre);
2076 gfc_add_block_to_block (block, &se.post);
2077 ptr = fold_convert (build_pointer_type (char_type_node),
2078 ptr);
2079 OMP_CLAUSE_DECL (node) = build_fold_indirect_ref (ptr);
2080 }
2081 switch (n->u.depend_op)
2082 {
2083 case OMP_DEPEND_IN:
2084 OMP_CLAUSE_DEPEND_KIND (node) = OMP_CLAUSE_DEPEND_IN;
2085 break;
2086 case OMP_DEPEND_OUT:
2087 OMP_CLAUSE_DEPEND_KIND (node) = OMP_CLAUSE_DEPEND_OUT;
2088 break;
2089 case OMP_DEPEND_INOUT:
2090 OMP_CLAUSE_DEPEND_KIND (node) = OMP_CLAUSE_DEPEND_INOUT;
2091 break;
2092 default:
2093 gcc_unreachable ();
2094 }
2095 omp_clauses = gfc_trans_add_clause (node, omp_clauses);
2096 }
2097 break;
2098 case OMP_LIST_MAP:
2099 for (; n != NULL; n = n->next)
2100 {
2101 if (!n->sym->attr.referenced)
2102 continue;
2103
2104 tree node = build_omp_clause (input_location, OMP_CLAUSE_MAP);
2105 tree node2 = NULL_TREE;
2106 tree node3 = NULL_TREE;
2107 tree node4 = NULL_TREE;
2108 tree decl = gfc_get_symbol_decl (n->sym);
2109 if (DECL_P (decl))
2110 TREE_ADDRESSABLE (decl) = 1;
2111 if (n->expr == NULL || n->expr->ref->u.ar.type == AR_FULL)
2112 {
2113 if (POINTER_TYPE_P (TREE_TYPE (decl))
2114 && (gfc_omp_privatize_by_reference (decl)
2115 || GFC_DECL_GET_SCALAR_POINTER (decl)
2116 || GFC_DECL_GET_SCALAR_ALLOCATABLE (decl)
2117 || GFC_DECL_CRAY_POINTEE (decl)
2118 || GFC_DESCRIPTOR_TYPE_P
2119 (TREE_TYPE (TREE_TYPE (decl)))))
2120 {
2121 tree orig_decl = decl;
2122 node4 = build_omp_clause (input_location,
2123 OMP_CLAUSE_MAP);
2124 OMP_CLAUSE_SET_MAP_KIND (node4, GOMP_MAP_POINTER);
2125 OMP_CLAUSE_DECL (node4) = decl;
2126 OMP_CLAUSE_SIZE (node4) = size_int (0);
2127 decl = build_fold_indirect_ref (decl);
2128 if (TREE_CODE (TREE_TYPE (orig_decl)) == REFERENCE_TYPE
2129 && (GFC_DECL_GET_SCALAR_POINTER (orig_decl)
2130 || GFC_DECL_GET_SCALAR_ALLOCATABLE (orig_decl)))
2131 {
2132 node3 = build_omp_clause (input_location,
2133 OMP_CLAUSE_MAP);
2134 OMP_CLAUSE_SET_MAP_KIND (node3, GOMP_MAP_POINTER);
2135 OMP_CLAUSE_DECL (node3) = decl;
2136 OMP_CLAUSE_SIZE (node3) = size_int (0);
2137 decl = build_fold_indirect_ref (decl);
2138 }
2139 }
2140 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl)))
2141 {
2142 tree type = TREE_TYPE (decl);
2143 tree ptr = gfc_conv_descriptor_data_get (decl);
2144 ptr = fold_convert (build_pointer_type (char_type_node),
2145 ptr);
2146 ptr = build_fold_indirect_ref (ptr);
2147 OMP_CLAUSE_DECL (node) = ptr;
2148 node2 = build_omp_clause (input_location,
2149 OMP_CLAUSE_MAP);
2150 OMP_CLAUSE_SET_MAP_KIND (node2, GOMP_MAP_TO_PSET);
2151 OMP_CLAUSE_DECL (node2) = decl;
2152 OMP_CLAUSE_SIZE (node2) = TYPE_SIZE_UNIT (type);
2153 node3 = build_omp_clause (input_location,
2154 OMP_CLAUSE_MAP);
2155 OMP_CLAUSE_SET_MAP_KIND (node3, GOMP_MAP_POINTER);
2156 OMP_CLAUSE_DECL (node3)
2157 = gfc_conv_descriptor_data_get (decl);
2158 OMP_CLAUSE_SIZE (node3) = size_int (0);
2159
2160 /* We have to check for n->sym->attr.dimension because
2161 of scalar coarrays. */
2162 if (n->sym->attr.pointer && n->sym->attr.dimension)
2163 {
2164 stmtblock_t cond_block;
2165 tree size
2166 = gfc_create_var (gfc_array_index_type, NULL);
2167 tree tem, then_b, else_b, zero, cond;
2168
2169 gfc_init_block (&cond_block);
2170 tem
2171 = gfc_full_array_size (&cond_block, decl,
2172 GFC_TYPE_ARRAY_RANK (type));
2173 gfc_add_modify (&cond_block, size, tem);
2174 then_b = gfc_finish_block (&cond_block);
2175 gfc_init_block (&cond_block);
2176 zero = build_int_cst (gfc_array_index_type, 0);
2177 gfc_add_modify (&cond_block, size, zero);
2178 else_b = gfc_finish_block (&cond_block);
2179 tem = gfc_conv_descriptor_data_get (decl);
2180 tem = fold_convert (pvoid_type_node, tem);
2181 cond = fold_build2_loc (input_location, NE_EXPR,
2182 logical_type_node,
2183 tem, null_pointer_node);
2184 gfc_add_expr_to_block (block,
2185 build3_loc (input_location,
2186 COND_EXPR,
2187 void_type_node,
2188 cond, then_b,
2189 else_b));
2190 OMP_CLAUSE_SIZE (node) = size;
2191 }
2192 else if (n->sym->attr.dimension)
2193 OMP_CLAUSE_SIZE (node)
2194 = gfc_full_array_size (block, decl,
2195 GFC_TYPE_ARRAY_RANK (type));
2196 if (n->sym->attr.dimension)
2197 {
2198 tree elemsz
2199 = TYPE_SIZE_UNIT (gfc_get_element_type (type));
2200 elemsz = fold_convert (gfc_array_index_type, elemsz);
2201 OMP_CLAUSE_SIZE (node)
2202 = fold_build2 (MULT_EXPR, gfc_array_index_type,
2203 OMP_CLAUSE_SIZE (node), elemsz);
2204 }
2205 }
2206 else
2207 OMP_CLAUSE_DECL (node) = decl;
2208 }
2209 else
2210 {
2211 tree ptr, ptr2;
2212 gfc_init_se (&se, NULL);
2213 if (n->expr->ref->u.ar.type == AR_ELEMENT)
2214 {
2215 gfc_conv_expr_reference (&se, n->expr);
2216 gfc_add_block_to_block (block, &se.pre);
2217 ptr = se.expr;
2218 OMP_CLAUSE_SIZE (node)
2219 = TYPE_SIZE_UNIT (TREE_TYPE (ptr));
2220 }
2221 else
2222 {
2223 gfc_conv_expr_descriptor (&se, n->expr);
2224 ptr = gfc_conv_array_data (se.expr);
2225 tree type = TREE_TYPE (se.expr);
2226 gfc_add_block_to_block (block, &se.pre);
2227 OMP_CLAUSE_SIZE (node)
2228 = gfc_full_array_size (block, se.expr,
2229 GFC_TYPE_ARRAY_RANK (type));
2230 tree elemsz
2231 = TYPE_SIZE_UNIT (gfc_get_element_type (type));
2232 elemsz = fold_convert (gfc_array_index_type, elemsz);
2233 OMP_CLAUSE_SIZE (node)
2234 = fold_build2 (MULT_EXPR, gfc_array_index_type,
2235 OMP_CLAUSE_SIZE (node), elemsz);
2236 }
2237 gfc_add_block_to_block (block, &se.post);
2238 ptr = fold_convert (build_pointer_type (char_type_node),
2239 ptr);
2240 OMP_CLAUSE_DECL (node) = build_fold_indirect_ref (ptr);
2241
2242 if (POINTER_TYPE_P (TREE_TYPE (decl))
2243 && GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (TREE_TYPE (decl))))
2244 {
2245 node4 = build_omp_clause (input_location,
2246 OMP_CLAUSE_MAP);
2247 OMP_CLAUSE_SET_MAP_KIND (node4, GOMP_MAP_POINTER);
2248 OMP_CLAUSE_DECL (node4) = decl;
2249 OMP_CLAUSE_SIZE (node4) = size_int (0);
2250 decl = build_fold_indirect_ref (decl);
2251 }
2252 ptr = fold_convert (sizetype, ptr);
2253 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl)))
2254 {
2255 tree type = TREE_TYPE (decl);
2256 ptr2 = gfc_conv_descriptor_data_get (decl);
2257 node2 = build_omp_clause (input_location,
2258 OMP_CLAUSE_MAP);
2259 OMP_CLAUSE_SET_MAP_KIND (node2, GOMP_MAP_TO_PSET);
2260 OMP_CLAUSE_DECL (node2) = decl;
2261 OMP_CLAUSE_SIZE (node2) = TYPE_SIZE_UNIT (type);
2262 node3 = build_omp_clause (input_location,
2263 OMP_CLAUSE_MAP);
2264 OMP_CLAUSE_SET_MAP_KIND (node3, GOMP_MAP_POINTER);
2265 OMP_CLAUSE_DECL (node3)
2266 = gfc_conv_descriptor_data_get (decl);
2267 }
2268 else
2269 {
2270 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
2271 ptr2 = build_fold_addr_expr (decl);
2272 else
2273 {
2274 gcc_assert (POINTER_TYPE_P (TREE_TYPE (decl)));
2275 ptr2 = decl;
2276 }
2277 node3 = build_omp_clause (input_location,
2278 OMP_CLAUSE_MAP);
2279 OMP_CLAUSE_SET_MAP_KIND (node3, GOMP_MAP_POINTER);
2280 OMP_CLAUSE_DECL (node3) = decl;
2281 }
2282 ptr2 = fold_convert (sizetype, ptr2);
2283 OMP_CLAUSE_SIZE (node3)
2284 = fold_build2 (MINUS_EXPR, sizetype, ptr, ptr2);
2285 }
2286 switch (n->u.map_op)
2287 {
2288 case OMP_MAP_ALLOC:
2289 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_ALLOC);
2290 break;
2291 case OMP_MAP_TO:
2292 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_TO);
2293 break;
2294 case OMP_MAP_FROM:
2295 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_FROM);
2296 break;
2297 case OMP_MAP_TOFROM:
2298 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_TOFROM);
2299 break;
2300 case OMP_MAP_ALWAYS_TO:
2301 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_ALWAYS_TO);
2302 break;
2303 case OMP_MAP_ALWAYS_FROM:
2304 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_ALWAYS_FROM);
2305 break;
2306 case OMP_MAP_ALWAYS_TOFROM:
2307 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_ALWAYS_TOFROM);
2308 break;
2309 case OMP_MAP_RELEASE:
2310 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_RELEASE);
2311 break;
2312 case OMP_MAP_DELETE:
2313 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_DELETE);
2314 break;
2315 case OMP_MAP_FORCE_ALLOC:
2316 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_FORCE_ALLOC);
2317 break;
2318 case OMP_MAP_FORCE_TO:
2319 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_FORCE_TO);
2320 break;
2321 case OMP_MAP_FORCE_FROM:
2322 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_FORCE_FROM);
2323 break;
2324 case OMP_MAP_FORCE_TOFROM:
2325 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_FORCE_TOFROM);
2326 break;
2327 case OMP_MAP_FORCE_PRESENT:
2328 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_FORCE_PRESENT);
2329 break;
2330 case OMP_MAP_FORCE_DEVICEPTR:
2331 OMP_CLAUSE_SET_MAP_KIND (node, GOMP_MAP_FORCE_DEVICEPTR);
2332 break;
2333 default:
2334 gcc_unreachable ();
2335 }
2336 omp_clauses = gfc_trans_add_clause (node, omp_clauses);
2337 if (node2)
2338 omp_clauses = gfc_trans_add_clause (node2, omp_clauses);
2339 if (node3)
2340 omp_clauses = gfc_trans_add_clause (node3, omp_clauses);
2341 if (node4)
2342 omp_clauses = gfc_trans_add_clause (node4, omp_clauses);
2343 }
2344 break;
2345 case OMP_LIST_TO:
2346 case OMP_LIST_FROM:
2347 case OMP_LIST_CACHE:
2348 for (; n != NULL; n = n->next)
2349 {
2350 if (!n->sym->attr.referenced)
2351 continue;
2352
2353 switch (list)
2354 {
2355 case OMP_LIST_TO:
2356 clause_code = OMP_CLAUSE_TO;
2357 break;
2358 case OMP_LIST_FROM:
2359 clause_code = OMP_CLAUSE_FROM;
2360 break;
2361 case OMP_LIST_CACHE:
2362 clause_code = OMP_CLAUSE__CACHE_;
2363 break;
2364 default:
2365 gcc_unreachable ();
2366 }
2367 tree node = build_omp_clause (input_location, clause_code);
2368 if (n->expr == NULL || n->expr->ref->u.ar.type == AR_FULL)
2369 {
2370 tree decl = gfc_get_symbol_decl (n->sym);
2371 if (gfc_omp_privatize_by_reference (decl))
2372 decl = build_fold_indirect_ref (decl);
2373 else if (DECL_P (decl))
2374 TREE_ADDRESSABLE (decl) = 1;
2375 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl)))
2376 {
2377 tree type = TREE_TYPE (decl);
2378 tree ptr = gfc_conv_descriptor_data_get (decl);
2379 ptr = fold_convert (build_pointer_type (char_type_node),
2380 ptr);
2381 ptr = build_fold_indirect_ref (ptr);
2382 OMP_CLAUSE_DECL (node) = ptr;
2383 OMP_CLAUSE_SIZE (node)
2384 = gfc_full_array_size (block, decl,
2385 GFC_TYPE_ARRAY_RANK (type));
2386 tree elemsz
2387 = TYPE_SIZE_UNIT (gfc_get_element_type (type));
2388 elemsz = fold_convert (gfc_array_index_type, elemsz);
2389 OMP_CLAUSE_SIZE (node)
2390 = fold_build2 (MULT_EXPR, gfc_array_index_type,
2391 OMP_CLAUSE_SIZE (node), elemsz);
2392 }
2393 else
2394 OMP_CLAUSE_DECL (node) = decl;
2395 }
2396 else
2397 {
2398 tree ptr;
2399 gfc_init_se (&se, NULL);
2400 if (n->expr->ref->u.ar.type == AR_ELEMENT)
2401 {
2402 gfc_conv_expr_reference (&se, n->expr);
2403 ptr = se.expr;
2404 gfc_add_block_to_block (block, &se.pre);
2405 OMP_CLAUSE_SIZE (node)
2406 = TYPE_SIZE_UNIT (TREE_TYPE (ptr));
2407 }
2408 else
2409 {
2410 gfc_conv_expr_descriptor (&se, n->expr);
2411 ptr = gfc_conv_array_data (se.expr);
2412 tree type = TREE_TYPE (se.expr);
2413 gfc_add_block_to_block (block, &se.pre);
2414 OMP_CLAUSE_SIZE (node)
2415 = gfc_full_array_size (block, se.expr,
2416 GFC_TYPE_ARRAY_RANK (type));
2417 tree elemsz
2418 = TYPE_SIZE_UNIT (gfc_get_element_type (type));
2419 elemsz = fold_convert (gfc_array_index_type, elemsz);
2420 OMP_CLAUSE_SIZE (node)
2421 = fold_build2 (MULT_EXPR, gfc_array_index_type,
2422 OMP_CLAUSE_SIZE (node), elemsz);
2423 }
2424 gfc_add_block_to_block (block, &se.post);
2425 ptr = fold_convert (build_pointer_type (char_type_node),
2426 ptr);
2427 OMP_CLAUSE_DECL (node) = build_fold_indirect_ref (ptr);
2428 }
2429 omp_clauses = gfc_trans_add_clause (node, omp_clauses);
2430 }
2431 break;
2432 default:
2433 break;
2434 }
2435 }
2436
2437 if (clauses->if_expr)
2438 {
2439 tree if_var;
2440
2441 gfc_init_se (&se, NULL);
2442 gfc_conv_expr (&se, clauses->if_expr);
2443 gfc_add_block_to_block (block, &se.pre);
2444 if_var = gfc_evaluate_now (se.expr, block);
2445 gfc_add_block_to_block (block, &se.post);
2446
2447 c = build_omp_clause (where.lb->location, OMP_CLAUSE_IF);
2448 OMP_CLAUSE_IF_MODIFIER (c) = ERROR_MARK;
2449 OMP_CLAUSE_IF_EXPR (c) = if_var;
2450 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2451 }
2452 for (ifc = 0; ifc < OMP_IF_LAST; ifc++)
2453 if (clauses->if_exprs[ifc])
2454 {
2455 tree if_var;
2456
2457 gfc_init_se (&se, NULL);
2458 gfc_conv_expr (&se, clauses->if_exprs[ifc]);
2459 gfc_add_block_to_block (block, &se.pre);
2460 if_var = gfc_evaluate_now (se.expr, block);
2461 gfc_add_block_to_block (block, &se.post);
2462
2463 c = build_omp_clause (where.lb->location, OMP_CLAUSE_IF);
2464 switch (ifc)
2465 {
2466 case OMP_IF_PARALLEL:
2467 OMP_CLAUSE_IF_MODIFIER (c) = OMP_PARALLEL;
2468 break;
2469 case OMP_IF_TASK:
2470 OMP_CLAUSE_IF_MODIFIER (c) = OMP_TASK;
2471 break;
2472 case OMP_IF_TASKLOOP:
2473 OMP_CLAUSE_IF_MODIFIER (c) = OMP_TASKLOOP;
2474 break;
2475 case OMP_IF_TARGET:
2476 OMP_CLAUSE_IF_MODIFIER (c) = OMP_TARGET;
2477 break;
2478 case OMP_IF_TARGET_DATA:
2479 OMP_CLAUSE_IF_MODIFIER (c) = OMP_TARGET_DATA;
2480 break;
2481 case OMP_IF_TARGET_UPDATE:
2482 OMP_CLAUSE_IF_MODIFIER (c) = OMP_TARGET_UPDATE;
2483 break;
2484 case OMP_IF_TARGET_ENTER_DATA:
2485 OMP_CLAUSE_IF_MODIFIER (c) = OMP_TARGET_ENTER_DATA;
2486 break;
2487 case OMP_IF_TARGET_EXIT_DATA:
2488 OMP_CLAUSE_IF_MODIFIER (c) = OMP_TARGET_EXIT_DATA;
2489 break;
2490 default:
2491 gcc_unreachable ();
2492 }
2493 OMP_CLAUSE_IF_EXPR (c) = if_var;
2494 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2495 }
2496
2497 if (clauses->final_expr)
2498 {
2499 tree final_var;
2500
2501 gfc_init_se (&se, NULL);
2502 gfc_conv_expr (&se, clauses->final_expr);
2503 gfc_add_block_to_block (block, &se.pre);
2504 final_var = gfc_evaluate_now (se.expr, block);
2505 gfc_add_block_to_block (block, &se.post);
2506
2507 c = build_omp_clause (where.lb->location, OMP_CLAUSE_FINAL);
2508 OMP_CLAUSE_FINAL_EXPR (c) = final_var;
2509 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2510 }
2511
2512 if (clauses->num_threads)
2513 {
2514 tree num_threads;
2515
2516 gfc_init_se (&se, NULL);
2517 gfc_conv_expr (&se, clauses->num_threads);
2518 gfc_add_block_to_block (block, &se.pre);
2519 num_threads = gfc_evaluate_now (se.expr, block);
2520 gfc_add_block_to_block (block, &se.post);
2521
2522 c = build_omp_clause (where.lb->location, OMP_CLAUSE_NUM_THREADS);
2523 OMP_CLAUSE_NUM_THREADS_EXPR (c) = num_threads;
2524 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2525 }
2526
2527 chunk_size = NULL_TREE;
2528 if (clauses->chunk_size)
2529 {
2530 gfc_init_se (&se, NULL);
2531 gfc_conv_expr (&se, clauses->chunk_size);
2532 gfc_add_block_to_block (block, &se.pre);
2533 chunk_size = gfc_evaluate_now (se.expr, block);
2534 gfc_add_block_to_block (block, &se.post);
2535 }
2536
2537 if (clauses->sched_kind != OMP_SCHED_NONE)
2538 {
2539 c = build_omp_clause (where.lb->location, OMP_CLAUSE_SCHEDULE);
2540 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = chunk_size;
2541 switch (clauses->sched_kind)
2542 {
2543 case OMP_SCHED_STATIC:
2544 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_STATIC;
2545 break;
2546 case OMP_SCHED_DYNAMIC:
2547 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
2548 break;
2549 case OMP_SCHED_GUIDED:
2550 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_GUIDED;
2551 break;
2552 case OMP_SCHED_RUNTIME:
2553 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_RUNTIME;
2554 break;
2555 case OMP_SCHED_AUTO:
2556 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_AUTO;
2557 break;
2558 default:
2559 gcc_unreachable ();
2560 }
2561 if (clauses->sched_monotonic)
2562 OMP_CLAUSE_SCHEDULE_KIND (c)
2563 = (omp_clause_schedule_kind) (OMP_CLAUSE_SCHEDULE_KIND (c)
2564 | OMP_CLAUSE_SCHEDULE_MONOTONIC);
2565 else if (clauses->sched_nonmonotonic)
2566 OMP_CLAUSE_SCHEDULE_KIND (c)
2567 = (omp_clause_schedule_kind) (OMP_CLAUSE_SCHEDULE_KIND (c)
2568 | OMP_CLAUSE_SCHEDULE_NONMONOTONIC);
2569 if (clauses->sched_simd)
2570 OMP_CLAUSE_SCHEDULE_SIMD (c) = 1;
2571 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2572 }
2573
2574 if (clauses->default_sharing != OMP_DEFAULT_UNKNOWN)
2575 {
2576 c = build_omp_clause (where.lb->location, OMP_CLAUSE_DEFAULT);
2577 switch (clauses->default_sharing)
2578 {
2579 case OMP_DEFAULT_NONE:
2580 OMP_CLAUSE_DEFAULT_KIND (c) = OMP_CLAUSE_DEFAULT_NONE;
2581 break;
2582 case OMP_DEFAULT_SHARED:
2583 OMP_CLAUSE_DEFAULT_KIND (c) = OMP_CLAUSE_DEFAULT_SHARED;
2584 break;
2585 case OMP_DEFAULT_PRIVATE:
2586 OMP_CLAUSE_DEFAULT_KIND (c) = OMP_CLAUSE_DEFAULT_PRIVATE;
2587 break;
2588 case OMP_DEFAULT_FIRSTPRIVATE:
2589 OMP_CLAUSE_DEFAULT_KIND (c) = OMP_CLAUSE_DEFAULT_FIRSTPRIVATE;
2590 break;
2591 case OMP_DEFAULT_PRESENT:
2592 OMP_CLAUSE_DEFAULT_KIND (c) = OMP_CLAUSE_DEFAULT_PRESENT;
2593 break;
2594 default:
2595 gcc_unreachable ();
2596 }
2597 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2598 }
2599
2600 if (clauses->nowait)
2601 {
2602 c = build_omp_clause (where.lb->location, OMP_CLAUSE_NOWAIT);
2603 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2604 }
2605
2606 if (clauses->ordered)
2607 {
2608 c = build_omp_clause (where.lb->location, OMP_CLAUSE_ORDERED);
2609 OMP_CLAUSE_ORDERED_EXPR (c)
2610 = clauses->orderedc ? build_int_cst (integer_type_node,
2611 clauses->orderedc) : NULL_TREE;
2612 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2613 }
2614
2615 if (clauses->untied)
2616 {
2617 c = build_omp_clause (where.lb->location, OMP_CLAUSE_UNTIED);
2618 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2619 }
2620
2621 if (clauses->mergeable)
2622 {
2623 c = build_omp_clause (where.lb->location, OMP_CLAUSE_MERGEABLE);
2624 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2625 }
2626
2627 if (clauses->collapse)
2628 {
2629 c = build_omp_clause (where.lb->location, OMP_CLAUSE_COLLAPSE);
2630 OMP_CLAUSE_COLLAPSE_EXPR (c)
2631 = build_int_cst (integer_type_node, clauses->collapse);
2632 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2633 }
2634
2635 if (clauses->inbranch)
2636 {
2637 c = build_omp_clause (where.lb->location, OMP_CLAUSE_INBRANCH);
2638 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2639 }
2640
2641 if (clauses->notinbranch)
2642 {
2643 c = build_omp_clause (where.lb->location, OMP_CLAUSE_NOTINBRANCH);
2644 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2645 }
2646
2647 switch (clauses->cancel)
2648 {
2649 case OMP_CANCEL_UNKNOWN:
2650 break;
2651 case OMP_CANCEL_PARALLEL:
2652 c = build_omp_clause (where.lb->location, OMP_CLAUSE_PARALLEL);
2653 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2654 break;
2655 case OMP_CANCEL_SECTIONS:
2656 c = build_omp_clause (where.lb->location, OMP_CLAUSE_SECTIONS);
2657 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2658 break;
2659 case OMP_CANCEL_DO:
2660 c = build_omp_clause (where.lb->location, OMP_CLAUSE_FOR);
2661 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2662 break;
2663 case OMP_CANCEL_TASKGROUP:
2664 c = build_omp_clause (where.lb->location, OMP_CLAUSE_TASKGROUP);
2665 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2666 break;
2667 }
2668
2669 if (clauses->proc_bind != OMP_PROC_BIND_UNKNOWN)
2670 {
2671 c = build_omp_clause (where.lb->location, OMP_CLAUSE_PROC_BIND);
2672 switch (clauses->proc_bind)
2673 {
2674 case OMP_PROC_BIND_MASTER:
2675 OMP_CLAUSE_PROC_BIND_KIND (c) = OMP_CLAUSE_PROC_BIND_MASTER;
2676 break;
2677 case OMP_PROC_BIND_SPREAD:
2678 OMP_CLAUSE_PROC_BIND_KIND (c) = OMP_CLAUSE_PROC_BIND_SPREAD;
2679 break;
2680 case OMP_PROC_BIND_CLOSE:
2681 OMP_CLAUSE_PROC_BIND_KIND (c) = OMP_CLAUSE_PROC_BIND_CLOSE;
2682 break;
2683 default:
2684 gcc_unreachable ();
2685 }
2686 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2687 }
2688
2689 if (clauses->safelen_expr)
2690 {
2691 tree safelen_var;
2692
2693 gfc_init_se (&se, NULL);
2694 gfc_conv_expr (&se, clauses->safelen_expr);
2695 gfc_add_block_to_block (block, &se.pre);
2696 safelen_var = gfc_evaluate_now (se.expr, block);
2697 gfc_add_block_to_block (block, &se.post);
2698
2699 c = build_omp_clause (where.lb->location, OMP_CLAUSE_SAFELEN);
2700 OMP_CLAUSE_SAFELEN_EXPR (c) = safelen_var;
2701 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2702 }
2703
2704 if (clauses->simdlen_expr)
2705 {
2706 if (declare_simd)
2707 {
2708 c = build_omp_clause (where.lb->location, OMP_CLAUSE_SIMDLEN);
2709 OMP_CLAUSE_SIMDLEN_EXPR (c)
2710 = gfc_conv_constant_to_tree (clauses->simdlen_expr);
2711 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2712 }
2713 else
2714 {
2715 tree simdlen_var;
2716
2717 gfc_init_se (&se, NULL);
2718 gfc_conv_expr (&se, clauses->simdlen_expr);
2719 gfc_add_block_to_block (block, &se.pre);
2720 simdlen_var = gfc_evaluate_now (se.expr, block);
2721 gfc_add_block_to_block (block, &se.post);
2722
2723 c = build_omp_clause (where.lb->location, OMP_CLAUSE_SIMDLEN);
2724 OMP_CLAUSE_SIMDLEN_EXPR (c) = simdlen_var;
2725 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2726 }
2727 }
2728
2729 if (clauses->num_teams)
2730 {
2731 tree num_teams;
2732
2733 gfc_init_se (&se, NULL);
2734 gfc_conv_expr (&se, clauses->num_teams);
2735 gfc_add_block_to_block (block, &se.pre);
2736 num_teams = gfc_evaluate_now (se.expr, block);
2737 gfc_add_block_to_block (block, &se.post);
2738
2739 c = build_omp_clause (where.lb->location, OMP_CLAUSE_NUM_TEAMS);
2740 OMP_CLAUSE_NUM_TEAMS_EXPR (c) = num_teams;
2741 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2742 }
2743
2744 if (clauses->device)
2745 {
2746 tree device;
2747
2748 gfc_init_se (&se, NULL);
2749 gfc_conv_expr (&se, clauses->device);
2750 gfc_add_block_to_block (block, &se.pre);
2751 device = gfc_evaluate_now (se.expr, block);
2752 gfc_add_block_to_block (block, &se.post);
2753
2754 c = build_omp_clause (where.lb->location, OMP_CLAUSE_DEVICE);
2755 OMP_CLAUSE_DEVICE_ID (c) = device;
2756 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2757 }
2758
2759 if (clauses->thread_limit)
2760 {
2761 tree thread_limit;
2762
2763 gfc_init_se (&se, NULL);
2764 gfc_conv_expr (&se, clauses->thread_limit);
2765 gfc_add_block_to_block (block, &se.pre);
2766 thread_limit = gfc_evaluate_now (se.expr, block);
2767 gfc_add_block_to_block (block, &se.post);
2768
2769 c = build_omp_clause (where.lb->location, OMP_CLAUSE_THREAD_LIMIT);
2770 OMP_CLAUSE_THREAD_LIMIT_EXPR (c) = thread_limit;
2771 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2772 }
2773
2774 chunk_size = NULL_TREE;
2775 if (clauses->dist_chunk_size)
2776 {
2777 gfc_init_se (&se, NULL);
2778 gfc_conv_expr (&se, clauses->dist_chunk_size);
2779 gfc_add_block_to_block (block, &se.pre);
2780 chunk_size = gfc_evaluate_now (se.expr, block);
2781 gfc_add_block_to_block (block, &se.post);
2782 }
2783
2784 if (clauses->dist_sched_kind != OMP_SCHED_NONE)
2785 {
2786 c = build_omp_clause (where.lb->location, OMP_CLAUSE_DIST_SCHEDULE);
2787 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c) = chunk_size;
2788 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2789 }
2790
2791 if (clauses->grainsize)
2792 {
2793 tree grainsize;
2794
2795 gfc_init_se (&se, NULL);
2796 gfc_conv_expr (&se, clauses->grainsize);
2797 gfc_add_block_to_block (block, &se.pre);
2798 grainsize = gfc_evaluate_now (se.expr, block);
2799 gfc_add_block_to_block (block, &se.post);
2800
2801 c = build_omp_clause (where.lb->location, OMP_CLAUSE_GRAINSIZE);
2802 OMP_CLAUSE_GRAINSIZE_EXPR (c) = grainsize;
2803 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2804 }
2805
2806 if (clauses->num_tasks)
2807 {
2808 tree num_tasks;
2809
2810 gfc_init_se (&se, NULL);
2811 gfc_conv_expr (&se, clauses->num_tasks);
2812 gfc_add_block_to_block (block, &se.pre);
2813 num_tasks = gfc_evaluate_now (se.expr, block);
2814 gfc_add_block_to_block (block, &se.post);
2815
2816 c = build_omp_clause (where.lb->location, OMP_CLAUSE_NUM_TASKS);
2817 OMP_CLAUSE_NUM_TASKS_EXPR (c) = num_tasks;
2818 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2819 }
2820
2821 if (clauses->priority)
2822 {
2823 tree priority;
2824
2825 gfc_init_se (&se, NULL);
2826 gfc_conv_expr (&se, clauses->priority);
2827 gfc_add_block_to_block (block, &se.pre);
2828 priority = gfc_evaluate_now (se.expr, block);
2829 gfc_add_block_to_block (block, &se.post);
2830
2831 c = build_omp_clause (where.lb->location, OMP_CLAUSE_PRIORITY);
2832 OMP_CLAUSE_PRIORITY_EXPR (c) = priority;
2833 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2834 }
2835
2836 if (clauses->hint)
2837 {
2838 tree hint;
2839
2840 gfc_init_se (&se, NULL);
2841 gfc_conv_expr (&se, clauses->hint);
2842 gfc_add_block_to_block (block, &se.pre);
2843 hint = gfc_evaluate_now (se.expr, block);
2844 gfc_add_block_to_block (block, &se.post);
2845
2846 c = build_omp_clause (where.lb->location, OMP_CLAUSE_HINT);
2847 OMP_CLAUSE_HINT_EXPR (c) = hint;
2848 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2849 }
2850
2851 if (clauses->simd)
2852 {
2853 c = build_omp_clause (where.lb->location, OMP_CLAUSE_SIMD);
2854 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2855 }
2856 if (clauses->threads)
2857 {
2858 c = build_omp_clause (where.lb->location, OMP_CLAUSE_THREADS);
2859 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2860 }
2861 if (clauses->nogroup)
2862 {
2863 c = build_omp_clause (where.lb->location, OMP_CLAUSE_NOGROUP);
2864 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2865 }
2866 if (clauses->defaultmap)
2867 {
2868 c = build_omp_clause (where.lb->location, OMP_CLAUSE_DEFAULTMAP);
2869 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2870 }
2871 if (clauses->depend_source)
2872 {
2873 c = build_omp_clause (where.lb->location, OMP_CLAUSE_DEPEND);
2874 OMP_CLAUSE_DEPEND_KIND (c) = OMP_CLAUSE_DEPEND_SOURCE;
2875 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2876 }
2877
2878 if (clauses->async)
2879 {
2880 c = build_omp_clause (where.lb->location, OMP_CLAUSE_ASYNC);
2881 if (clauses->async_expr)
2882 OMP_CLAUSE_ASYNC_EXPR (c)
2883 = gfc_convert_expr_to_tree (block, clauses->async_expr);
2884 else
2885 OMP_CLAUSE_ASYNC_EXPR (c) = NULL;
2886 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2887 }
2888 if (clauses->seq)
2889 {
2890 c = build_omp_clause (where.lb->location, OMP_CLAUSE_SEQ);
2891 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2892 }
2893 if (clauses->par_auto)
2894 {
2895 c = build_omp_clause (where.lb->location, OMP_CLAUSE_AUTO);
2896 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2897 }
2898 if (clauses->independent)
2899 {
2900 c = build_omp_clause (where.lb->location, OMP_CLAUSE_INDEPENDENT);
2901 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2902 }
2903 if (clauses->wait_list)
2904 {
2905 gfc_expr_list *el;
2906
2907 for (el = clauses->wait_list; el; el = el->next)
2908 {
2909 c = build_omp_clause (where.lb->location, OMP_CLAUSE_WAIT);
2910 OMP_CLAUSE_DECL (c) = gfc_convert_expr_to_tree (block, el->expr);
2911 OMP_CLAUSE_CHAIN (c) = omp_clauses;
2912 omp_clauses = c;
2913 }
2914 }
2915 if (clauses->num_gangs_expr)
2916 {
2917 tree num_gangs_var
2918 = gfc_convert_expr_to_tree (block, clauses->num_gangs_expr);
2919 c = build_omp_clause (where.lb->location, OMP_CLAUSE_NUM_GANGS);
2920 OMP_CLAUSE_NUM_GANGS_EXPR (c) = num_gangs_var;
2921 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2922 }
2923 if (clauses->num_workers_expr)
2924 {
2925 tree num_workers_var
2926 = gfc_convert_expr_to_tree (block, clauses->num_workers_expr);
2927 c = build_omp_clause (where.lb->location, OMP_CLAUSE_NUM_WORKERS);
2928 OMP_CLAUSE_NUM_WORKERS_EXPR (c) = num_workers_var;
2929 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2930 }
2931 if (clauses->vector_length_expr)
2932 {
2933 tree vector_length_var
2934 = gfc_convert_expr_to_tree (block, clauses->vector_length_expr);
2935 c = build_omp_clause (where.lb->location, OMP_CLAUSE_VECTOR_LENGTH);
2936 OMP_CLAUSE_VECTOR_LENGTH_EXPR (c) = vector_length_var;
2937 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2938 }
2939 if (clauses->tile_list)
2940 {
2941 vec<tree, va_gc> *tvec;
2942 gfc_expr_list *el;
2943
2944 vec_alloc (tvec, 4);
2945
2946 for (el = clauses->tile_list; el; el = el->next)
2947 vec_safe_push (tvec, gfc_convert_expr_to_tree (block, el->expr));
2948
2949 c = build_omp_clause (where.lb->location, OMP_CLAUSE_TILE);
2950 OMP_CLAUSE_TILE_LIST (c) = build_tree_list_vec (tvec);
2951 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2952 tvec->truncate (0);
2953 }
2954 if (clauses->vector)
2955 {
2956 if (clauses->vector_expr)
2957 {
2958 tree vector_var
2959 = gfc_convert_expr_to_tree (block, clauses->vector_expr);
2960 c = build_omp_clause (where.lb->location, OMP_CLAUSE_VECTOR);
2961 OMP_CLAUSE_VECTOR_EXPR (c) = vector_var;
2962 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2963 }
2964 else
2965 {
2966 c = build_omp_clause (where.lb->location, OMP_CLAUSE_VECTOR);
2967 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2968 }
2969 }
2970 if (clauses->worker)
2971 {
2972 if (clauses->worker_expr)
2973 {
2974 tree worker_var
2975 = gfc_convert_expr_to_tree (block, clauses->worker_expr);
2976 c = build_omp_clause (where.lb->location, OMP_CLAUSE_WORKER);
2977 OMP_CLAUSE_WORKER_EXPR (c) = worker_var;
2978 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2979 }
2980 else
2981 {
2982 c = build_omp_clause (where.lb->location, OMP_CLAUSE_WORKER);
2983 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2984 }
2985 }
2986 if (clauses->gang)
2987 {
2988 tree arg;
2989 c = build_omp_clause (where.lb->location, OMP_CLAUSE_GANG);
2990 omp_clauses = gfc_trans_add_clause (c, omp_clauses);
2991 if (clauses->gang_num_expr)
2992 {
2993 arg = gfc_convert_expr_to_tree (block, clauses->gang_num_expr);
2994 OMP_CLAUSE_GANG_EXPR (c) = arg;
2995 }
2996 if (clauses->gang_static)
2997 {
2998 arg = clauses->gang_static_expr
2999 ? gfc_convert_expr_to_tree (block, clauses->gang_static_expr)
3000 : integer_minus_one_node;
3001 OMP_CLAUSE_GANG_STATIC_EXPR (c) = arg;
3002 }
3003 }
3004
3005 return nreverse (omp_clauses);
3006 }
3007
3008 /* Like gfc_trans_code, but force creation of a BIND_EXPR around it. */
3009
3010 static tree
3011 gfc_trans_omp_code (gfc_code *code, bool force_empty)
3012 {
3013 tree stmt;
3014
3015 pushlevel ();
3016 stmt = gfc_trans_code (code);
3017 if (TREE_CODE (stmt) != BIND_EXPR)
3018 {
3019 if (!IS_EMPTY_STMT (stmt) || force_empty)
3020 {
3021 tree block = poplevel (1, 0);
3022 stmt = build3_v (BIND_EXPR, NULL, stmt, block);
3023 }
3024 else
3025 poplevel (0, 0);
3026 }
3027 else
3028 poplevel (0, 0);
3029 return stmt;
3030 }
3031
3032 /* Trans OpenACC directives. */
3033 /* parallel, kernels, data and host_data. */
3034 static tree
3035 gfc_trans_oacc_construct (gfc_code *code)
3036 {
3037 stmtblock_t block;
3038 tree stmt, oacc_clauses;
3039 enum tree_code construct_code;
3040
3041 switch (code->op)
3042 {
3043 case EXEC_OACC_PARALLEL:
3044 construct_code = OACC_PARALLEL;
3045 break;
3046 case EXEC_OACC_KERNELS:
3047 construct_code = OACC_KERNELS;
3048 break;
3049 case EXEC_OACC_DATA:
3050 construct_code = OACC_DATA;
3051 break;
3052 case EXEC_OACC_HOST_DATA:
3053 construct_code = OACC_HOST_DATA;
3054 break;
3055 default:
3056 gcc_unreachable ();
3057 }
3058
3059 gfc_start_block (&block);
3060 oacc_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
3061 code->loc);
3062 stmt = gfc_trans_omp_code (code->block->next, true);
3063 stmt = build2_loc (input_location, construct_code, void_type_node, stmt,
3064 oacc_clauses);
3065 gfc_add_expr_to_block (&block, stmt);
3066 return gfc_finish_block (&block);
3067 }
3068
3069 /* update, enter_data, exit_data, cache. */
3070 static tree
3071 gfc_trans_oacc_executable_directive (gfc_code *code)
3072 {
3073 stmtblock_t block;
3074 tree stmt, oacc_clauses;
3075 enum tree_code construct_code;
3076
3077 switch (code->op)
3078 {
3079 case EXEC_OACC_UPDATE:
3080 construct_code = OACC_UPDATE;
3081 break;
3082 case EXEC_OACC_ENTER_DATA:
3083 construct_code = OACC_ENTER_DATA;
3084 break;
3085 case EXEC_OACC_EXIT_DATA:
3086 construct_code = OACC_EXIT_DATA;
3087 break;
3088 case EXEC_OACC_CACHE:
3089 construct_code = OACC_CACHE;
3090 break;
3091 default:
3092 gcc_unreachable ();
3093 }
3094
3095 gfc_start_block (&block);
3096 oacc_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
3097 code->loc);
3098 stmt = build1_loc (input_location, construct_code, void_type_node,
3099 oacc_clauses);
3100 gfc_add_expr_to_block (&block, stmt);
3101 return gfc_finish_block (&block);
3102 }
3103
3104 static tree
3105 gfc_trans_oacc_wait_directive (gfc_code *code)
3106 {
3107 stmtblock_t block;
3108 tree stmt, t;
3109 vec<tree, va_gc> *args;
3110 int nparms = 0;
3111 gfc_expr_list *el;
3112 gfc_omp_clauses *clauses = code->ext.omp_clauses;
3113 location_t loc = input_location;
3114
3115 for (el = clauses->wait_list; el; el = el->next)
3116 nparms++;
3117
3118 vec_alloc (args, nparms + 2);
3119 stmt = builtin_decl_explicit (BUILT_IN_GOACC_WAIT);
3120
3121 gfc_start_block (&block);
3122
3123 if (clauses->async_expr)
3124 t = gfc_convert_expr_to_tree (&block, clauses->async_expr);
3125 else
3126 t = build_int_cst (integer_type_node, -2);
3127
3128 args->quick_push (t);
3129 args->quick_push (build_int_cst (integer_type_node, nparms));
3130
3131 for (el = clauses->wait_list; el; el = el->next)
3132 args->quick_push (gfc_convert_expr_to_tree (&block, el->expr));
3133
3134 stmt = build_call_expr_loc_vec (loc, stmt, args);
3135 gfc_add_expr_to_block (&block, stmt);
3136
3137 vec_free (args);
3138
3139 return gfc_finish_block (&block);
3140 }
3141
3142 static tree gfc_trans_omp_sections (gfc_code *, gfc_omp_clauses *);
3143 static tree gfc_trans_omp_workshare (gfc_code *, gfc_omp_clauses *);
3144
3145 static tree
3146 gfc_trans_omp_atomic (gfc_code *code)
3147 {
3148 gfc_code *atomic_code = code;
3149 gfc_se lse;
3150 gfc_se rse;
3151 gfc_se vse;
3152 gfc_expr *expr2, *e;
3153 gfc_symbol *var;
3154 stmtblock_t block;
3155 tree lhsaddr, type, rhs, x;
3156 enum tree_code op = ERROR_MARK;
3157 enum tree_code aop = OMP_ATOMIC;
3158 bool var_on_left = false;
3159 bool seq_cst = (atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_SEQ_CST) != 0;
3160
3161 code = code->block->next;
3162 gcc_assert (code->op == EXEC_ASSIGN);
3163 var = code->expr1->symtree->n.sym;
3164
3165 gfc_init_se (&lse, NULL);
3166 gfc_init_se (&rse, NULL);
3167 gfc_init_se (&vse, NULL);
3168 gfc_start_block (&block);
3169
3170 expr2 = code->expr2;
3171 if (((atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_MASK)
3172 != GFC_OMP_ATOMIC_WRITE)
3173 && (atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_SWAP) == 0
3174 && expr2->expr_type == EXPR_FUNCTION
3175 && expr2->value.function.isym
3176 && expr2->value.function.isym->id == GFC_ISYM_CONVERSION)
3177 expr2 = expr2->value.function.actual->expr;
3178
3179 switch (atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_MASK)
3180 {
3181 case GFC_OMP_ATOMIC_READ:
3182 gfc_conv_expr (&vse, code->expr1);
3183 gfc_add_block_to_block (&block, &vse.pre);
3184
3185 gfc_conv_expr (&lse, expr2);
3186 gfc_add_block_to_block (&block, &lse.pre);
3187 type = TREE_TYPE (lse.expr);
3188 lhsaddr = gfc_build_addr_expr (NULL, lse.expr);
3189
3190 x = build1 (OMP_ATOMIC_READ, type, lhsaddr);
3191 OMP_ATOMIC_SEQ_CST (x) = seq_cst;
3192 x = convert (TREE_TYPE (vse.expr), x);
3193 gfc_add_modify (&block, vse.expr, x);
3194
3195 gfc_add_block_to_block (&block, &lse.pre);
3196 gfc_add_block_to_block (&block, &rse.pre);
3197
3198 return gfc_finish_block (&block);
3199 case GFC_OMP_ATOMIC_CAPTURE:
3200 aop = OMP_ATOMIC_CAPTURE_NEW;
3201 if (expr2->expr_type == EXPR_VARIABLE)
3202 {
3203 aop = OMP_ATOMIC_CAPTURE_OLD;
3204 gfc_conv_expr (&vse, code->expr1);
3205 gfc_add_block_to_block (&block, &vse.pre);
3206
3207 gfc_conv_expr (&lse, expr2);
3208 gfc_add_block_to_block (&block, &lse.pre);
3209 gfc_init_se (&lse, NULL);
3210 code = code->next;
3211 var = code->expr1->symtree->n.sym;
3212 expr2 = code->expr2;
3213 if (expr2->expr_type == EXPR_FUNCTION
3214 && expr2->value.function.isym
3215 && expr2->value.function.isym->id == GFC_ISYM_CONVERSION)
3216 expr2 = expr2->value.function.actual->expr;
3217 }
3218 break;
3219 default:
3220 break;
3221 }
3222
3223 gfc_conv_expr (&lse, code->expr1);
3224 gfc_add_block_to_block (&block, &lse.pre);
3225 type = TREE_TYPE (lse.expr);
3226 lhsaddr = gfc_build_addr_expr (NULL, lse.expr);
3227
3228 if (((atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_MASK)
3229 == GFC_OMP_ATOMIC_WRITE)
3230 || (atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_SWAP))
3231 {
3232 gfc_conv_expr (&rse, expr2);
3233 gfc_add_block_to_block (&block, &rse.pre);
3234 }
3235 else if (expr2->expr_type == EXPR_OP)
3236 {
3237 gfc_expr *e;
3238 switch (expr2->value.op.op)
3239 {
3240 case INTRINSIC_PLUS:
3241 op = PLUS_EXPR;
3242 break;
3243 case INTRINSIC_TIMES:
3244 op = MULT_EXPR;
3245 break;
3246 case INTRINSIC_MINUS:
3247 op = MINUS_EXPR;
3248 break;
3249 case INTRINSIC_DIVIDE:
3250 if (expr2->ts.type == BT_INTEGER)
3251 op = TRUNC_DIV_EXPR;
3252 else
3253 op = RDIV_EXPR;
3254 break;
3255 case INTRINSIC_AND:
3256 op = TRUTH_ANDIF_EXPR;
3257 break;
3258 case INTRINSIC_OR:
3259 op = TRUTH_ORIF_EXPR;
3260 break;
3261 case INTRINSIC_EQV:
3262 op = EQ_EXPR;
3263 break;
3264 case INTRINSIC_NEQV:
3265 op = NE_EXPR;
3266 break;
3267 default:
3268 gcc_unreachable ();
3269 }
3270 e = expr2->value.op.op1;
3271 if (e->expr_type == EXPR_FUNCTION
3272 && e->value.function.isym
3273 && e->value.function.isym->id == GFC_ISYM_CONVERSION)
3274 e = e->value.function.actual->expr;
3275 if (e->expr_type == EXPR_VARIABLE
3276 && e->symtree != NULL
3277 && e->symtree->n.sym == var)
3278 {
3279 expr2 = expr2->value.op.op2;
3280 var_on_left = true;
3281 }
3282 else
3283 {
3284 e = expr2->value.op.op2;
3285 if (e->expr_type == EXPR_FUNCTION
3286 && e->value.function.isym
3287 && e->value.function.isym->id == GFC_ISYM_CONVERSION)
3288 e = e->value.function.actual->expr;
3289 gcc_assert (e->expr_type == EXPR_VARIABLE
3290 && e->symtree != NULL
3291 && e->symtree->n.sym == var);
3292 expr2 = expr2->value.op.op1;
3293 var_on_left = false;
3294 }
3295 gfc_conv_expr (&rse, expr2);
3296 gfc_add_block_to_block (&block, &rse.pre);
3297 }
3298 else
3299 {
3300 gcc_assert (expr2->expr_type == EXPR_FUNCTION);
3301 switch (expr2->value.function.isym->id)
3302 {
3303 case GFC_ISYM_MIN:
3304 op = MIN_EXPR;
3305 break;
3306 case GFC_ISYM_MAX:
3307 op = MAX_EXPR;
3308 break;
3309 case GFC_ISYM_IAND:
3310 op = BIT_AND_EXPR;
3311 break;
3312 case GFC_ISYM_IOR:
3313 op = BIT_IOR_EXPR;
3314 break;
3315 case GFC_ISYM_IEOR:
3316 op = BIT_XOR_EXPR;
3317 break;
3318 default:
3319 gcc_unreachable ();
3320 }
3321 e = expr2->value.function.actual->expr;
3322 gcc_assert (e->expr_type == EXPR_VARIABLE
3323 && e->symtree != NULL
3324 && e->symtree->n.sym == var);
3325
3326 gfc_conv_expr (&rse, expr2->value.function.actual->next->expr);
3327 gfc_add_block_to_block (&block, &rse.pre);
3328 if (expr2->value.function.actual->next->next != NULL)
3329 {
3330 tree accum = gfc_create_var (TREE_TYPE (rse.expr), NULL);
3331 gfc_actual_arglist *arg;
3332
3333 gfc_add_modify (&block, accum, rse.expr);
3334 for (arg = expr2->value.function.actual->next->next; arg;
3335 arg = arg->next)
3336 {
3337 gfc_init_block (&rse.pre);
3338 gfc_conv_expr (&rse, arg->expr);
3339 gfc_add_block_to_block (&block, &rse.pre);
3340 x = fold_build2_loc (input_location, op, TREE_TYPE (accum),
3341 accum, rse.expr);
3342 gfc_add_modify (&block, accum, x);
3343 }
3344
3345 rse.expr = accum;
3346 }
3347
3348 expr2 = expr2->value.function.actual->next->expr;
3349 }
3350
3351 lhsaddr = save_expr (lhsaddr);
3352 if (TREE_CODE (lhsaddr) != SAVE_EXPR
3353 && (TREE_CODE (lhsaddr) != ADDR_EXPR
3354 || !VAR_P (TREE_OPERAND (lhsaddr, 0))))
3355 {
3356 /* Make sure LHS is simple enough so that goa_lhs_expr_p can recognize
3357 it even after unsharing function body. */
3358 tree var = create_tmp_var_raw (TREE_TYPE (lhsaddr));
3359 DECL_CONTEXT (var) = current_function_decl;
3360 lhsaddr = build4 (TARGET_EXPR, TREE_TYPE (lhsaddr), var, lhsaddr,
3361 NULL_TREE, NULL_TREE);
3362 }
3363
3364 rhs = gfc_evaluate_now (rse.expr, &block);
3365
3366 if (((atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_MASK)
3367 == GFC_OMP_ATOMIC_WRITE)
3368 || (atomic_code->ext.omp_atomic & GFC_OMP_ATOMIC_SWAP))
3369 x = rhs;
3370 else
3371 {
3372 x = convert (TREE_TYPE (rhs),
3373 build_fold_indirect_ref_loc (input_location, lhsaddr));
3374 if (var_on_left)
3375 x = fold_build2_loc (input_location, op, TREE_TYPE (rhs), x, rhs);
3376 else
3377 x = fold_build2_loc (input_location, op, TREE_TYPE (rhs), rhs, x);
3378 }
3379
3380 if (TREE_CODE (TREE_TYPE (rhs)) == COMPLEX_TYPE
3381 && TREE_CODE (type) != COMPLEX_TYPE)
3382 x = fold_build1_loc (input_location, REALPART_EXPR,
3383 TREE_TYPE (TREE_TYPE (rhs)), x);
3384
3385 gfc_add_block_to_block (&block, &lse.pre);
3386 gfc_add_block_to_block (&block, &rse.pre);
3387
3388 if (aop == OMP_ATOMIC)
3389 {
3390 x = build2_v (OMP_ATOMIC, lhsaddr, convert (type, x));
3391 OMP_ATOMIC_SEQ_CST (x) = seq_cst;
3392 gfc_add_expr_to_block (&block, x);
3393 }
3394 else
3395 {
3396 if (aop == OMP_ATOMIC_CAPTURE_NEW)
3397 {
3398 code = code->next;
3399 expr2 = code->expr2;
3400 if (expr2->expr_type == EXPR_FUNCTION
3401 && expr2->value.function.isym
3402 && expr2->value.function.isym->id == GFC_ISYM_CONVERSION)
3403 expr2 = expr2->value.function.actual->expr;
3404
3405 gcc_assert (expr2->expr_type == EXPR_VARIABLE);
3406 gfc_conv_expr (&vse, code->expr1);
3407 gfc_add_block_to_block (&block, &vse.pre);
3408
3409 gfc_init_se (&lse, NULL);
3410 gfc_conv_expr (&lse, expr2);
3411 gfc_add_block_to_block (&block, &lse.pre);
3412 }
3413 x = build2 (aop, type, lhsaddr, convert (type, x));
3414 OMP_ATOMIC_SEQ_CST (x) = seq_cst;
3415 x = convert (TREE_TYPE (vse.expr), x);
3416 gfc_add_modify (&block, vse.expr, x);
3417 }
3418
3419 return gfc_finish_block (&block);
3420 }
3421
3422 static tree
3423 gfc_trans_omp_barrier (void)
3424 {
3425 tree decl = builtin_decl_explicit (BUILT_IN_GOMP_BARRIER);
3426 return build_call_expr_loc (input_location, decl, 0);
3427 }
3428
3429 static tree
3430 gfc_trans_omp_cancel (gfc_code *code)
3431 {
3432 int mask = 0;
3433 tree ifc = boolean_true_node;
3434 stmtblock_t block;
3435 switch (code->ext.omp_clauses->cancel)
3436 {
3437 case OMP_CANCEL_PARALLEL: mask = 1; break;
3438 case OMP_CANCEL_DO: mask = 2; break;
3439 case OMP_CANCEL_SECTIONS: mask = 4; break;
3440 case OMP_CANCEL_TASKGROUP: mask = 8; break;
3441 default: gcc_unreachable ();
3442 }
3443 gfc_start_block (&block);
3444 if (code->ext.omp_clauses->if_expr)
3445 {
3446 gfc_se se;
3447 tree if_var;
3448
3449 gfc_init_se (&se, NULL);
3450 gfc_conv_expr (&se, code->ext.omp_clauses->if_expr);
3451 gfc_add_block_to_block (&block, &se.pre);
3452 if_var = gfc_evaluate_now (se.expr, &block);
3453 gfc_add_block_to_block (&block, &se.post);
3454 tree type = TREE_TYPE (if_var);
3455 ifc = fold_build2_loc (input_location, NE_EXPR,
3456 boolean_type_node, if_var,
3457 build_zero_cst (type));
3458 }
3459 tree decl = builtin_decl_explicit (BUILT_IN_GOMP_CANCEL);
3460 tree c_bool_type = TREE_TYPE (TREE_TYPE (decl));
3461 ifc = fold_convert (c_bool_type, ifc);
3462 gfc_add_expr_to_block (&block,
3463 build_call_expr_loc (input_location, decl, 2,
3464 build_int_cst (integer_type_node,
3465 mask), ifc));
3466 return gfc_finish_block (&block);
3467 }
3468
3469 static tree
3470 gfc_trans_omp_cancellation_point (gfc_code *code)
3471 {
3472 int mask = 0;
3473 switch (code->ext.omp_clauses->cancel)
3474 {
3475 case OMP_CANCEL_PARALLEL: mask = 1; break;
3476 case OMP_CANCEL_DO: mask = 2; break;
3477 case OMP_CANCEL_SECTIONS: mask = 4; break;
3478 case OMP_CANCEL_TASKGROUP: mask = 8; break;
3479 default: gcc_unreachable ();
3480 }
3481 tree decl = builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT);
3482 return build_call_expr_loc (input_location, decl, 1,
3483 build_int_cst (integer_type_node, mask));
3484 }
3485
3486 static tree
3487 gfc_trans_omp_critical (gfc_code *code)
3488 {
3489 tree name = NULL_TREE, stmt;
3490 if (code->ext.omp_clauses != NULL)
3491 name = get_identifier (code->ext.omp_clauses->critical_name);
3492 stmt = gfc_trans_code (code->block->next);
3493 return build3_loc (input_location, OMP_CRITICAL, void_type_node, stmt,
3494 NULL_TREE, name);
3495 }
3496
3497 typedef struct dovar_init_d {
3498 tree var;
3499 tree init;
3500 } dovar_init;
3501
3502
3503 static tree
3504 gfc_trans_omp_do (gfc_code *code, gfc_exec_op op, stmtblock_t *pblock,
3505 gfc_omp_clauses *do_clauses, tree par_clauses)
3506 {
3507 gfc_se se;
3508 tree dovar, stmt, from, to, step, type, init, cond, incr, orig_decls;
3509 tree count = NULL_TREE, cycle_label, tmp, omp_clauses;
3510 stmtblock_t block;
3511 stmtblock_t body;
3512 gfc_omp_clauses *clauses = code->ext.omp_clauses;
3513 int i, collapse = clauses->collapse;
3514 vec<dovar_init> inits = vNULL;
3515 dovar_init *di;
3516 unsigned ix;
3517 vec<tree, va_heap, vl_embed> *saved_doacross_steps = doacross_steps;
3518 gfc_expr_list *tile = do_clauses ? do_clauses->tile_list : clauses->tile_list;
3519
3520 /* Both collapsed and tiled loops are lowered the same way. In
3521 OpenACC, those clauses are not compatible, so prioritize the tile
3522 clause, if present. */
3523 if (tile)
3524 {
3525 collapse = 0;
3526 for (gfc_expr_list *el = tile; el; el = el->next)
3527 collapse++;
3528 }
3529
3530 doacross_steps = NULL;
3531 if (clauses->orderedc)
3532 collapse = clauses->orderedc;
3533 if (collapse <= 0)
3534 collapse = 1;
3535
3536 code = code->block->next;
3537 gcc_assert (code->op == EXEC_DO);
3538
3539 init = make_tree_vec (collapse);
3540 cond = make_tree_vec (collapse);
3541 incr = make_tree_vec (collapse);
3542 orig_decls = clauses->orderedc ? make_tree_vec (collapse) : NULL_TREE;
3543
3544 if (pblock == NULL)
3545 {
3546 gfc_start_block (&block);
3547 pblock = &block;
3548 }
3549
3550 /* simd schedule modifier is only useful for composite do simd and other
3551 constructs including that, where gfc_trans_omp_do is only called
3552 on the simd construct and DO's clauses are translated elsewhere. */
3553 do_clauses->sched_simd = false;
3554
3555 omp_clauses = gfc_trans_omp_clauses (pblock, do_clauses, code->loc);
3556
3557 for (i = 0; i < collapse; i++)
3558 {
3559 int simple = 0;
3560 int dovar_found = 0;
3561 tree dovar_decl;
3562
3563 if (clauses)
3564 {
3565 gfc_omp_namelist *n = NULL;
3566 if (op != EXEC_OMP_DISTRIBUTE)
3567 for (n = clauses->lists[(op == EXEC_OMP_SIMD && collapse == 1)
3568 ? OMP_LIST_LINEAR : OMP_LIST_LASTPRIVATE];
3569 n != NULL; n = n->next)
3570 if (code->ext.iterator->var->symtree->n.sym == n->sym)
3571 break;
3572 if (n != NULL)
3573 dovar_found = 1;
3574 else if (n == NULL && op != EXEC_OMP_SIMD)
3575 for (n = clauses->lists[OMP_LIST_PRIVATE]; n != NULL; n = n->next)
3576 if (code->ext.iterator->var->symtree->n.sym == n->sym)
3577 break;
3578 if (n != NULL)
3579 dovar_found++;
3580 }
3581
3582 /* Evaluate all the expressions in the iterator. */
3583 gfc_init_se (&se, NULL);
3584 gfc_conv_expr_lhs (&se, code->ext.iterator->var);
3585 gfc_add_block_to_block (pblock, &se.pre);
3586 dovar = se.expr;
3587 type = TREE_TYPE (dovar);
3588 gcc_assert (TREE_CODE (type) == INTEGER_TYPE);
3589
3590 gfc_init_se (&se, NULL);
3591 gfc_conv_expr_val (&se, code->ext.iterator->start);
3592 gfc_add_block_to_block (pblock, &se.pre);
3593 from = gfc_evaluate_now (se.expr, pblock);
3594
3595 gfc_init_se (&se, NULL);
3596 gfc_conv_expr_val (&se, code->ext.iterator->end);
3597 gfc_add_block_to_block (pblock, &se.pre);
3598 to = gfc_evaluate_now (se.expr, pblock);
3599
3600 gfc_init_se (&se, NULL);
3601 gfc_conv_expr_val (&se, code->ext.iterator->step);
3602 gfc_add_block_to_block (pblock, &se.pre);
3603 step = gfc_evaluate_now (se.expr, pblock);
3604 dovar_decl = dovar;
3605
3606 /* Special case simple loops. */
3607 if (VAR_P (dovar))
3608 {
3609 if (integer_onep (step))
3610 simple = 1;
3611 else if (tree_int_cst_equal (step, integer_minus_one_node))
3612 simple = -1;
3613 }
3614 else
3615 dovar_decl
3616 = gfc_trans_omp_variable (code->ext.iterator->var->symtree->n.sym,
3617 false);
3618
3619 /* Loop body. */
3620 if (simple)
3621 {
3622 TREE_VEC_ELT (init, i) = build2_v (MODIFY_EXPR, dovar, from);
3623 /* The condition should not be folded. */
3624 TREE_VEC_ELT (cond, i) = build2_loc (input_location, simple > 0
3625 ? LE_EXPR : GE_EXPR,
3626 logical_type_node, dovar, to);
3627 TREE_VEC_ELT (incr, i) = fold_build2_loc (input_location, PLUS_EXPR,
3628 type, dovar, step);
3629 TREE_VEC_ELT (incr, i) = fold_build2_loc (input_location,
3630 MODIFY_EXPR,
3631 type, dovar,
3632 TREE_VEC_ELT (incr, i));
3633 }
3634 else
3635 {
3636 /* STEP is not 1 or -1. Use:
3637 for (count = 0; count < (to + step - from) / step; count++)
3638 {
3639 dovar = from + count * step;
3640 body;
3641 cycle_label:;
3642 } */
3643 tmp = fold_build2_loc (input_location, MINUS_EXPR, type, step, from);
3644 tmp = fold_build2_loc (input_location, PLUS_EXPR, type, to, tmp);
3645 tmp = fold_build2_loc (input_location, TRUNC_DIV_EXPR, type, tmp,
3646 step);
3647 tmp = gfc_evaluate_now (tmp, pblock);
3648 count = gfc_create_var (type, "count");
3649 TREE_VEC_ELT (init, i) = build2_v (MODIFY_EXPR, count,
3650 build_int_cst (type, 0));
3651 /* The condition should not be folded. */
3652 TREE_VEC_ELT (cond, i) = build2_loc (input_location, LT_EXPR,
3653 logical_type_node,
3654 count, tmp);
3655 TREE_VEC_ELT (incr, i) = fold_build2_loc (input_location, PLUS_EXPR,
3656 type, count,
3657 build_int_cst (type, 1));
3658 TREE_VEC_ELT (incr, i) = fold_build2_loc (input_location,
3659 MODIFY_EXPR, type, count,
3660 TREE_VEC_ELT (incr, i));
3661
3662 /* Initialize DOVAR. */
3663 tmp = fold_build2_loc (input_location, MULT_EXPR, type, count, step);
3664 tmp = fold_build2_loc (input_location, PLUS_EXPR, type, from, tmp);
3665 dovar_init e = {dovar, tmp};
3666 inits.safe_push (e);
3667 if (clauses->orderedc)
3668 {
3669 if (doacross_steps == NULL)
3670 vec_safe_grow_cleared (doacross_steps, clauses->orderedc);
3671 (*doacross_steps)[i] = step;
3672 }
3673 }
3674 if (orig_decls)
3675 TREE_VEC_ELT (orig_decls, i) = dovar_decl;
3676
3677 if (dovar_found == 2
3678 && op == EXEC_OMP_SIMD
3679 && collapse == 1
3680 && !simple)
3681 {
3682 for (tmp = omp_clauses; tmp; tmp = OMP_CLAUSE_CHAIN (tmp))
3683 if (OMP_CLAUSE_CODE (tmp) == OMP_CLAUSE_LINEAR
3684 && OMP_CLAUSE_DECL (tmp) == dovar)
3685 {
3686 OMP_CLAUSE_LINEAR_NO_COPYIN (tmp) = 1;
3687 break;
3688 }
3689 }
3690 if (!dovar_found)
3691 {
3692 if (op == EXEC_OMP_SIMD)
3693 {
3694 if (collapse == 1)
3695 {
3696 tmp = build_omp_clause (input_location, OMP_CLAUSE_LINEAR);
3697 OMP_CLAUSE_LINEAR_STEP (tmp) = step;
3698 OMP_CLAUSE_LINEAR_NO_COPYIN (tmp) = 1;
3699 }
3700 else
3701 tmp = build_omp_clause (input_location, OMP_CLAUSE_LASTPRIVATE);
3702 if (!simple)
3703 dovar_found = 2;
3704 }
3705 else
3706 tmp = build_omp_clause (input_location, OMP_CLAUSE_PRIVATE);
3707 OMP_CLAUSE_DECL (tmp) = dovar_decl;
3708 omp_clauses = gfc_trans_add_clause (tmp, omp_clauses);
3709 }
3710 if (dovar_found == 2)
3711 {
3712 tree c = NULL;
3713
3714 tmp = NULL;
3715 if (!simple)
3716 {
3717 /* If dovar is lastprivate, but different counter is used,
3718 dovar += step needs to be added to
3719 OMP_CLAUSE_LASTPRIVATE_STMT, otherwise the copied dovar
3720 will have the value on entry of the last loop, rather
3721 than value after iterator increment. */
3722 if (clauses->orderedc)
3723 {
3724 if (clauses->collapse <= 1 || i >= clauses->collapse)
3725 tmp = count;
3726 else
3727 tmp = fold_build2_loc (input_location, PLUS_EXPR,
3728 type, count, build_one_cst (type));
3729 tmp = fold_build2_loc (input_location, MULT_EXPR, type,
3730 tmp, step);
3731 tmp = fold_build2_loc (input_location, PLUS_EXPR, type,
3732 from, tmp);
3733 }
3734 else
3735 {
3736 tmp = gfc_evaluate_now (step, pblock);
3737 tmp = fold_build2_loc (input_location, PLUS_EXPR, type,
3738 dovar, tmp);
3739 }
3740 tmp = fold_build2_loc (input_location, MODIFY_EXPR, type,
3741 dovar, tmp);
3742 for (c = omp_clauses; c ; c = OMP_CLAUSE_CHAIN (c))
3743 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
3744 && OMP_CLAUSE_DECL (c) == dovar_decl)
3745 {
3746 OMP_CLAUSE_LASTPRIVATE_STMT (c) = tmp;
3747 break;
3748 }
3749 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR
3750 && OMP_CLAUSE_DECL (c) == dovar_decl)
3751 {
3752 OMP_CLAUSE_LINEAR_STMT (c) = tmp;
3753 break;
3754 }
3755 }
3756 if (c == NULL && op == EXEC_OMP_DO && par_clauses != NULL)
3757 {
3758 for (c = par_clauses; c ; c = OMP_CLAUSE_CHAIN (c))
3759 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
3760 && OMP_CLAUSE_DECL (c) == dovar_decl)
3761 {
3762 tree l = build_omp_clause (input_location,
3763 OMP_CLAUSE_LASTPRIVATE);
3764 OMP_CLAUSE_DECL (l) = dovar_decl;
3765 OMP_CLAUSE_CHAIN (l) = omp_clauses;
3766 OMP_CLAUSE_LASTPRIVATE_STMT (l) = tmp;
3767 omp_clauses = l;
3768 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_SHARED);
3769 break;
3770 }
3771 }
3772 gcc_assert (simple || c != NULL);
3773 }
3774 if (!simple)
3775 {
3776 if (op != EXEC_OMP_SIMD)
3777 tmp = build_omp_clause (input_location, OMP_CLAUSE_PRIVATE);
3778 else if (collapse == 1)
3779 {
3780 tmp = build_omp_clause (input_location, OMP_CLAUSE_LINEAR);
3781 OMP_CLAUSE_LINEAR_STEP (tmp) = build_int_cst (type, 1);
3782 OMP_CLAUSE_LINEAR_NO_COPYIN (tmp) = 1;
3783 OMP_CLAUSE_LINEAR_NO_COPYOUT (tmp) = 1;
3784 }
3785 else
3786 tmp = build_omp_clause (input_location, OMP_CLAUSE_LASTPRIVATE);
3787 OMP_CLAUSE_DECL (tmp) = count;
3788 omp_clauses = gfc_trans_add_clause (tmp, omp_clauses);
3789 }
3790
3791 if (i + 1 < collapse)
3792 code = code->block->next;
3793 }
3794
3795 if (pblock != &block)
3796 {
3797 pushlevel ();
3798 gfc_start_block (&block);
3799 }
3800
3801 gfc_start_block (&body);
3802
3803 FOR_EACH_VEC_ELT (inits, ix, di)
3804 gfc_add_modify (&body, di->var, di->init);
3805 inits.release ();
3806
3807 /* Cycle statement is implemented with a goto. Exit statement must not be
3808 present for this loop. */
3809 cycle_label = gfc_build_label_decl (NULL_TREE);
3810
3811 /* Put these labels where they can be found later. */
3812
3813 code->cycle_label = cycle_label;
3814 code->exit_label = NULL_TREE;
3815
3816 /* Main loop body. */
3817 tmp = gfc_trans_omp_code (code->block->next, true);
3818 gfc_add_expr_to_block (&body, tmp);
3819
3820 /* Label for cycle statements (if needed). */
3821 if (TREE_USED (cycle_label))
3822 {
3823 tmp = build1_v (LABEL_EXPR, cycle_label);
3824 gfc_add_expr_to_block (&body, tmp);
3825 }
3826
3827 /* End of loop body. */
3828 switch (op)
3829 {
3830 case EXEC_OMP_SIMD: stmt = make_node (OMP_SIMD); break;
3831 case EXEC_OMP_DO: stmt = make_node (OMP_FOR); break;
3832 case EXEC_OMP_DISTRIBUTE: stmt = make_node (OMP_DISTRIBUTE); break;
3833 case EXEC_OMP_TASKLOOP: stmt = make_node (OMP_TASKLOOP); break;
3834 case EXEC_OACC_LOOP: stmt = make_node (OACC_LOOP); break;
3835 default: gcc_unreachable ();
3836 }
3837
3838 TREE_TYPE (stmt) = void_type_node;
3839 OMP_FOR_BODY (stmt) = gfc_finish_block (&body);
3840 OMP_FOR_CLAUSES (stmt) = omp_clauses;
3841 OMP_FOR_INIT (stmt) = init;
3842 OMP_FOR_COND (stmt) = cond;
3843 OMP_FOR_INCR (stmt) = incr;
3844 if (orig_decls)
3845 OMP_FOR_ORIG_DECLS (stmt) = orig_decls;
3846 gfc_add_expr_to_block (&block, stmt);
3847
3848 vec_free (doacross_steps);
3849 doacross_steps = saved_doacross_steps;
3850
3851 return gfc_finish_block (&block);
3852 }
3853
3854 /* parallel loop and kernels loop. */
3855 static tree
3856 gfc_trans_oacc_combined_directive (gfc_code *code)
3857 {
3858 stmtblock_t block, *pblock = NULL;
3859 gfc_omp_clauses construct_clauses, loop_clauses;
3860 tree stmt, oacc_clauses = NULL_TREE;
3861 enum tree_code construct_code;
3862
3863 switch (code->op)
3864 {
3865 case EXEC_OACC_PARALLEL_LOOP:
3866 construct_code = OACC_PARALLEL;
3867 break;
3868 case EXEC_OACC_KERNELS_LOOP:
3869 construct_code = OACC_KERNELS;
3870 break;
3871 default:
3872 gcc_unreachable ();
3873 }
3874
3875 gfc_start_block (&block);
3876
3877 memset (&loop_clauses, 0, sizeof (loop_clauses));
3878 if (code->ext.omp_clauses != NULL)
3879 {
3880 memcpy (&construct_clauses, code->ext.omp_clauses,
3881 sizeof (construct_clauses));
3882 loop_clauses.collapse = construct_clauses.collapse;
3883 loop_clauses.gang = construct_clauses.gang;
3884 loop_clauses.gang_static = construct_clauses.gang_static;
3885 loop_clauses.gang_num_expr = construct_clauses.gang_num_expr;
3886 loop_clauses.gang_static_expr = construct_clauses.gang_static_expr;
3887 loop_clauses.vector = construct_clauses.vector;
3888 loop_clauses.vector_expr = construct_clauses.vector_expr;
3889 loop_clauses.worker = construct_clauses.worker;
3890 loop_clauses.worker_expr = construct_clauses.worker_expr;
3891 loop_clauses.seq = construct_clauses.seq;
3892 loop_clauses.par_auto = construct_clauses.par_auto;
3893 loop_clauses.independent = construct_clauses.independent;
3894 loop_clauses.tile_list = construct_clauses.tile_list;
3895 loop_clauses.lists[OMP_LIST_PRIVATE]
3896 = construct_clauses.lists[OMP_LIST_PRIVATE];
3897 loop_clauses.lists[OMP_LIST_REDUCTION]
3898 = construct_clauses.lists[OMP_LIST_REDUCTION];
3899 construct_clauses.gang = false;
3900 construct_clauses.gang_static = false;
3901 construct_clauses.gang_num_expr = NULL;
3902 construct_clauses.gang_static_expr = NULL;
3903 construct_clauses.vector = false;
3904 construct_clauses.vector_expr = NULL;
3905 construct_clauses.worker = false;
3906 construct_clauses.worker_expr = NULL;
3907 construct_clauses.seq = false;
3908 construct_clauses.par_auto = false;
3909 construct_clauses.independent = false;
3910 construct_clauses.independent = false;
3911 construct_clauses.tile_list = NULL;
3912 construct_clauses.lists[OMP_LIST_PRIVATE] = NULL;
3913 if (construct_code == OACC_KERNELS)
3914 construct_clauses.lists[OMP_LIST_REDUCTION] = NULL;
3915 oacc_clauses = gfc_trans_omp_clauses (&block, &construct_clauses,
3916 code->loc);
3917 }
3918 if (!loop_clauses.seq)
3919 pblock = &block;
3920 else
3921 pushlevel ();
3922 stmt = gfc_trans_omp_do (code, EXEC_OACC_LOOP, pblock, &loop_clauses, NULL);
3923 if (TREE_CODE (stmt) != BIND_EXPR)
3924 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
3925 else
3926 poplevel (0, 0);
3927 stmt = build2_loc (input_location, construct_code, void_type_node, stmt,
3928 oacc_clauses);
3929 gfc_add_expr_to_block (&block, stmt);
3930 return gfc_finish_block (&block);
3931 }
3932
3933 static tree
3934 gfc_trans_omp_flush (void)
3935 {
3936 tree decl = builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE);
3937 return build_call_expr_loc (input_location, decl, 0);
3938 }
3939
3940 static tree
3941 gfc_trans_omp_master (gfc_code *code)
3942 {
3943 tree stmt = gfc_trans_code (code->block->next);
3944 if (IS_EMPTY_STMT (stmt))
3945 return stmt;
3946 return build1_v (OMP_MASTER, stmt);
3947 }
3948
3949 static tree
3950 gfc_trans_omp_ordered (gfc_code *code)
3951 {
3952 if (!flag_openmp)
3953 {
3954 if (!code->ext.omp_clauses->simd)
3955 return gfc_trans_code (code->block ? code->block->next : NULL);
3956 code->ext.omp_clauses->threads = 0;
3957 }
3958 tree omp_clauses = gfc_trans_omp_clauses (NULL, code->ext.omp_clauses,
3959 code->loc);
3960 return build2_loc (input_location, OMP_ORDERED, void_type_node,
3961 code->block ? gfc_trans_code (code->block->next)
3962 : NULL_TREE, omp_clauses);
3963 }
3964
3965 static tree
3966 gfc_trans_omp_parallel (gfc_code *code)
3967 {
3968 stmtblock_t block;
3969 tree stmt, omp_clauses;
3970
3971 gfc_start_block (&block);
3972 omp_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
3973 code->loc);
3974 pushlevel ();
3975 stmt = gfc_trans_omp_code (code->block->next, true);
3976 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
3977 stmt = build2_loc (input_location, OMP_PARALLEL, void_type_node, stmt,
3978 omp_clauses);
3979 gfc_add_expr_to_block (&block, stmt);
3980 return gfc_finish_block (&block);
3981 }
3982
3983 enum
3984 {
3985 GFC_OMP_SPLIT_SIMD,
3986 GFC_OMP_SPLIT_DO,
3987 GFC_OMP_SPLIT_PARALLEL,
3988 GFC_OMP_SPLIT_DISTRIBUTE,
3989 GFC_OMP_SPLIT_TEAMS,
3990 GFC_OMP_SPLIT_TARGET,
3991 GFC_OMP_SPLIT_TASKLOOP,
3992 GFC_OMP_SPLIT_NUM
3993 };
3994
3995 enum
3996 {
3997 GFC_OMP_MASK_SIMD = (1 << GFC_OMP_SPLIT_SIMD),
3998 GFC_OMP_MASK_DO = (1 << GFC_OMP_SPLIT_DO),
3999 GFC_OMP_MASK_PARALLEL = (1 << GFC_OMP_SPLIT_PARALLEL),
4000 GFC_OMP_MASK_DISTRIBUTE = (1 << GFC_OMP_SPLIT_DISTRIBUTE),
4001 GFC_OMP_MASK_TEAMS = (1 << GFC_OMP_SPLIT_TEAMS),
4002 GFC_OMP_MASK_TARGET = (1 << GFC_OMP_SPLIT_TARGET),
4003 GFC_OMP_MASK_TASKLOOP = (1 << GFC_OMP_SPLIT_TASKLOOP)
4004 };
4005
4006 static void
4007 gfc_split_omp_clauses (gfc_code *code,
4008 gfc_omp_clauses clausesa[GFC_OMP_SPLIT_NUM])
4009 {
4010 int mask = 0, innermost = 0;
4011 memset (clausesa, 0, GFC_OMP_SPLIT_NUM * sizeof (gfc_omp_clauses));
4012 switch (code->op)
4013 {
4014 case EXEC_OMP_DISTRIBUTE:
4015 innermost = GFC_OMP_SPLIT_DISTRIBUTE;
4016 break;
4017 case EXEC_OMP_DISTRIBUTE_PARALLEL_DO:
4018 mask = GFC_OMP_MASK_DISTRIBUTE | GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO;
4019 innermost = GFC_OMP_SPLIT_DO;
4020 break;
4021 case EXEC_OMP_DISTRIBUTE_PARALLEL_DO_SIMD:
4022 mask = GFC_OMP_MASK_DISTRIBUTE | GFC_OMP_MASK_PARALLEL
4023 | GFC_OMP_MASK_DO | GFC_OMP_MASK_SIMD;
4024 innermost = GFC_OMP_SPLIT_SIMD;
4025 break;
4026 case EXEC_OMP_DISTRIBUTE_SIMD:
4027 mask = GFC_OMP_MASK_DISTRIBUTE | GFC_OMP_MASK_SIMD;
4028 innermost = GFC_OMP_SPLIT_SIMD;
4029 break;
4030 case EXEC_OMP_DO:
4031 innermost = GFC_OMP_SPLIT_DO;
4032 break;
4033 case EXEC_OMP_DO_SIMD:
4034 mask = GFC_OMP_MASK_DO | GFC_OMP_MASK_SIMD;
4035 innermost = GFC_OMP_SPLIT_SIMD;
4036 break;
4037 case EXEC_OMP_PARALLEL:
4038 innermost = GFC_OMP_SPLIT_PARALLEL;
4039 break;
4040 case EXEC_OMP_PARALLEL_DO:
4041 mask = GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO;
4042 innermost = GFC_OMP_SPLIT_DO;
4043 break;
4044 case EXEC_OMP_PARALLEL_DO_SIMD:
4045 mask = GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO | GFC_OMP_MASK_SIMD;
4046 innermost = GFC_OMP_SPLIT_SIMD;
4047 break;
4048 case EXEC_OMP_SIMD:
4049 innermost = GFC_OMP_SPLIT_SIMD;
4050 break;
4051 case EXEC_OMP_TARGET:
4052 innermost = GFC_OMP_SPLIT_TARGET;
4053 break;
4054 case EXEC_OMP_TARGET_PARALLEL:
4055 mask = GFC_OMP_MASK_TARGET | GFC_OMP_MASK_PARALLEL;
4056 innermost = GFC_OMP_SPLIT_PARALLEL;
4057 break;
4058 case EXEC_OMP_TARGET_PARALLEL_DO:
4059 mask = GFC_OMP_MASK_TARGET | GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO;
4060 innermost = GFC_OMP_SPLIT_DO;
4061 break;
4062 case EXEC_OMP_TARGET_PARALLEL_DO_SIMD:
4063 mask = GFC_OMP_MASK_TARGET | GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO
4064 | GFC_OMP_MASK_SIMD;
4065 innermost = GFC_OMP_SPLIT_SIMD;
4066 break;
4067 case EXEC_OMP_TARGET_SIMD:
4068 mask = GFC_OMP_MASK_TARGET | GFC_OMP_MASK_SIMD;
4069 innermost = GFC_OMP_SPLIT_SIMD;
4070 break;
4071 case EXEC_OMP_TARGET_TEAMS:
4072 mask = GFC_OMP_MASK_TARGET | GFC_OMP_MASK_TEAMS;
4073 innermost = GFC_OMP_SPLIT_TEAMS;
4074 break;
4075 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE:
4076 mask = GFC_OMP_MASK_TARGET | GFC_OMP_MASK_TEAMS
4077 | GFC_OMP_MASK_DISTRIBUTE;
4078 innermost = GFC_OMP_SPLIT_DISTRIBUTE;
4079 break;
4080 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE_PARALLEL_DO:
4081 mask = GFC_OMP_MASK_TARGET | GFC_OMP_MASK_TEAMS | GFC_OMP_MASK_DISTRIBUTE
4082 | GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO;
4083 innermost = GFC_OMP_SPLIT_DO;
4084 break;
4085 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE_PARALLEL_DO_SIMD:
4086 mask = GFC_OMP_MASK_TARGET | GFC_OMP_MASK_TEAMS | GFC_OMP_MASK_DISTRIBUTE
4087 | GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO | GFC_OMP_MASK_SIMD;
4088 innermost = GFC_OMP_SPLIT_SIMD;
4089 break;
4090 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE_SIMD:
4091 mask = GFC_OMP_MASK_TARGET | GFC_OMP_MASK_TEAMS
4092 | GFC_OMP_MASK_DISTRIBUTE | GFC_OMP_MASK_SIMD;
4093 innermost = GFC_OMP_SPLIT_SIMD;
4094 break;
4095 case EXEC_OMP_TASKLOOP:
4096 innermost = GFC_OMP_SPLIT_TASKLOOP;
4097 break;
4098 case EXEC_OMP_TASKLOOP_SIMD:
4099 mask = GFC_OMP_MASK_TASKLOOP | GFC_OMP_MASK_SIMD;
4100 innermost = GFC_OMP_SPLIT_SIMD;
4101 break;
4102 case EXEC_OMP_TEAMS:
4103 innermost = GFC_OMP_SPLIT_TEAMS;
4104 break;
4105 case EXEC_OMP_TEAMS_DISTRIBUTE:
4106 mask = GFC_OMP_MASK_TEAMS | GFC_OMP_MASK_DISTRIBUTE;
4107 innermost = GFC_OMP_SPLIT_DISTRIBUTE;
4108 break;
4109 case EXEC_OMP_TEAMS_DISTRIBUTE_PARALLEL_DO:
4110 mask = GFC_OMP_MASK_TEAMS | GFC_OMP_MASK_DISTRIBUTE
4111 | GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO;
4112 innermost = GFC_OMP_SPLIT_DO;
4113 break;
4114 case EXEC_OMP_TEAMS_DISTRIBUTE_PARALLEL_DO_SIMD:
4115 mask = GFC_OMP_MASK_TEAMS | GFC_OMP_MASK_DISTRIBUTE
4116 | GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO | GFC_OMP_MASK_SIMD;
4117 innermost = GFC_OMP_SPLIT_SIMD;
4118 break;
4119 case EXEC_OMP_TEAMS_DISTRIBUTE_SIMD:
4120 mask = GFC_OMP_MASK_TEAMS | GFC_OMP_MASK_DISTRIBUTE | GFC_OMP_MASK_SIMD;
4121 innermost = GFC_OMP_SPLIT_SIMD;
4122 break;
4123 default:
4124 gcc_unreachable ();
4125 }
4126 if (mask == 0)
4127 {
4128 clausesa[innermost] = *code->ext.omp_clauses;
4129 return;
4130 }
4131 if (code->ext.omp_clauses != NULL)
4132 {
4133 if (mask & GFC_OMP_MASK_TARGET)
4134 {
4135 /* First the clauses that are unique to some constructs. */
4136 clausesa[GFC_OMP_SPLIT_TARGET].lists[OMP_LIST_MAP]
4137 = code->ext.omp_clauses->lists[OMP_LIST_MAP];
4138 clausesa[GFC_OMP_SPLIT_TARGET].lists[OMP_LIST_IS_DEVICE_PTR]
4139 = code->ext.omp_clauses->lists[OMP_LIST_IS_DEVICE_PTR];
4140 clausesa[GFC_OMP_SPLIT_TARGET].device
4141 = code->ext.omp_clauses->device;
4142 clausesa[GFC_OMP_SPLIT_TARGET].defaultmap
4143 = code->ext.omp_clauses->defaultmap;
4144 clausesa[GFC_OMP_SPLIT_TARGET].if_exprs[OMP_IF_TARGET]
4145 = code->ext.omp_clauses->if_exprs[OMP_IF_TARGET];
4146 /* And this is copied to all. */
4147 clausesa[GFC_OMP_SPLIT_PARALLEL].if_expr
4148 = code->ext.omp_clauses->if_expr;
4149 }
4150 if (mask & GFC_OMP_MASK_TEAMS)
4151 {
4152 /* First the clauses that are unique to some constructs. */
4153 clausesa[GFC_OMP_SPLIT_TEAMS].num_teams
4154 = code->ext.omp_clauses->num_teams;
4155 clausesa[GFC_OMP_SPLIT_TEAMS].thread_limit
4156 = code->ext.omp_clauses->thread_limit;
4157 /* Shared and default clauses are allowed on parallel, teams
4158 and taskloop. */
4159 clausesa[GFC_OMP_SPLIT_TEAMS].lists[OMP_LIST_SHARED]
4160 = code->ext.omp_clauses->lists[OMP_LIST_SHARED];
4161 clausesa[GFC_OMP_SPLIT_TEAMS].default_sharing
4162 = code->ext.omp_clauses->default_sharing;
4163 }
4164 if (mask & GFC_OMP_MASK_DISTRIBUTE)
4165 {
4166 /* First the clauses that are unique to some constructs. */
4167 clausesa[GFC_OMP_SPLIT_DISTRIBUTE].dist_sched_kind
4168 = code->ext.omp_clauses->dist_sched_kind;
4169 clausesa[GFC_OMP_SPLIT_DISTRIBUTE].dist_chunk_size
4170 = code->ext.omp_clauses->dist_chunk_size;
4171 /* Duplicate collapse. */
4172 clausesa[GFC_OMP_SPLIT_DISTRIBUTE].collapse
4173 = code->ext.omp_clauses->collapse;
4174 }
4175 if (mask & GFC_OMP_MASK_PARALLEL)
4176 {
4177 /* First the clauses that are unique to some constructs. */
4178 clausesa[GFC_OMP_SPLIT_PARALLEL].lists[OMP_LIST_COPYIN]
4179 = code->ext.omp_clauses->lists[OMP_LIST_COPYIN];
4180 clausesa[GFC_OMP_SPLIT_PARALLEL].num_threads
4181 = code->ext.omp_clauses->num_threads;
4182 clausesa[GFC_OMP_SPLIT_PARALLEL].proc_bind
4183 = code->ext.omp_clauses->proc_bind;
4184 /* Shared and default clauses are allowed on parallel, teams
4185 and taskloop. */
4186 clausesa[GFC_OMP_SPLIT_PARALLEL].lists[OMP_LIST_SHARED]
4187 = code->ext.omp_clauses->lists[OMP_LIST_SHARED];
4188 clausesa[GFC_OMP_SPLIT_PARALLEL].default_sharing
4189 = code->ext.omp_clauses->default_sharing;
4190 clausesa[GFC_OMP_SPLIT_PARALLEL].if_exprs[OMP_IF_PARALLEL]
4191 = code->ext.omp_clauses->if_exprs[OMP_IF_PARALLEL];
4192 /* And this is copied to all. */
4193 clausesa[GFC_OMP_SPLIT_PARALLEL].if_expr
4194 = code->ext.omp_clauses->if_expr;
4195 }
4196 if (mask & GFC_OMP_MASK_DO)
4197 {
4198 /* First the clauses that are unique to some constructs. */
4199 clausesa[GFC_OMP_SPLIT_DO].ordered
4200 = code->ext.omp_clauses->ordered;
4201 clausesa[GFC_OMP_SPLIT_DO].orderedc
4202 = code->ext.omp_clauses->orderedc;
4203 clausesa[GFC_OMP_SPLIT_DO].sched_kind
4204 = code->ext.omp_clauses->sched_kind;
4205 if (innermost == GFC_OMP_SPLIT_SIMD)
4206 clausesa[GFC_OMP_SPLIT_DO].sched_simd
4207 = code->ext.omp_clauses->sched_simd;
4208 clausesa[GFC_OMP_SPLIT_DO].sched_monotonic
4209 = code->ext.omp_clauses->sched_monotonic;
4210 clausesa[GFC_OMP_SPLIT_DO].sched_nonmonotonic
4211 = code->ext.omp_clauses->sched_nonmonotonic;
4212 clausesa[GFC_OMP_SPLIT_DO].chunk_size
4213 = code->ext.omp_clauses->chunk_size;
4214 clausesa[GFC_OMP_SPLIT_DO].nowait
4215 = code->ext.omp_clauses->nowait;
4216 /* Duplicate collapse. */
4217 clausesa[GFC_OMP_SPLIT_DO].collapse
4218 = code->ext.omp_clauses->collapse;
4219 }
4220 if (mask & GFC_OMP_MASK_SIMD)
4221 {
4222 clausesa[GFC_OMP_SPLIT_SIMD].safelen_expr
4223 = code->ext.omp_clauses->safelen_expr;
4224 clausesa[GFC_OMP_SPLIT_SIMD].simdlen_expr
4225 = code->ext.omp_clauses->simdlen_expr;
4226 clausesa[GFC_OMP_SPLIT_SIMD].lists[OMP_LIST_ALIGNED]
4227 = code->ext.omp_clauses->lists[OMP_LIST_ALIGNED];
4228 /* Duplicate collapse. */
4229 clausesa[GFC_OMP_SPLIT_SIMD].collapse
4230 = code->ext.omp_clauses->collapse;
4231 }
4232 if (mask & GFC_OMP_MASK_TASKLOOP)
4233 {
4234 /* First the clauses that are unique to some constructs. */
4235 clausesa[GFC_OMP_SPLIT_TASKLOOP].nogroup
4236 = code->ext.omp_clauses->nogroup;
4237 clausesa[GFC_OMP_SPLIT_TASKLOOP].grainsize
4238 = code->ext.omp_clauses->grainsize;
4239 clausesa[GFC_OMP_SPLIT_TASKLOOP].num_tasks
4240 = code->ext.omp_clauses->num_tasks;
4241 clausesa[GFC_OMP_SPLIT_TASKLOOP].priority
4242 = code->ext.omp_clauses->priority;
4243 clausesa[GFC_OMP_SPLIT_TASKLOOP].final_expr
4244 = code->ext.omp_clauses->final_expr;
4245 clausesa[GFC_OMP_SPLIT_TASKLOOP].untied
4246 = code->ext.omp_clauses->untied;
4247 clausesa[GFC_OMP_SPLIT_TASKLOOP].mergeable
4248 = code->ext.omp_clauses->mergeable;
4249 clausesa[GFC_OMP_SPLIT_TASKLOOP].if_exprs[OMP_IF_TASKLOOP]
4250 = code->ext.omp_clauses->if_exprs[OMP_IF_TASKLOOP];
4251 /* And this is copied to all. */
4252 clausesa[GFC_OMP_SPLIT_TASKLOOP].if_expr
4253 = code->ext.omp_clauses->if_expr;
4254 /* Shared and default clauses are allowed on parallel, teams
4255 and taskloop. */
4256 clausesa[GFC_OMP_SPLIT_TASKLOOP].lists[OMP_LIST_SHARED]
4257 = code->ext.omp_clauses->lists[OMP_LIST_SHARED];
4258 clausesa[GFC_OMP_SPLIT_TASKLOOP].default_sharing
4259 = code->ext.omp_clauses->default_sharing;
4260 /* Duplicate collapse. */
4261 clausesa[GFC_OMP_SPLIT_TASKLOOP].collapse
4262 = code->ext.omp_clauses->collapse;
4263 }
4264 /* Private clause is supported on all constructs,
4265 it is enough to put it on the innermost one. For
4266 !$ omp parallel do put it on parallel though,
4267 as that's what we did for OpenMP 3.1. */
4268 clausesa[innermost == GFC_OMP_SPLIT_DO
4269 ? (int) GFC_OMP_SPLIT_PARALLEL
4270 : innermost].lists[OMP_LIST_PRIVATE]
4271 = code->ext.omp_clauses->lists[OMP_LIST_PRIVATE];
4272 /* Firstprivate clause is supported on all constructs but
4273 simd. Put it on the outermost of those and duplicate
4274 on parallel and teams. */
4275 if (mask & GFC_OMP_MASK_TARGET)
4276 clausesa[GFC_OMP_SPLIT_TARGET].lists[OMP_LIST_FIRSTPRIVATE]
4277 = code->ext.omp_clauses->lists[OMP_LIST_FIRSTPRIVATE];
4278 if (mask & GFC_OMP_MASK_TEAMS)
4279 clausesa[GFC_OMP_SPLIT_TEAMS].lists[OMP_LIST_FIRSTPRIVATE]
4280 = code->ext.omp_clauses->lists[OMP_LIST_FIRSTPRIVATE];
4281 else if (mask & GFC_OMP_MASK_DISTRIBUTE)
4282 clausesa[GFC_OMP_SPLIT_DISTRIBUTE].lists[OMP_LIST_FIRSTPRIVATE]
4283 = code->ext.omp_clauses->lists[OMP_LIST_FIRSTPRIVATE];
4284 if (mask & GFC_OMP_MASK_PARALLEL)
4285 clausesa[GFC_OMP_SPLIT_PARALLEL].lists[OMP_LIST_FIRSTPRIVATE]
4286 = code->ext.omp_clauses->lists[OMP_LIST_FIRSTPRIVATE];
4287 else if (mask & GFC_OMP_MASK_DO)
4288 clausesa[GFC_OMP_SPLIT_DO].lists[OMP_LIST_FIRSTPRIVATE]
4289 = code->ext.omp_clauses->lists[OMP_LIST_FIRSTPRIVATE];
4290 /* Lastprivate is allowed on distribute, do and simd.
4291 In parallel do{, simd} we actually want to put it on
4292 parallel rather than do. */
4293 if (mask & GFC_OMP_MASK_DISTRIBUTE)
4294 clausesa[GFC_OMP_SPLIT_DISTRIBUTE].lists[OMP_LIST_LASTPRIVATE]
4295 = code->ext.omp_clauses->lists[OMP_LIST_LASTPRIVATE];
4296 if (mask & GFC_OMP_MASK_PARALLEL)
4297 clausesa[GFC_OMP_SPLIT_PARALLEL].lists[OMP_LIST_LASTPRIVATE]
4298 = code->ext.omp_clauses->lists[OMP_LIST_LASTPRIVATE];
4299 else if (mask & GFC_OMP_MASK_DO)
4300 clausesa[GFC_OMP_SPLIT_DO].lists[OMP_LIST_LASTPRIVATE]
4301 = code->ext.omp_clauses->lists[OMP_LIST_LASTPRIVATE];
4302 if (mask & GFC_OMP_MASK_SIMD)
4303 clausesa[GFC_OMP_SPLIT_SIMD].lists[OMP_LIST_LASTPRIVATE]
4304 = code->ext.omp_clauses->lists[OMP_LIST_LASTPRIVATE];
4305 /* Reduction is allowed on simd, do, parallel and teams.
4306 Duplicate it on all of them, but omit on do if
4307 parallel is present. */
4308 if (mask & GFC_OMP_MASK_TEAMS)
4309 clausesa[GFC_OMP_SPLIT_TEAMS].lists[OMP_LIST_REDUCTION]
4310 = code->ext.omp_clauses->lists[OMP_LIST_REDUCTION];
4311 if (mask & GFC_OMP_MASK_PARALLEL)
4312 clausesa[GFC_OMP_SPLIT_PARALLEL].lists[OMP_LIST_REDUCTION]
4313 = code->ext.omp_clauses->lists[OMP_LIST_REDUCTION];
4314 else if (mask & GFC_OMP_MASK_DO)
4315 clausesa[GFC_OMP_SPLIT_DO].lists[OMP_LIST_REDUCTION]
4316 = code->ext.omp_clauses->lists[OMP_LIST_REDUCTION];
4317 if (mask & GFC_OMP_MASK_SIMD)
4318 clausesa[GFC_OMP_SPLIT_SIMD].lists[OMP_LIST_REDUCTION]
4319 = code->ext.omp_clauses->lists[OMP_LIST_REDUCTION];
4320 /* Linear clause is supported on do and simd,
4321 put it on the innermost one. */
4322 clausesa[innermost].lists[OMP_LIST_LINEAR]
4323 = code->ext.omp_clauses->lists[OMP_LIST_LINEAR];
4324 }
4325 if ((mask & (GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO))
4326 == (GFC_OMP_MASK_PARALLEL | GFC_OMP_MASK_DO))
4327 clausesa[GFC_OMP_SPLIT_DO].nowait = true;
4328 }
4329
4330 static tree
4331 gfc_trans_omp_do_simd (gfc_code *code, stmtblock_t *pblock,
4332 gfc_omp_clauses *clausesa, tree omp_clauses)
4333 {
4334 stmtblock_t block;
4335 gfc_omp_clauses clausesa_buf[GFC_OMP_SPLIT_NUM];
4336 tree stmt, body, omp_do_clauses = NULL_TREE;
4337
4338 if (pblock == NULL)
4339 gfc_start_block (&block);
4340 else
4341 gfc_init_block (&block);
4342
4343 if (clausesa == NULL)
4344 {
4345 clausesa = clausesa_buf;
4346 gfc_split_omp_clauses (code, clausesa);
4347 }
4348 if (flag_openmp)
4349 omp_do_clauses
4350 = gfc_trans_omp_clauses (&block, &clausesa[GFC_OMP_SPLIT_DO], code->loc);
4351 body = gfc_trans_omp_do (code, EXEC_OMP_SIMD, pblock ? pblock : &block,
4352 &clausesa[GFC_OMP_SPLIT_SIMD], omp_clauses);
4353 if (pblock == NULL)
4354 {
4355 if (TREE_CODE (body) != BIND_EXPR)
4356 body = build3_v (BIND_EXPR, NULL, body, poplevel (1, 0));
4357 else
4358 poplevel (0, 0);
4359 }
4360 else if (TREE_CODE (body) != BIND_EXPR)
4361 body = build3_v (BIND_EXPR, NULL, body, NULL_TREE);
4362 if (flag_openmp)
4363 {
4364 stmt = make_node (OMP_FOR);
4365 TREE_TYPE (stmt) = void_type_node;
4366 OMP_FOR_BODY (stmt) = body;
4367 OMP_FOR_CLAUSES (stmt) = omp_do_clauses;
4368 }
4369 else
4370 stmt = body;
4371 gfc_add_expr_to_block (&block, stmt);
4372 return gfc_finish_block (&block);
4373 }
4374
4375 static tree
4376 gfc_trans_omp_parallel_do (gfc_code *code, stmtblock_t *pblock,
4377 gfc_omp_clauses *clausesa)
4378 {
4379 stmtblock_t block, *new_pblock = pblock;
4380 gfc_omp_clauses clausesa_buf[GFC_OMP_SPLIT_NUM];
4381 tree stmt, omp_clauses = NULL_TREE;
4382
4383 if (pblock == NULL)
4384 gfc_start_block (&block);
4385 else
4386 gfc_init_block (&block);
4387
4388 if (clausesa == NULL)
4389 {
4390 clausesa = clausesa_buf;
4391 gfc_split_omp_clauses (code, clausesa);
4392 }
4393 omp_clauses
4394 = gfc_trans_omp_clauses (&block, &clausesa[GFC_OMP_SPLIT_PARALLEL],
4395 code->loc);
4396 if (pblock == NULL)
4397 {
4398 if (!clausesa[GFC_OMP_SPLIT_DO].ordered
4399 && clausesa[GFC_OMP_SPLIT_DO].sched_kind != OMP_SCHED_STATIC)
4400 new_pblock = &block;
4401 else
4402 pushlevel ();
4403 }
4404 stmt = gfc_trans_omp_do (code, EXEC_OMP_DO, new_pblock,
4405 &clausesa[GFC_OMP_SPLIT_DO], omp_clauses);
4406 if (pblock == NULL)
4407 {
4408 if (TREE_CODE (stmt) != BIND_EXPR)
4409 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4410 else
4411 poplevel (0, 0);
4412 }
4413 else if (TREE_CODE (stmt) != BIND_EXPR)
4414 stmt = build3_v (BIND_EXPR, NULL, stmt, NULL_TREE);
4415 stmt = build2_loc (input_location, OMP_PARALLEL, void_type_node, stmt,
4416 omp_clauses);
4417 OMP_PARALLEL_COMBINED (stmt) = 1;
4418 gfc_add_expr_to_block (&block, stmt);
4419 return gfc_finish_block (&block);
4420 }
4421
4422 static tree
4423 gfc_trans_omp_parallel_do_simd (gfc_code *code, stmtblock_t *pblock,
4424 gfc_omp_clauses *clausesa)
4425 {
4426 stmtblock_t block;
4427 gfc_omp_clauses clausesa_buf[GFC_OMP_SPLIT_NUM];
4428 tree stmt, omp_clauses = NULL_TREE;
4429
4430 if (pblock == NULL)
4431 gfc_start_block (&block);
4432 else
4433 gfc_init_block (&block);
4434
4435 if (clausesa == NULL)
4436 {
4437 clausesa = clausesa_buf;
4438 gfc_split_omp_clauses (code, clausesa);
4439 }
4440 if (flag_openmp)
4441 omp_clauses
4442 = gfc_trans_omp_clauses (&block, &clausesa[GFC_OMP_SPLIT_PARALLEL],
4443 code->loc);
4444 if (pblock == NULL)
4445 pushlevel ();
4446 stmt = gfc_trans_omp_do_simd (code, pblock, clausesa, omp_clauses);
4447 if (pblock == NULL)
4448 {
4449 if (TREE_CODE (stmt) != BIND_EXPR)
4450 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4451 else
4452 poplevel (0, 0);
4453 }
4454 else if (TREE_CODE (stmt) != BIND_EXPR)
4455 stmt = build3_v (BIND_EXPR, NULL, stmt, NULL_TREE);
4456 if (flag_openmp)
4457 {
4458 stmt = build2_loc (input_location, OMP_PARALLEL, void_type_node, stmt,
4459 omp_clauses);
4460 OMP_PARALLEL_COMBINED (stmt) = 1;
4461 }
4462 gfc_add_expr_to_block (&block, stmt);
4463 return gfc_finish_block (&block);
4464 }
4465
4466 static tree
4467 gfc_trans_omp_parallel_sections (gfc_code *code)
4468 {
4469 stmtblock_t block;
4470 gfc_omp_clauses section_clauses;
4471 tree stmt, omp_clauses;
4472
4473 memset (&section_clauses, 0, sizeof (section_clauses));
4474 section_clauses.nowait = true;
4475
4476 gfc_start_block (&block);
4477 omp_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
4478 code->loc);
4479 pushlevel ();
4480 stmt = gfc_trans_omp_sections (code, &section_clauses);
4481 if (TREE_CODE (stmt) != BIND_EXPR)
4482 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4483 else
4484 poplevel (0, 0);
4485 stmt = build2_loc (input_location, OMP_PARALLEL, void_type_node, stmt,
4486 omp_clauses);
4487 OMP_PARALLEL_COMBINED (stmt) = 1;
4488 gfc_add_expr_to_block (&block, stmt);
4489 return gfc_finish_block (&block);
4490 }
4491
4492 static tree
4493 gfc_trans_omp_parallel_workshare (gfc_code *code)
4494 {
4495 stmtblock_t block;
4496 gfc_omp_clauses workshare_clauses;
4497 tree stmt, omp_clauses;
4498
4499 memset (&workshare_clauses, 0, sizeof (workshare_clauses));
4500 workshare_clauses.nowait = true;
4501
4502 gfc_start_block (&block);
4503 omp_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
4504 code->loc);
4505 pushlevel ();
4506 stmt = gfc_trans_omp_workshare (code, &workshare_clauses);
4507 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4508 stmt = build2_loc (input_location, OMP_PARALLEL, void_type_node, stmt,
4509 omp_clauses);
4510 OMP_PARALLEL_COMBINED (stmt) = 1;
4511 gfc_add_expr_to_block (&block, stmt);
4512 return gfc_finish_block (&block);
4513 }
4514
4515 static tree
4516 gfc_trans_omp_sections (gfc_code *code, gfc_omp_clauses *clauses)
4517 {
4518 stmtblock_t block, body;
4519 tree omp_clauses, stmt;
4520 bool has_lastprivate = clauses->lists[OMP_LIST_LASTPRIVATE] != NULL;
4521
4522 gfc_start_block (&block);
4523
4524 omp_clauses = gfc_trans_omp_clauses (&block, clauses, code->loc);
4525
4526 gfc_init_block (&body);
4527 for (code = code->block; code; code = code->block)
4528 {
4529 /* Last section is special because of lastprivate, so even if it
4530 is empty, chain it in. */
4531 stmt = gfc_trans_omp_code (code->next,
4532 has_lastprivate && code->block == NULL);
4533 if (! IS_EMPTY_STMT (stmt))
4534 {
4535 stmt = build1_v (OMP_SECTION, stmt);
4536 gfc_add_expr_to_block (&body, stmt);
4537 }
4538 }
4539 stmt = gfc_finish_block (&body);
4540
4541 stmt = build2_loc (input_location, OMP_SECTIONS, void_type_node, stmt,
4542 omp_clauses);
4543 gfc_add_expr_to_block (&block, stmt);
4544
4545 return gfc_finish_block (&block);
4546 }
4547
4548 static tree
4549 gfc_trans_omp_single (gfc_code *code, gfc_omp_clauses *clauses)
4550 {
4551 tree omp_clauses = gfc_trans_omp_clauses (NULL, clauses, code->loc);
4552 tree stmt = gfc_trans_omp_code (code->block->next, true);
4553 stmt = build2_loc (input_location, OMP_SINGLE, void_type_node, stmt,
4554 omp_clauses);
4555 return stmt;
4556 }
4557
4558 static tree
4559 gfc_trans_omp_task (gfc_code *code)
4560 {
4561 stmtblock_t block;
4562 tree stmt, omp_clauses;
4563
4564 gfc_start_block (&block);
4565 omp_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
4566 code->loc);
4567 pushlevel ();
4568 stmt = gfc_trans_omp_code (code->block->next, true);
4569 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4570 stmt = build2_loc (input_location, OMP_TASK, void_type_node, stmt,
4571 omp_clauses);
4572 gfc_add_expr_to_block (&block, stmt);
4573 return gfc_finish_block (&block);
4574 }
4575
4576 static tree
4577 gfc_trans_omp_taskgroup (gfc_code *code)
4578 {
4579 tree stmt = gfc_trans_code (code->block->next);
4580 return build1_loc (input_location, OMP_TASKGROUP, void_type_node, stmt);
4581 }
4582
4583 static tree
4584 gfc_trans_omp_taskwait (void)
4585 {
4586 tree decl = builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT);
4587 return build_call_expr_loc (input_location, decl, 0);
4588 }
4589
4590 static tree
4591 gfc_trans_omp_taskyield (void)
4592 {
4593 tree decl = builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD);
4594 return build_call_expr_loc (input_location, decl, 0);
4595 }
4596
4597 static tree
4598 gfc_trans_omp_distribute (gfc_code *code, gfc_omp_clauses *clausesa)
4599 {
4600 stmtblock_t block;
4601 gfc_omp_clauses clausesa_buf[GFC_OMP_SPLIT_NUM];
4602 tree stmt, omp_clauses = NULL_TREE;
4603
4604 gfc_start_block (&block);
4605 if (clausesa == NULL)
4606 {
4607 clausesa = clausesa_buf;
4608 gfc_split_omp_clauses (code, clausesa);
4609 }
4610 if (flag_openmp)
4611 omp_clauses
4612 = gfc_trans_omp_clauses (&block, &clausesa[GFC_OMP_SPLIT_DISTRIBUTE],
4613 code->loc);
4614 switch (code->op)
4615 {
4616 case EXEC_OMP_DISTRIBUTE:
4617 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE:
4618 case EXEC_OMP_TEAMS_DISTRIBUTE:
4619 /* This is handled in gfc_trans_omp_do. */
4620 gcc_unreachable ();
4621 break;
4622 case EXEC_OMP_DISTRIBUTE_PARALLEL_DO:
4623 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE_PARALLEL_DO:
4624 case EXEC_OMP_TEAMS_DISTRIBUTE_PARALLEL_DO:
4625 stmt = gfc_trans_omp_parallel_do (code, &block, clausesa);
4626 if (TREE_CODE (stmt) != BIND_EXPR)
4627 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4628 else
4629 poplevel (0, 0);
4630 break;
4631 case EXEC_OMP_DISTRIBUTE_PARALLEL_DO_SIMD:
4632 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE_PARALLEL_DO_SIMD:
4633 case EXEC_OMP_TEAMS_DISTRIBUTE_PARALLEL_DO_SIMD:
4634 stmt = gfc_trans_omp_parallel_do_simd (code, &block, clausesa);
4635 if (TREE_CODE (stmt) != BIND_EXPR)
4636 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4637 else
4638 poplevel (0, 0);
4639 break;
4640 case EXEC_OMP_DISTRIBUTE_SIMD:
4641 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE_SIMD:
4642 case EXEC_OMP_TEAMS_DISTRIBUTE_SIMD:
4643 stmt = gfc_trans_omp_do (code, EXEC_OMP_SIMD, &block,
4644 &clausesa[GFC_OMP_SPLIT_SIMD], NULL_TREE);
4645 if (TREE_CODE (stmt) != BIND_EXPR)
4646 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4647 else
4648 poplevel (0, 0);
4649 break;
4650 default:
4651 gcc_unreachable ();
4652 }
4653 if (flag_openmp)
4654 {
4655 tree distribute = make_node (OMP_DISTRIBUTE);
4656 TREE_TYPE (distribute) = void_type_node;
4657 OMP_FOR_BODY (distribute) = stmt;
4658 OMP_FOR_CLAUSES (distribute) = omp_clauses;
4659 stmt = distribute;
4660 }
4661 gfc_add_expr_to_block (&block, stmt);
4662 return gfc_finish_block (&block);
4663 }
4664
4665 static tree
4666 gfc_trans_omp_teams (gfc_code *code, gfc_omp_clauses *clausesa,
4667 tree omp_clauses)
4668 {
4669 stmtblock_t block;
4670 gfc_omp_clauses clausesa_buf[GFC_OMP_SPLIT_NUM];
4671 tree stmt;
4672 bool combined = true;
4673
4674 gfc_start_block (&block);
4675 if (clausesa == NULL)
4676 {
4677 clausesa = clausesa_buf;
4678 gfc_split_omp_clauses (code, clausesa);
4679 }
4680 if (flag_openmp)
4681 omp_clauses
4682 = chainon (omp_clauses,
4683 gfc_trans_omp_clauses (&block, &clausesa[GFC_OMP_SPLIT_TEAMS],
4684 code->loc));
4685 switch (code->op)
4686 {
4687 case EXEC_OMP_TARGET_TEAMS:
4688 case EXEC_OMP_TEAMS:
4689 stmt = gfc_trans_omp_code (code->block->next, true);
4690 combined = false;
4691 break;
4692 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE:
4693 case EXEC_OMP_TEAMS_DISTRIBUTE:
4694 stmt = gfc_trans_omp_do (code, EXEC_OMP_DISTRIBUTE, NULL,
4695 &clausesa[GFC_OMP_SPLIT_DISTRIBUTE],
4696 NULL);
4697 break;
4698 default:
4699 stmt = gfc_trans_omp_distribute (code, clausesa);
4700 break;
4701 }
4702 if (flag_openmp)
4703 {
4704 stmt = build2_loc (input_location, OMP_TEAMS, void_type_node, stmt,
4705 omp_clauses);
4706 if (combined)
4707 OMP_TEAMS_COMBINED (stmt) = 1;
4708 }
4709 gfc_add_expr_to_block (&block, stmt);
4710 return gfc_finish_block (&block);
4711 }
4712
4713 static tree
4714 gfc_trans_omp_target (gfc_code *code)
4715 {
4716 stmtblock_t block;
4717 gfc_omp_clauses clausesa[GFC_OMP_SPLIT_NUM];
4718 tree stmt, omp_clauses = NULL_TREE;
4719
4720 gfc_start_block (&block);
4721 gfc_split_omp_clauses (code, clausesa);
4722 if (flag_openmp)
4723 omp_clauses
4724 = gfc_trans_omp_clauses (&block, &clausesa[GFC_OMP_SPLIT_TARGET],
4725 code->loc);
4726 switch (code->op)
4727 {
4728 case EXEC_OMP_TARGET:
4729 pushlevel ();
4730 stmt = gfc_trans_omp_code (code->block->next, true);
4731 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4732 break;
4733 case EXEC_OMP_TARGET_PARALLEL:
4734 {
4735 stmtblock_t iblock;
4736
4737 gfc_start_block (&iblock);
4738 tree inner_clauses
4739 = gfc_trans_omp_clauses (&block, &clausesa[GFC_OMP_SPLIT_PARALLEL],
4740 code->loc);
4741 stmt = gfc_trans_omp_code (code->block->next, true);
4742 stmt = build2_loc (input_location, OMP_PARALLEL, void_type_node, stmt,
4743 inner_clauses);
4744 gfc_add_expr_to_block (&iblock, stmt);
4745 stmt = gfc_finish_block (&iblock);
4746 if (TREE_CODE (stmt) != BIND_EXPR)
4747 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4748 else
4749 poplevel (0, 0);
4750 }
4751 break;
4752 case EXEC_OMP_TARGET_PARALLEL_DO:
4753 case EXEC_OMP_TARGET_PARALLEL_DO_SIMD:
4754 stmt = gfc_trans_omp_parallel_do (code, &block, clausesa);
4755 if (TREE_CODE (stmt) != BIND_EXPR)
4756 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4757 else
4758 poplevel (0, 0);
4759 break;
4760 case EXEC_OMP_TARGET_SIMD:
4761 stmt = gfc_trans_omp_do (code, EXEC_OMP_SIMD, &block,
4762 &clausesa[GFC_OMP_SPLIT_SIMD], NULL_TREE);
4763 if (TREE_CODE (stmt) != BIND_EXPR)
4764 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4765 else
4766 poplevel (0, 0);
4767 break;
4768 default:
4769 if (flag_openmp
4770 && (clausesa[GFC_OMP_SPLIT_TEAMS].num_teams
4771 || clausesa[GFC_OMP_SPLIT_TEAMS].thread_limit))
4772 {
4773 gfc_omp_clauses clausesb;
4774 tree teams_clauses;
4775 /* For combined !$omp target teams, the num_teams and
4776 thread_limit clauses are evaluated before entering the
4777 target construct. */
4778 memset (&clausesb, '\0', sizeof (clausesb));
4779 clausesb.num_teams = clausesa[GFC_OMP_SPLIT_TEAMS].num_teams;
4780 clausesb.thread_limit = clausesa[GFC_OMP_SPLIT_TEAMS].thread_limit;
4781 clausesa[GFC_OMP_SPLIT_TEAMS].num_teams = NULL;
4782 clausesa[GFC_OMP_SPLIT_TEAMS].thread_limit = NULL;
4783 teams_clauses
4784 = gfc_trans_omp_clauses (&block, &clausesb, code->loc);
4785 pushlevel ();
4786 stmt = gfc_trans_omp_teams (code, clausesa, teams_clauses);
4787 }
4788 else
4789 {
4790 pushlevel ();
4791 stmt = gfc_trans_omp_teams (code, clausesa, NULL_TREE);
4792 }
4793 if (TREE_CODE (stmt) != BIND_EXPR)
4794 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4795 else
4796 poplevel (0, 0);
4797 break;
4798 }
4799 if (flag_openmp)
4800 {
4801 stmt = build2_loc (input_location, OMP_TARGET, void_type_node, stmt,
4802 omp_clauses);
4803 if (code->op != EXEC_OMP_TARGET)
4804 OMP_TARGET_COMBINED (stmt) = 1;
4805 }
4806 gfc_add_expr_to_block (&block, stmt);
4807 return gfc_finish_block (&block);
4808 }
4809
4810 static tree
4811 gfc_trans_omp_taskloop (gfc_code *code)
4812 {
4813 stmtblock_t block;
4814 gfc_omp_clauses clausesa[GFC_OMP_SPLIT_NUM];
4815 tree stmt, omp_clauses = NULL_TREE;
4816
4817 gfc_start_block (&block);
4818 gfc_split_omp_clauses (code, clausesa);
4819 if (flag_openmp)
4820 omp_clauses
4821 = gfc_trans_omp_clauses (&block, &clausesa[GFC_OMP_SPLIT_TASKLOOP],
4822 code->loc);
4823 switch (code->op)
4824 {
4825 case EXEC_OMP_TASKLOOP:
4826 /* This is handled in gfc_trans_omp_do. */
4827 gcc_unreachable ();
4828 break;
4829 case EXEC_OMP_TASKLOOP_SIMD:
4830 stmt = gfc_trans_omp_do (code, EXEC_OMP_SIMD, &block,
4831 &clausesa[GFC_OMP_SPLIT_SIMD], NULL_TREE);
4832 if (TREE_CODE (stmt) != BIND_EXPR)
4833 stmt = build3_v (BIND_EXPR, NULL, stmt, poplevel (1, 0));
4834 else
4835 poplevel (0, 0);
4836 break;
4837 default:
4838 gcc_unreachable ();
4839 }
4840 if (flag_openmp)
4841 {
4842 tree taskloop = make_node (OMP_TASKLOOP);
4843 TREE_TYPE (taskloop) = void_type_node;
4844 OMP_FOR_BODY (taskloop) = stmt;
4845 OMP_FOR_CLAUSES (taskloop) = omp_clauses;
4846 stmt = taskloop;
4847 }
4848 gfc_add_expr_to_block (&block, stmt);
4849 return gfc_finish_block (&block);
4850 }
4851
4852 static tree
4853 gfc_trans_omp_target_data (gfc_code *code)
4854 {
4855 stmtblock_t block;
4856 tree stmt, omp_clauses;
4857
4858 gfc_start_block (&block);
4859 omp_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
4860 code->loc);
4861 stmt = gfc_trans_omp_code (code->block->next, true);
4862 stmt = build2_loc (input_location, OMP_TARGET_DATA, void_type_node, stmt,
4863 omp_clauses);
4864 gfc_add_expr_to_block (&block, stmt);
4865 return gfc_finish_block (&block);
4866 }
4867
4868 static tree
4869 gfc_trans_omp_target_enter_data (gfc_code *code)
4870 {
4871 stmtblock_t block;
4872 tree stmt, omp_clauses;
4873
4874 gfc_start_block (&block);
4875 omp_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
4876 code->loc);
4877 stmt = build1_loc (input_location, OMP_TARGET_ENTER_DATA, void_type_node,
4878 omp_clauses);
4879 gfc_add_expr_to_block (&block, stmt);
4880 return gfc_finish_block (&block);
4881 }
4882
4883 static tree
4884 gfc_trans_omp_target_exit_data (gfc_code *code)
4885 {
4886 stmtblock_t block;
4887 tree stmt, omp_clauses;
4888
4889 gfc_start_block (&block);
4890 omp_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
4891 code->loc);
4892 stmt = build1_loc (input_location, OMP_TARGET_EXIT_DATA, void_type_node,
4893 omp_clauses);
4894 gfc_add_expr_to_block (&block, stmt);
4895 return gfc_finish_block (&block);
4896 }
4897
4898 static tree
4899 gfc_trans_omp_target_update (gfc_code *code)
4900 {
4901 stmtblock_t block;
4902 tree stmt, omp_clauses;
4903
4904 gfc_start_block (&block);
4905 omp_clauses = gfc_trans_omp_clauses (&block, code->ext.omp_clauses,
4906 code->loc);
4907 stmt = build1_loc (input_location, OMP_TARGET_UPDATE, void_type_node,
4908 omp_clauses);
4909 gfc_add_expr_to_block (&block, stmt);
4910 return gfc_finish_block (&block);
4911 }
4912
4913 static tree
4914 gfc_trans_omp_workshare (gfc_code *code, gfc_omp_clauses *clauses)
4915 {
4916 tree res, tmp, stmt;
4917 stmtblock_t block, *pblock = NULL;
4918 stmtblock_t singleblock;
4919 int saved_ompws_flags;
4920 bool singleblock_in_progress = false;
4921 /* True if previous gfc_code in workshare construct is not workshared. */
4922 bool prev_singleunit;
4923
4924 code = code->block->next;
4925
4926 pushlevel ();
4927
4928 gfc_start_block (&block);
4929 pblock = &block;
4930
4931 ompws_flags = OMPWS_WORKSHARE_FLAG;
4932 prev_singleunit = false;
4933
4934 /* Translate statements one by one to trees until we reach
4935 the end of the workshare construct. Adjacent gfc_codes that
4936 are a single unit of work are clustered and encapsulated in a
4937 single OMP_SINGLE construct. */
4938 for (; code; code = code->next)
4939 {
4940 if (code->here != 0)
4941 {
4942 res = gfc_trans_label_here (code);
4943 gfc_add_expr_to_block (pblock, res);
4944 }
4945
4946 /* No dependence analysis, use for clauses with wait.
4947 If this is the last gfc_code, use default omp_clauses. */
4948 if (code->next == NULL && clauses->nowait)
4949 ompws_flags |= OMPWS_NOWAIT;
4950
4951 /* By default, every gfc_code is a single unit of work. */
4952 ompws_flags |= OMPWS_CURR_SINGLEUNIT;
4953 ompws_flags &= ~(OMPWS_SCALARIZER_WS | OMPWS_SCALARIZER_BODY);
4954
4955 switch (code->op)
4956 {
4957 case EXEC_NOP:
4958 res = NULL_TREE;
4959 break;
4960
4961 case EXEC_ASSIGN:
4962 res = gfc_trans_assign (code);
4963 break;
4964
4965 case EXEC_POINTER_ASSIGN:
4966 res = gfc_trans_pointer_assign (code);
4967 break;
4968
4969 case EXEC_INIT_ASSIGN:
4970 res = gfc_trans_init_assign (code);
4971 break;
4972
4973 case EXEC_FORALL:
4974 res = gfc_trans_forall (code);
4975 break;
4976
4977 case EXEC_WHERE:
4978 res = gfc_trans_where (code);
4979 break;
4980
4981 case EXEC_OMP_ATOMIC:
4982 res = gfc_trans_omp_directive (code);
4983 break;
4984
4985 case EXEC_OMP_PARALLEL:
4986 case EXEC_OMP_PARALLEL_DO:
4987 case EXEC_OMP_PARALLEL_SECTIONS:
4988 case EXEC_OMP_PARALLEL_WORKSHARE:
4989 case EXEC_OMP_CRITICAL:
4990 saved_ompws_flags = ompws_flags;
4991 ompws_flags = 0;
4992 res = gfc_trans_omp_directive (code);
4993 ompws_flags = saved_ompws_flags;
4994 break;
4995
4996 default:
4997 gfc_internal_error ("gfc_trans_omp_workshare(): Bad statement code");
4998 }
4999
5000 gfc_set_backend_locus (&code->loc);
5001
5002 if (res != NULL_TREE && ! IS_EMPTY_STMT (res))
5003 {
5004 if (prev_singleunit)
5005 {
5006 if (ompws_flags & OMPWS_CURR_SINGLEUNIT)
5007 /* Add current gfc_code to single block. */
5008 gfc_add_expr_to_block (&singleblock, res);
5009 else
5010 {
5011 /* Finish single block and add it to pblock. */
5012 tmp = gfc_finish_block (&singleblock);
5013 tmp = build2_loc (input_location, OMP_SINGLE,
5014 void_type_node, tmp, NULL_TREE);
5015 gfc_add_expr_to_block (pblock, tmp);
5016 /* Add current gfc_code to pblock. */
5017 gfc_add_expr_to_block (pblock, res);
5018 singleblock_in_progress = false;
5019 }
5020 }
5021 else
5022 {
5023 if (ompws_flags & OMPWS_CURR_SINGLEUNIT)
5024 {
5025 /* Start single block. */
5026 gfc_init_block (&singleblock);
5027 gfc_add_expr_to_block (&singleblock, res);
5028 singleblock_in_progress = true;
5029 }
5030 else
5031 /* Add the new statement to the block. */
5032 gfc_add_expr_to_block (pblock, res);
5033 }
5034 prev_singleunit = (ompws_flags & OMPWS_CURR_SINGLEUNIT) != 0;
5035 }
5036 }
5037
5038 /* Finish remaining SINGLE block, if we were in the middle of one. */
5039 if (singleblock_in_progress)
5040 {
5041 /* Finish single block and add it to pblock. */
5042 tmp = gfc_finish_block (&singleblock);
5043 tmp = build2_loc (input_location, OMP_SINGLE, void_type_node, tmp,
5044 clauses->nowait
5045 ? build_omp_clause (input_location, OMP_CLAUSE_NOWAIT)
5046 : NULL_TREE);
5047 gfc_add_expr_to_block (pblock, tmp);
5048 }
5049
5050 stmt = gfc_finish_block (pblock);
5051 if (TREE_CODE (stmt) != BIND_EXPR)
5052 {
5053 if (!IS_EMPTY_STMT (stmt))
5054 {
5055 tree bindblock = poplevel (1, 0);
5056 stmt = build3_v (BIND_EXPR, NULL, stmt, bindblock);
5057 }
5058 else
5059 poplevel (0, 0);
5060 }
5061 else
5062 poplevel (0, 0);
5063
5064 if (IS_EMPTY_STMT (stmt) && !clauses->nowait)
5065 stmt = gfc_trans_omp_barrier ();
5066
5067 ompws_flags = 0;
5068 return stmt;
5069 }
5070
5071 tree
5072 gfc_trans_oacc_declare (gfc_code *code)
5073 {
5074 stmtblock_t block;
5075 tree stmt, oacc_clauses;
5076 enum tree_code construct_code;
5077
5078 construct_code = OACC_DATA;
5079
5080 gfc_start_block (&block);
5081
5082 oacc_clauses = gfc_trans_omp_clauses (&block, code->ext.oacc_declare->clauses,
5083 code->loc);
5084 stmt = gfc_trans_omp_code (code->block->next, true);
5085 stmt = build2_loc (input_location, construct_code, void_type_node, stmt,
5086 oacc_clauses);
5087 gfc_add_expr_to_block (&block, stmt);
5088
5089 return gfc_finish_block (&block);
5090 }
5091
5092 tree
5093 gfc_trans_oacc_directive (gfc_code *code)
5094 {
5095 switch (code->op)
5096 {
5097 case EXEC_OACC_PARALLEL_LOOP:
5098 case EXEC_OACC_KERNELS_LOOP:
5099 return gfc_trans_oacc_combined_directive (code);
5100 case EXEC_OACC_PARALLEL:
5101 case EXEC_OACC_KERNELS:
5102 case EXEC_OACC_DATA:
5103 case EXEC_OACC_HOST_DATA:
5104 return gfc_trans_oacc_construct (code);
5105 case EXEC_OACC_LOOP:
5106 return gfc_trans_omp_do (code, code->op, NULL, code->ext.omp_clauses,
5107 NULL);
5108 case EXEC_OACC_UPDATE:
5109 case EXEC_OACC_CACHE:
5110 case EXEC_OACC_ENTER_DATA:
5111 case EXEC_OACC_EXIT_DATA:
5112 return gfc_trans_oacc_executable_directive (code);
5113 case EXEC_OACC_WAIT:
5114 return gfc_trans_oacc_wait_directive (code);
5115 case EXEC_OACC_ATOMIC:
5116 return gfc_trans_omp_atomic (code);
5117 case EXEC_OACC_DECLARE:
5118 return gfc_trans_oacc_declare (code);
5119 default:
5120 gcc_unreachable ();
5121 }
5122 }
5123
5124 tree
5125 gfc_trans_omp_directive (gfc_code *code)
5126 {
5127 switch (code->op)
5128 {
5129 case EXEC_OMP_ATOMIC:
5130 return gfc_trans_omp_atomic (code);
5131 case EXEC_OMP_BARRIER:
5132 return gfc_trans_omp_barrier ();
5133 case EXEC_OMP_CANCEL:
5134 return gfc_trans_omp_cancel (code);
5135 case EXEC_OMP_CANCELLATION_POINT:
5136 return gfc_trans_omp_cancellation_point (code);
5137 case EXEC_OMP_CRITICAL:
5138 return gfc_trans_omp_critical (code);
5139 case EXEC_OMP_DISTRIBUTE:
5140 case EXEC_OMP_DO:
5141 case EXEC_OMP_SIMD:
5142 case EXEC_OMP_TASKLOOP:
5143 return gfc_trans_omp_do (code, code->op, NULL, code->ext.omp_clauses,
5144 NULL);
5145 case EXEC_OMP_DISTRIBUTE_PARALLEL_DO:
5146 case EXEC_OMP_DISTRIBUTE_PARALLEL_DO_SIMD:
5147 case EXEC_OMP_DISTRIBUTE_SIMD:
5148 return gfc_trans_omp_distribute (code, NULL);
5149 case EXEC_OMP_DO_SIMD:
5150 return gfc_trans_omp_do_simd (code, NULL, NULL, NULL_TREE);
5151 case EXEC_OMP_FLUSH:
5152 return gfc_trans_omp_flush ();
5153 case EXEC_OMP_MASTER:
5154 return gfc_trans_omp_master (code);
5155 case EXEC_OMP_ORDERED:
5156 return gfc_trans_omp_ordered (code);
5157 case EXEC_OMP_PARALLEL:
5158 return gfc_trans_omp_parallel (code);
5159 case EXEC_OMP_PARALLEL_DO:
5160 return gfc_trans_omp_parallel_do (code, NULL, NULL);
5161 case EXEC_OMP_PARALLEL_DO_SIMD:
5162 return gfc_trans_omp_parallel_do_simd (code, NULL, NULL);
5163 case EXEC_OMP_PARALLEL_SECTIONS:
5164 return gfc_trans_omp_parallel_sections (code);
5165 case EXEC_OMP_PARALLEL_WORKSHARE:
5166 return gfc_trans_omp_parallel_workshare (code);
5167 case EXEC_OMP_SECTIONS:
5168 return gfc_trans_omp_sections (code, code->ext.omp_clauses);
5169 case EXEC_OMP_SINGLE:
5170 return gfc_trans_omp_single (code, code->ext.omp_clauses);
5171 case EXEC_OMP_TARGET:
5172 case EXEC_OMP_TARGET_PARALLEL:
5173 case EXEC_OMP_TARGET_PARALLEL_DO:
5174 case EXEC_OMP_TARGET_PARALLEL_DO_SIMD:
5175 case EXEC_OMP_TARGET_SIMD:
5176 case EXEC_OMP_TARGET_TEAMS:
5177 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE:
5178 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE_PARALLEL_DO:
5179 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE_PARALLEL_DO_SIMD:
5180 case EXEC_OMP_TARGET_TEAMS_DISTRIBUTE_SIMD:
5181 return gfc_trans_omp_target (code);
5182 case EXEC_OMP_TARGET_DATA:
5183 return gfc_trans_omp_target_data (code);
5184 case EXEC_OMP_TARGET_ENTER_DATA:
5185 return gfc_trans_omp_target_enter_data (code);
5186 case EXEC_OMP_TARGET_EXIT_DATA:
5187 return gfc_trans_omp_target_exit_data (code);
5188 case EXEC_OMP_TARGET_UPDATE:
5189 return gfc_trans_omp_target_update (code);
5190 case EXEC_OMP_TASK:
5191 return gfc_trans_omp_task (code);
5192 case EXEC_OMP_TASKGROUP:
5193 return gfc_trans_omp_taskgroup (code);
5194 case EXEC_OMP_TASKLOOP_SIMD:
5195 return gfc_trans_omp_taskloop (code);
5196 case EXEC_OMP_TASKWAIT:
5197 return gfc_trans_omp_taskwait ();
5198 case EXEC_OMP_TASKYIELD:
5199 return gfc_trans_omp_taskyield ();
5200 case EXEC_OMP_TEAMS:
5201 case EXEC_OMP_TEAMS_DISTRIBUTE:
5202 case EXEC_OMP_TEAMS_DISTRIBUTE_PARALLEL_DO:
5203 case EXEC_OMP_TEAMS_DISTRIBUTE_PARALLEL_DO_SIMD:
5204 case EXEC_OMP_TEAMS_DISTRIBUTE_SIMD:
5205 return gfc_trans_omp_teams (code, NULL, NULL_TREE);
5206 case EXEC_OMP_WORKSHARE:
5207 return gfc_trans_omp_workshare (code, code->ext.omp_clauses);
5208 default:
5209 gcc_unreachable ();
5210 }
5211 }
5212
5213 void
5214 gfc_trans_omp_declare_simd (gfc_namespace *ns)
5215 {
5216 if (ns->entries)
5217 return;
5218
5219 gfc_omp_declare_simd *ods;
5220 for (ods = ns->omp_declare_simd; ods; ods = ods->next)
5221 {
5222 tree c = gfc_trans_omp_clauses (NULL, ods->clauses, ods->where, true);
5223 tree fndecl = ns->proc_name->backend_decl;
5224 if (c != NULL_TREE)
5225 c = tree_cons (NULL_TREE, c, NULL_TREE);
5226 c = build_tree_list (get_identifier ("omp declare simd"), c);
5227 TREE_CHAIN (c) = DECL_ATTRIBUTES (fndecl);
5228 DECL_ATTRIBUTES (fndecl) = c;
5229 }
5230 }
Mirror of the offical gcc git repository hosted at gcc.gnu.org