1 /* { dg-do compile } */
2 /* { dg-options "-O2 -fopenmp -fdump-tree-optimized" } */
3 /* { dg-final { scan-tree-dump-times "__builtin_GOMP_loop_doacross_start \[^\n\r]*, (?:2147483651|-2147483645), 1, " 1 "optimized" } } */
4 /* { dg-final { scan-tree-dump-times "__builtin_GOMP_loop_end " 1 "optimized" } } */
5 /* { dg-final { scan-tree-dump-times "__builtin_GOMP_doacross_post " 1 "optimized" } } */
6 /* { dg-final { scan-tree-dump-times "__builtin_GOMP_doacross_wait " 1 "optimized" } } */
7 /* { dg-final { scan-tree-dump-times "__builtin_GOMP_loop_guided_next " 1 "optimized" } } */
8 /* { dg-final { scan-tree-dump-times "__builtin_GOMP_workshare_task_reduction_unregister \\(0\\)" 1 "optimized" } } */
9 /* { dg-final { scan-tree-dump-times "__builtin_GOMP_parallel " 1 "optimized" } } */
15 foo (int a
, int b
, int c
)
19 #pragma omp for ordered(1) reduction (task, *: j) schedule (guided)
20 for (i
= a
; i
< b
; i
+= c
)
23 #pragma omp ordered depend(sink: i - 1)
25 #pragma omp ordered depend(source)