1*404b540aSrobert /* Test that all loop iterations are touched. This doesn't verify
2*404b540aSrobert scheduling order, merely coverage. */
3*404b540aSrobert /* Note that we never call GOMP_ordered_start in here. AFAICS, this is
4*404b540aSrobert valid; the only requirement is "not more than once per iteration". */
5*404b540aSrobert
6*404b540aSrobert /* { dg-require-effective-target sync_int_long } */
7*404b540aSrobert
8*404b540aSrobert #include <omp.h>
9*404b540aSrobert #include <string.h>
10*404b540aSrobert #include <assert.h>
11*404b540aSrobert #include "libgomp_g.h"
12*404b540aSrobert
13*404b540aSrobert
14*404b540aSrobert #define N 1000
15*404b540aSrobert static int S, E, INCR, CHUNK, NTHR;
16*404b540aSrobert static int data[N];
17*404b540aSrobert
clean_data(void)18*404b540aSrobert static void clean_data (void)
19*404b540aSrobert {
20*404b540aSrobert memset (data, -1, sizeof (data));
21*404b540aSrobert }
22*404b540aSrobert
test_data(void)23*404b540aSrobert static void test_data (void)
24*404b540aSrobert {
25*404b540aSrobert int i, j;
26*404b540aSrobert
27*404b540aSrobert for (i = 0; i < S; ++i)
28*404b540aSrobert assert (data[i] == -1);
29*404b540aSrobert
30*404b540aSrobert for (j = 0; i < E; ++i, j = (j + 1) % INCR)
31*404b540aSrobert if (j == 0)
32*404b540aSrobert assert (data[i] != -1);
33*404b540aSrobert else
34*404b540aSrobert assert (data[i] == -1);
35*404b540aSrobert
36*404b540aSrobert for (; i < N; ++i)
37*404b540aSrobert assert (data[i] == -1);
38*404b540aSrobert }
39*404b540aSrobert
set_data(long i,int val)40*404b540aSrobert static void set_data (long i, int val)
41*404b540aSrobert {
42*404b540aSrobert int old;
43*404b540aSrobert assert (i >= 0 && i < N);
44*404b540aSrobert old = __sync_lock_test_and_set (data+i, val);
45*404b540aSrobert assert (old == -1);
46*404b540aSrobert }
47*404b540aSrobert
48*404b540aSrobert
49*404b540aSrobert #define TMPL_1(sched) \
50*404b540aSrobert static void f_##sched##_1 (void *dummy) \
51*404b540aSrobert { \
52*404b540aSrobert int iam = omp_get_thread_num (); \
53*404b540aSrobert long s0, e0, i; \
54*404b540aSrobert if (GOMP_loop_ordered_##sched##_start (S, E, INCR, CHUNK, &s0, &e0)) \
55*404b540aSrobert do \
56*404b540aSrobert { \
57*404b540aSrobert for (i = s0; i < e0; i += INCR) \
58*404b540aSrobert set_data (i, iam); \
59*404b540aSrobert } \
60*404b540aSrobert while (GOMP_loop_ordered_##sched##_next (&s0, &e0)); \
61*404b540aSrobert GOMP_loop_end (); \
62*404b540aSrobert } \
63*404b540aSrobert static void t_##sched##_1 (void) \
64*404b540aSrobert { \
65*404b540aSrobert clean_data (); \
66*404b540aSrobert GOMP_parallel_start (f_##sched##_1, NULL, NTHR); \
67*404b540aSrobert f_##sched##_1 (NULL); \
68*404b540aSrobert GOMP_parallel_end (); \
69*404b540aSrobert test_data (); \
70*404b540aSrobert }
71*404b540aSrobert
72*404b540aSrobert TMPL_1(static)
TMPL_1(dynamic)73*404b540aSrobert TMPL_1(dynamic)
74*404b540aSrobert TMPL_1(guided)
75*404b540aSrobert
76*404b540aSrobert static void test (void)
77*404b540aSrobert {
78*404b540aSrobert t_static_1 ();
79*404b540aSrobert t_dynamic_1 ();
80*404b540aSrobert t_guided_1 ();
81*404b540aSrobert }
82*404b540aSrobert
main()83*404b540aSrobert int main()
84*404b540aSrobert {
85*404b540aSrobert omp_set_dynamic (0);
86*404b540aSrobert
87*404b540aSrobert NTHR = 4;
88*404b540aSrobert
89*404b540aSrobert S = 0, E = N, INCR = 1, CHUNK = 4;
90*404b540aSrobert test ();
91*404b540aSrobert
92*404b540aSrobert S = 0, E = N, INCR = 2, CHUNK = 4;
93*404b540aSrobert test ();
94*404b540aSrobert
95*404b540aSrobert S = 1, E = N-1, INCR = 1, CHUNK = 5;
96*404b540aSrobert test ();
97*404b540aSrobert
98*404b540aSrobert S = 1, E = N-1, INCR = 2, CHUNK = 5;
99*404b540aSrobert test ();
100*404b540aSrobert
101*404b540aSrobert S = 2, E = 4, INCR = 1, CHUNK = 1;
102*404b540aSrobert test ();
103*404b540aSrobert
104*404b540aSrobert S = 0, E = N, INCR = 1, CHUNK = 0;
105*404b540aSrobert t_static_1 ();
106*404b540aSrobert
107*404b540aSrobert S = 1, E = N-1, INCR = 1, CHUNK = 0;
108*404b540aSrobert t_static_1 ();
109*404b540aSrobert
110*404b540aSrobert NTHR = 10;
111*404b540aSrobert S = 1, E = 9, INCR = 1, CHUNK = 0;
112*404b540aSrobert t_static_1 ();
113*404b540aSrobert
114*404b540aSrobert return 0;
115*404b540aSrobert }
116