1 /* Test that all loop iterations are touched. This doesn't verify
2 scheduling order, merely coverage. */
3 /* Note that we never call GOMP_ordered_start in here. AFAICS, this is
4 valid; the only requirement is "not more than once per iteration". */
6 /* { dg-require-effective-target sync_int_long } */
11 #include "libgomp_g.h"
15 static int S, E, INCR, CHUNK, NTHR;
18 static void clean_data (void)
20 memset (data, -1, sizeof (data));
23 static void test_data (void)
27 for (i = 0; i < S; ++i)
28 assert (data[i] == -1);
30 for (j = 0; i < E; ++i, j = (j + 1) % INCR)
32 assert (data[i] != -1);
34 assert (data[i] == -1);
37 assert (data[i] == -1);
40 static void set_data (long i, int val)
43 assert (i >= 0 && i < N);
44 old = __sync_lock_test_and_set (data+i, val);
49 #define TMPL_1(sched) \
50 static void f_##sched##_1 (void *dummy) \
52 int iam = omp_get_thread_num (); \
54 if (GOMP_loop_ordered_##sched##_start (S, E, INCR, CHUNK, &s0, &e0)) \
57 for (i = s0; i < e0; i += INCR) \
60 while (GOMP_loop_ordered_##sched##_next (&s0, &e0)); \
63 static void t_##sched##_1 (void) \
66 GOMP_parallel_start (f_##sched##_1, NULL, NTHR); \
67 f_##sched##_1 (NULL); \
68 GOMP_parallel_end (); \
76 static void test (void)
89 S = 0, E = N, INCR = 1, CHUNK = 4;
92 S = 0, E = N, INCR = 2, CHUNK = 4;
95 S = 1, E = N-1, INCR = 1, CHUNK = 5;
98 S = 1, E = N-1, INCR = 2, CHUNK = 5;
101 S = 2, E = 4, INCR = 1, CHUNK = 1;
104 S = 0, E = N, INCR = 1, CHUNK = 0;
107 S = 1, E = N-1, INCR = 1, CHUNK = 0;
111 S = 1, E = 9, INCR = 1, CHUNK = 0;