filename
stringlengths 78
241
| omp_pragma_line
stringlengths 24
416
| context_chars
int64 100
100
| text
stringlengths 152
177k
|
|---|---|---|---|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr81154.C
|
#pragma omp parallel for lastprivate (foo)
| 100
|
}
;
#pragma omp parallel firstprivate (foo) // { dg-error "is not a variable in clause" }
;
<LOOP-START>for (T i = 0; i < n; i++)
;
#pragma omp parallel for linear (foo) // { dg-error "is not a variable in clause" }<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (foo) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr81154.C
|
#pragma omp parallel for linear (foo)
| 100
|
stprivate (foo) // { dg-error "is not a variable in clause" }
for (T i = 0; i < n; i++)
;
<LOOP-START>for (T i = 0; i < n; i++)
;
#pragma omp parallel reduction (+:foo) // { dg-error "is not a variable in clause" }<LOOP-END> <OMP-START>#pragma omp parallel for linear (foo) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/tpl-for-3.C
|
#pragma omp parallel for
| 100
|
// { dg-do compile }
void foo(int);
template<typename T> void bar()
{
<LOOP-START>for (typename T::T i = 0; i < T::N; ++i)
foo(i);
}
struct A
{
typedef int T;
static T N;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr29965-5.C
|
#pragma omp parallel for schedule (static)
| 100
|
ragma omp for schedule (static)
for (i = 0; i < 2834; i++)
baz ();
}
void
foo2 ()
{
int i;
<LOOP-START>for (i = 0; i < 2834; i++)
for (;;)
;
}
void
bar2 ()
{
int i;
#pragma omp parallel for schedule (static)
for (i = 0; i < 2834; i++)
baz ();
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule (static)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/sink-1.C
|
#pragma omp parallel for ordered(2)
| 100
|
/* { dg-do compile } */
void bar (int, int, int);
template<typename T>
void baz ()
{
T i, j;
<LOOP-START>for (i=0; i < 100; ++i)
for (j=0; j < 100; ++j)
{
#pragma omp ordered depend(sink:i-3,j)
bar (i, j, 0);
#pragma omp ordered depend(source)
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered(2)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr38639.C
|
#pragma omp parallel for
| 100
|
639
// { dg-do compile { target c++11 } }
// { dg-options "-fopenmp" }
template<int> void
foo ()
{
<LOOP-START>for (auto i = i = 0; i<4; ++i) // { dg-error "initializer expression refers to iteration variable" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr58567.C
|
#pragma omp parallel for
| 100
|
* { dg-do compile } */
/* PR c++/58567 - was ICEing before */
template<typename T> void foo()
{
<LOOP-START>for (typename T::X i = 0; i < 100; ++i) /* { dg-error "'int' is not a class, struct, or union type|expected iteration declaration or initialization" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr66571-2.C
|
#pragma omp parallel for simd private (a) firstprivate (b) lastprivate (c) linear (d:2)
| 100
|
<typename T>
extern void bar (T, T, T, T);
template <typename T>
void
foo (T a, T b, T c, T d)
{
<LOOP-START>for (int i = 0; i < 10; i++)
bar<T> (a, b, c, d), d += 2;
#pragma omp parallel private (c)
#pragma omp single copyprivate (c)
bar<T> (a, b, c, d);
T e = a;
T f = b;
T g = c;
T h = d;
#pragma omp parallel for simd private (e) firstprivate (f) lastprivate (g) linear (h:2)
for (int i = 0; i < 10; i++)
bar<T> (e, f, g, h), h += 2;
#pragma omp parallel private (g)
#pragma omp single copyprivate (g)
bar<T> (e, f, g, h);
}
void
baz ()
{
int a = 0, b = 0, c = 0, d = 0;
foo <int> (a, b, c, d);
foo <int &> (a, b, c, d);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd private (a) firstprivate (b) lastprivate (c) linear (d:2)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr66571-2.C
|
#pragma omp parallel for simd private (e) firstprivate (f) lastprivate (g) linear (h:2)
| 100
|
omp single copyprivate (c)
bar<T> (a, b, c, d);
T e = a;
T f = b;
T g = c;
T h = d;
<LOOP-START>for (int i = 0; i < 10; i++)
bar<T> (e, f, g, h), h += 2;
#pragma omp parallel private (g)
#pragma omp single copyprivate (g)
bar<T> (e, f, g, h);
}
void
baz ()
{
int a = 0, b = 0, c = 0, d = 0;
foo <int> (a, b, c, d);
foo <int &> (a, b, c, d);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd private (e) firstprivate (f) lastprivate (g) linear (h:2)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr35158.C
|
#pragma omp parallel for
| 100
|
PR c++/35158
// { dg-do compile }
// { dg-options "-fopenmp" }
int main(int argc, char *argv[])
{
<LOOP-START>for (int i(0) ; // { dg-error "parenthesized initialization is not allowed in OpenMP 'for' loop" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/this-1.C
|
#pragma omp parallel for lastprivate (this)
| 100
|
rstprivate (this) // { dg-error ".this. allowed in OpenMP only in .declare simd. clauses" }
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp parallel shared (this) // { dg-error ".this. allowed in OpenMP only in .declare simd. clauses" }<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (this) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/this-1.C
|
#pragma omp parallel for lastprivate (this)
| 100
|
rstprivate (this) // { dg-error ".this. allowed in OpenMP only in .declare simd. clauses" }
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp parallel shared (this) // { dg-error ".this. allowed in OpenMP only in .declare simd. clauses" }<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (this) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/linear-2.C
|
#pragma omp parallel for linear (i:1) collapse(1)
| 100
|
lid for .#pragma omp distribute parallel for." }
for (i = 0; i < 32; i++)
;
}
void
f3 ()
{
<LOOP-START>for (i = 0; i < 32; i++) // { dg-error "iteration variable .i. should not be linear" }<LOOP-END> <OMP-START>#pragma omp parallel for linear (i:1) collapse(1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/linear-2.C
|
#pragma omp parallel for linear (i:1) collapse(2) linear (j:2)
| 100
|
parallel for." }
for (i = 0; i < 32; i++)
for (j = 0; j < 32; j+=2)
;
}
void
f6 ()
{
<LOOP-START>for (i = 0; i < 32; i++) // { dg-error "iteration variable .j. should not be linear" }<LOOP-END> <OMP-START>#pragma omp parallel for linear (i:1) collapse(2) linear (j:2) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/linear-2.C
|
#pragma omp parallel for linear (i:1) collapse(1)
| 100
|
omp distribute parallel for." }
for (i = 0; i < 32; i++)
;
}
template <int N>
void
f9 ()
{
<LOOP-START>for (i = 0; i < 32; i++) // { dg-error "iteration variable .i. should not be linear" }<LOOP-END> <OMP-START>#pragma omp parallel for linear (i:1) collapse(1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/linear-2.C
|
#pragma omp parallel for linear (i:1) collapse(2) linear (j:2)
| 100
|
for (i = 0; i < 32; i++)
for (j = 0; j < 32; j+=2)
;
}
template <int N>
void
f12 ()
{
<LOOP-START>for (i = 0; i < 32; i++) // { dg-error "iteration variable .j. should not be linear" }<LOOP-END> <OMP-START>#pragma omp parallel for linear (i:1) collapse(2) linear (j:2) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr31769.C
|
#pragma omp parallel for
| 100
|
);
void foo (int);
E f;
};
int
main ()
{
try
{
F f (10);
F g (10);
C h (0, 9);
<LOOP-START>for (int i = 0; i < 2; ++i)
g += f (h);
}
catch (int &e)
{
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr30558.C
|
#pragma omp parallel for
| 100
|
bar (2); }
F<int> &operator () (F<int> x);
void bar (int);
};
int
main ()
{
try
{
G g;
<LOOP-START>for (int i = 0; i < 10; ++i)
{
F<int> j (i);
F<int> f = g (j);
F<int> h = foo (f);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr79664.C
|
#pragma omp parallel for
| 100
|
64
// { dg-do compile }
// { dg-options "-std=c++14 -fopenmp" }
constexpr int
f1 ()
{
int i = 0;
<LOOP-START>for (i = 0; i < 10; ++i)
;
return 0;
}
constexpr int
f2 ()
{
int i = 0;
#pragma omp parallel // { dg-error "is not a constant expression" }
i = 5;
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/block-0.C
|
#pragma omp parallel for
| 100
|
i < 10; ++i)
bar ();
#pragma omp sections
{ bar(); }
#pragma omp parallel
bar ();
<LOOP-START>for (int i = 0; i < 10; ++i)
bar ();
#pragma omp parallel sections
{
{
bar ();
bar ();
}
#pragma omp section
bar ();
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr51360.C
|
#pragma omp parallel for num_threads (m) if (n) schedule (static, o)
| 100
|
T d)
{
T m, n, o, p, i;
m = 6;
n = 1;
o = 5;
p = 1;
a = 6;
b = 1;
c = 5;
d = 1;
<LOOP-START>for (i = 0; i < 10; i++)
;
#pragma omp parallel for num_threads (a) if (b) schedule (static, c)
for (i = 0; i < 10; i++)
;
#pragma omp task final (p)
;
#pragma omp task final (d)
;
}
void
bar ()
{
foo (0, 0, 0, 0);
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (m) if (n) schedule (static, o)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr51360.C
|
#pragma omp parallel for num_threads (a) if (b) schedule (static, c)
| 100
|
gma omp parallel for num_threads (m) if (n) schedule (static, o)
for (i = 0; i < 10; i++)
;
<LOOP-START>for (i = 0; i < 10; i++)
;
#pragma omp task final (p)
;
#pragma omp task final (d)
;
}
void
bar ()
{
foo (0, 0, 0, 0);
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (a) if (b) schedule (static, c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr33372-1.C
|
#pragma omp parallel for schedule(static, n)
| 100
|
#pragma omp parallel num_threads(n) // { dg-error "'num_threads' expression must be integral" }
;
<LOOP-START>for (int i = 0; i < 10; i++) // { dg-error "chunk size expression must be integral" }<LOOP-END> <OMP-START>#pragma omp parallel for schedule(static, n)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr67523.C
|
#pragma omp parallel for simd
| 100
|
omp for simd
for (T i = x; i < y; i++) // { dg-error "used with class iteration variable" }
;
<LOOP-START>for (T i = x; i < y; i++) // { dg-error "used with class iteration variable" }<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/sink-2.C
|
#pragma omp parallel for ordered(1)
| 100
|
:vector<int> v;
for (int i=1; i<=5; i++) v.push_back(i);
std::vector<int>::const_iterator it;
<LOOP-START>for (it = v.begin(); it < v.end(); ++it)
{
#pragma omp ordered depend(sink:it-1)
std::cout << *it << '\n';
#pragma omp ordered depend(source)
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered(1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/sink-2.C
|
#pragma omp parallel for ordered(1)
| 100
|
::vector<int> v;
for (int i=1; i<=5; i++) v.push_back(i);
std::vector<int>::const_iterator it;
<LOOP-START>for (it = v.begin(); it < v.end(); ++it)
{
#pragma omp ordered depend(sink:it-1)
std::cout << *it << '\n';
#pragma omp ordered depend(source)
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered(1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/sink-2.C
|
#pragma omp parallel for ordered(1)
| 100
|
tor<T> v;
for (int i=1; i<=5; i++) v.push_back(i);
typename std::vector<T>::const_iterator it;
<LOOP-START>for (it = v.begin(); it < v.end(); ++it)
{
#pragma omp ordered depend(sink:it-1)
std::cout << *it << '\n';
#pragma omp ordered depend(source)
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered(1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr48632.C
|
#pragma omp parallel for
| 100
|
do compile }
// { dg-options "-fopenmp" }
template<typename T>
void
foo (T *x, T *y, unsigned z)
{
<LOOP-START>for (T *p = x; p < y; p += z)
;
#pragma omp parallel for
for (T *p = y; p > x; p -= z)
;
}
int
main ()
{
char buf[10];
foo (&buf[0], &buf[9], 1);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr48632.C
|
#pragma omp parallel for
| 100
|
void
foo (T *x, T *y, unsigned z)
{
#pragma omp parallel for
for (T *p = x; p < y; p += z)
;
<LOOP-START>for (T *p = y; p > x; p -= z)
;
}
int
main ()
{
char buf[10];
foo (&buf[0], &buf[9], 1);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr32177.C
|
#pragma omp parallel for
| 100
|
sophia.inria.fr>
struct A
{
A () {}
~A () {}
int s () const { return 1; }
};
void
f1 ()
{
<LOOP-START>for (int i = 1; i <= A ().s (); ++i)
;
}
void
f2 ()
{
#pragma omp parallel for
for (int i = A ().s (); i <= 20; ++i)
;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr32177.C
|
#pragma omp parallel for
| 100
|
()
{
#pragma omp parallel for
for (int i = 1; i <= A ().s (); ++i)
;
}
void
f2 ()
{
<LOOP-START>for (int i = A ().s (); i <= 20; ++i)
;
}
void
f3 ()
{
#pragma omp parallel for
for (int i = 1; i <= 20; i += A ().s ())
;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr32177.C
|
#pragma omp parallel for
| 100
|
()
{
#pragma omp parallel for
for (int i = A ().s (); i <= 20; ++i)
;
}
void
f3 ()
{
<LOOP-START>for (int i = 1; i <= 20; i += A ().s ())
;
}
void
f4 ()
{
int i;
#pragma omp parallel for
for (i = A ().s (); i <= 20; i++)
;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr33333.C
|
#pragma omp parallel for
| 100
|
d/33333
// { dg-do compile }
struct A
{
int n;
void foo ();
};
void
A::foo ()
{
try
{
<LOOP-START>for (int i = 0; i < n; ++i)
;
} catch (...) {}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/block-11.C
|
#pragma omp parallel for
| 100
|
/* PR c++/24516 */
/* { dg-do compile } */
void
bar (int *p)
{
int m;
<LOOP-START>for (m = 0; m < 1000; ++m)
switch (p[m])
{
case 1:
p[m] = 2;
break;
default:
p[m] = 3;
break;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr37533.C
|
#pragma omp parallel for
| 100
|
// PR c++/37533
// { dg-do compile }
// { dg-options "-fopenmp" }
template<int>
void
f1 ()
{
<LOOP-START>for (int i = ""; i < 4; ++i) // { dg-error "invalid conversion from" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr37533.C
|
#pragma omp parallel for
| 100
|
i < 4; ++i) // { dg-error "invalid conversion from" }
;
}
template<int>
void
f2 ()
{
int i;
<LOOP-START>for (i = ""; i < 4; ++i) // { dg-error "invalid conversion from" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr37533.C
|
#pragma omp parallel for
| 100
|
"; i < 4; ++i) // { dg-error "invalid conversion from" }
;
}
template<typename T>
void
f3 ()
{
<LOOP-START>for (T i = ""; i < 4; ++i) // { dg-error "invalid conversion from" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr37533.C
|
#pragma omp parallel for
| 100
|
4; ++i) // { dg-error "invalid conversion from" }
;
}
template<typename T>
void
f4 ()
{
T i;
<LOOP-START>for (i = ""; i < 4; ++i) // { dg-error "invalid conversion from" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/for-13.C
|
#pragma omp parallel for default(none)
| 100
|
}
// { dg-options "-fopenmp -fdump-tree-lower" }
extern void bar(int);
void foo(void)
{
int i;
<LOOP-START>for (i = 0; i < 10; i++)
bar(i);
}
// { dg-final { scan-tree-dump-times "omp_data_o" 0 "lower" } }<LOOP-END> <OMP-START>#pragma omp parallel for default(none)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr66571-1.C
|
#pragma omp parallel for simd shared (a, c) reduction (+:b)
| 100
|
ename U>
extern void bar (T, T, U);
template <typename T, typename U>
void
foo (T a, T b, U c)
{
<LOOP-START>for (int i = 0; i < 10; i++)
bar<T> (a, b, c);
#pragma omp target map(tofrom:a, c[0:5])
;
#pragma omp task depend(inout:c[4:2])
;
T d = a;
T e = b;
U f = c;
#pragma omp parallel for simd shared (d, f) reduction (+:e)
for (int i = 0; i < 10; i++)
bar<T> (d, e, f);
#pragma omp target map(tofrom:d, f[0:5])
;
#pragma omp task depend(inout:f[4:2])
;
}
void
baz ()
{
int a = 0, b = 0, cb[10] = {}, *c = cb;
foo <int, int *> (a, b, c);
foo <int &, int *&> (a, b, c);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd shared (a, c) reduction (+:b)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr66571-1.C
|
#pragma omp parallel for simd shared (d, f) reduction (+:e)
| 100
|
m:a, c[0:5])
;
#pragma omp task depend(inout:c[4:2])
;
T d = a;
T e = b;
U f = c;
<LOOP-START>for (int i = 0; i < 10; i++)
bar<T> (d, e, f);
#pragma omp target map(tofrom:d, f[0:5])
;
#pragma omp task depend(inout:f[4:2])
;
}
void
baz ()
{
int a = 0, b = 0, cb[10] = {}, *c = cb;
foo <int, int *> (a, b, c);
foo <int &, int *&> (a, b, c);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd shared (d, f) reduction (+:e)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/for-20.C
|
#pragma omp parallel for
| 100
|
do compile }
// { dg-options -fopenmp }
int foo() { return 0; }
template<typename T> void bar()
{
<LOOP-START>for (T i = foo(); i < 8; ++i) {}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for lastprivate (a, b, c, e, f, g)
| 100
|
lel private (a, b, c, e, f, g)
;
#pragma omp parallel firstprivate (a, b, c, e, f, g)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp simd linear (a, b, c : 1)
for (int i = 0; i < 10; i++)
{
a++;
b++;
c++;
}<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (a, b, c, e, f, g)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for reduction (+:a, b, c, e, f)
| 100
|
omp simd linear (a, b, c : 1)
for (int i = 0; i < 10; i++)
{
a++;
b++;
c++;
}
<LOOP-START>for (int i = 0; i < 10; i++)
;
return 0;
}
int
B::m2 ()
{
#pragma omp parallel private (h) // { dg-error "is predetermined .shared. for .private." }
;
#pragma omp parallel firstprivate (h)
;
#pragma omp parallel for lastprivate (h) // { dg-error "is predetermined .shared. for .lastprivate." }
for (int i = 0; i < 10; i++)
;
#pragma omp simd linear (h : 1) // { dg-error "is predetermined .shared. for .linear." }
for (int i = 0; i < 10; i++)
;
#pragma omp parallel for reduction (+:h) // { dg-error "is predetermined .shared. for .reduction." }
for (int i = 0; i < 10; i++)
;
#pragma omp parallel for reduction (+:g) // { dg-error "has const type for .reduction." }
for (int i = 0; i < 10; i++)
;
#pragma omp parallel shared (a)
;
#pragma omp parallel shared (b)
;
#pragma omp parallel shared (c)
;
#pragma omp parallel shared (e)
;
#pragma omp parallel shared (f)
;
#pragma omp parallel shared (g)
;
#pragma omp parallel shared (h) // { dg-error "is predetermined .shared. for .shared." }
;
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:a, b, c, e, f)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for lastprivate (h)
| 100
|
r "is predetermined .shared. for .private." }
;
#pragma omp parallel firstprivate (h)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp simd linear (h : 1) // { dg-error "is predetermined .shared. for .linear." }<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (h) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for reduction (+:h)
| 100
|
// { dg-error "is predetermined .shared. for .linear." }
for (int i = 0; i < 10; i++)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp parallel for reduction (+:g) // { dg-error "has const type for .reduction." }<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:h) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for reduction (+:g)
| 100
|
{ dg-error "is predetermined .shared. for .reduction." }
for (int i = 0; i < 10; i++)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp parallel shared (a)
;
#pragma omp parallel shared (b)
;
#pragma omp parallel shared (c)
;
#pragma omp parallel shared (e)
;
#pragma omp parallel shared (f)
;
#pragma omp parallel shared (g)
;
#pragma omp parallel shared (h) // { dg-error "is predetermined .shared. for .shared." }<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:g) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for lastprivate (b, c, e, f, g)
| 100
|
parallel private (b, c, e, f, g)
;
#pragma omp parallel firstprivate (b, c, e, f, g)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp simd linear (b, c : 1)
for (int i = 0; i < 10; i++)
{
b++;
c++;
}<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (b, c, e, f, g)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for reduction (+:b, c, f)
| 100
|
#pragma omp simd linear (b, c : 1)
for (int i = 0; i < 10; i++)
{
b++;
c++;
}
<LOOP-START>for (int i = 0; i < 10; i++)
;
return 0;
}
int
B::m4 () const
{
#pragma omp parallel private (a) // { dg-error "is predetermined .shared. for .private." }
;
#pragma omp parallel firstprivate (a)
;
#pragma omp parallel for lastprivate (a) // { dg-error "is predetermined .shared. for .lastprivate." }
for (int i = 0; i < 10; i++)
;
#pragma omp simd linear (a : 1) // { dg-error "is predetermined .shared. for .linear." }
for (int i = 0; i < 10; i++)
;
#pragma omp parallel for reduction (+:a) // { dg-error "is predetermined .shared. for .reduction." }
for (int i = 0; i < 10; i++)
;
#pragma omp parallel private (h) // { dg-error "is predetermined .shared. for .private." }
;
#pragma omp parallel firstprivate (h)
;
#pragma omp parallel for lastprivate (h) // { dg-error "is predetermined .shared. for .lastprivate." }
for (int i = 0; i < 10; i++)
;
#pragma omp simd linear (h : 1) // { dg-error "is predetermined .shared. for .linear." }
for (int i = 0; i < 10; i++)
;
#pragma omp parallel for reduction (+:h) // { dg-error "is predetermined .shared. for .reduction." }
for (int i = 0; i < 10; i++)
;
#pragma omp parallel for reduction (+:e) // { dg-error "has const type for .reduction." }
for (int i = 0; i < 10; i++)
;
#pragma omp parallel for reduction (+:g) // { dg-error "has const type for .reduction." }
for (int i = 0; i < 10; i++)
;
#pragma omp parallel shared (a) // { dg-error "is predetermined .shared. for .shared." }
;
#pragma omp parallel shared (b)
;
#pragma omp parallel shared (c)
;
#pragma omp parallel shared (e)
;
#pragma omp parallel shared (f)
;
#pragma omp parallel shared (g)
;
#pragma omp parallel shared (h) // { dg-error "is predetermined .shared. for .shared." }
;
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:b, c, f)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for lastprivate (a)
| 100
|
r "is predetermined .shared. for .private." }
;
#pragma omp parallel firstprivate (a)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp simd linear (a : 1) // { dg-error "is predetermined .shared. for .linear." }<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (a) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for reduction (+:a)
| 100
|
// { dg-error "is predetermined .shared. for .linear." }
for (int i = 0; i < 10; i++)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp parallel private (h) // { dg-error "is predetermined .shared. for .private." }<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:a) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for lastprivate (h)
| 100
|
r "is predetermined .shared. for .private." }
;
#pragma omp parallel firstprivate (h)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp simd linear (h : 1) // { dg-error "is predetermined .shared. for .linear." }<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (h) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for reduction (+:h)
| 100
|
// { dg-error "is predetermined .shared. for .linear." }
for (int i = 0; i < 10; i++)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp parallel for reduction (+:e) // { dg-error "has const type for .reduction." }<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:h) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for reduction (+:e)
| 100
|
{ dg-error "is predetermined .shared. for .reduction." }
for (int i = 0; i < 10; i++)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp parallel for reduction (+:g) // { dg-error "has const type for .reduction." }<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:e) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/member-2.C
|
#pragma omp parallel for reduction (+:g)
| 100
|
n (+:e) // { dg-error "has const type for .reduction." }
for (int i = 0; i < 10; i++)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
#pragma omp parallel shared (a) // { dg-error "is predetermined .shared. for .shared." }<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:g) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/sharing-1.C
|
#pragma omp parallel for \
| 100
|
static int locvar;
static int *p;
int i, j, s, l;
p = new int;
*p = 7;
s = 6;
l = 0;
<LOOP-START>default (none) private (p) shared (s)
for (i = 0; i < 64; i++)
{
int k = foo (0); /* Predetermined - private (automatic var declared */
k++; /* in scope of construct). */
thrglobalvar++; /* Predetermined - threadprivate. */
thrlocvar++; /* Predetermined - threadprivate. */
foo (i); /* Predetermined - private (omp for loop variable). */
foo (constvar.x); /* Predetermined - shared (const qualified type). */
foo (T::t.i); /* Predetermined - shared (static data member). */
foo (*p); /* *p predetermined - shared (heap allocated */
(*p)++; /* storage). */
bar (p); /* Explicitly determined - private. */
foo (s); /* Explicitly determined - shared. */
globalvar++; /* { dg-error "not specified in" } */
locvar++; /* { dg-error "not specified in" } */
l++; /* { dg-error "not specified in" } */
for (j = 0; j < 2; j++); /* { dg-error "not specified in" } */
baz (constmutvar);/* { dg-error "not specified in" } */
}<LOOP-END> <OMP-START>#pragma omp parallel for \<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr27415.C
|
#pragma omp parallel for firstprivate (i)
| 100
|
"should not be firstprivate" }
for (i = 0; i < 10; i++)
;
}
void
test2 (void)
{
int i = 0;
<LOOP-START>for (i = 0; i < 10; i++) // { dg-error "should not be firstprivate" }<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate (i)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr27415.C
|
#pragma omp parallel for reduction (*:i)
| 100
|
or "should not be reduction" }
for (i = 0; i < 10; i++)
;
}
void
test4 (void)
{
int i = 0;
<LOOP-START>for (i = 0; i < 10; i++) // { dg-error "should not be reduction" }<LOOP-END> <OMP-START>#pragma omp parallel for reduction (*:i)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/openmp-simd-2.C
|
#pragma omp parallel for simd num_threads(4) safelen(64)
| 100
|
!= s.s || u != s.s)
abort ();
return s.s;
}
void bar(int n, float *a, float *b)
{
int i;
<LOOP-START>for (i = 0; i < n ; i++)
a[i] = b[i];
}
/* { dg-final { scan-tree-dump-times "Function void omp declare reduction operator\\+" 1 "original" } }<LOOP-END> <OMP-START>#pragma omp parallel for simd num_threads(4) safelen(64)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr33372-2.C
|
#pragma omp parallel for schedule(static, n)
| 100
|
"-fopenmp" }
template <typename T>
void f ()
{
T n = 6;
#pragma omp parallel num_threads(n)
;
<LOOP-START>for (int i = 0; i < 10; i++)
;
}
void g ()
{
f<int> ();
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(static, n)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr35078.C
|
#pragma omp parallel for
| 100
|
// PR c++/35078
// { dg-do compile }
// { dg-options "-fopenmp" }
template<int> void
foo ()
{
<LOOP-START>for (int& i = 0; i < 10; ++i) // { dg-error "invalid type for iteration variable" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr35078.C
|
#pragma omp parallel for
| 100
|
10; ++i) // { dg-error "invalid type for iteration variable" }
;
}
void
bar ()
{
int j = 0;
<LOOP-START>for (int& i = j; i < 10; ++i) // { dg-error "invalid type for iteration variable" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr33372-3.C
|
#pragma omp parallel for schedule(static, n)
| 100
|
#pragma omp parallel num_threads(n) // { dg-error "'num_threads' expression must be integral" }
;
<LOOP-START>for (int i = 0; i < 10; i++) // { dg-error "chunk size expression must be integral" }<LOOP-END> <OMP-START>#pragma omp parallel for schedule(static, n)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr27359.C
|
#pragma omp parallel for
| 100
|
// PR c++/27359
// { dg-do compile }
void
foo ()
{
<LOOP-START>for (int i; i < 1; ++i) // { dg-error "expected|was not declared" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr31598.C
|
#pragma omp parallel for firstprivate(b) schedule(guided)
| 100
|
uble E; };
template <typename T>
struct R
{
R()
{
typedef A<typename T::E> B;
B b;
<LOOP-START>for (int t = 0; t < 10; ++t)
;
}
};
template <typename T>
struct S
{
S()
{
typedef C<typename T::E> B;
B b;
#pragma omp parallel for firstprivate(b)
for (int t = 0; t < 10; ++t)
;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(b) schedule(guided)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr31598.C
|
#pragma omp parallel for firstprivate(b)
| 100
|
;
}
};
template <typename T>
struct S
{
S()
{
typedef C<typename T::E> B;
B b;
<LOOP-START>for (int t = 0; t < 10; ++t)
;
}
};
struct U
{
U()
{
D b;
#pragma omp parallel for firstprivate(b)
for (int t = 0; t < 10; ++t)
;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(b)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr31598.C
|
#pragma omp parallel for firstprivate(b)
| 100
|
for firstprivate(b)
for (int t = 0; t < 10; ++t)
;
}
};
struct U
{
U()
{
D b;
<LOOP-START>for (int t = 0; t < 10; ++t)
;
}
};
int
main ()
{
R<M> r;
S<M> s;
U u;
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(b)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/sink-3.C
|
#pragma omp parallel for ordered(1)
| 100
|
uct {
char stuff[400];
} foo;
foo *end, *begin, *p;
template<int N>
void
funk ()
{
int i,j;
<LOOP-START>for (p=end; p > begin; p--)
{
#pragma omp ordered depend(sink:p+1)
void bar ();
bar();
#pragma omp ordered depend(source)
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered(1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr29965-6.C
|
#pragma omp parallel for schedule (static, 16)
| 100
|
a omp for schedule (static, 16)
for (i = 0; i < 2834; i++)
baz ();
}
void
foo2 ()
{
int i;
<LOOP-START>for (i = 0; i < 2834; i++)
for (;;)
;
}
void
bar2 ()
{
int i;
#pragma omp parallel for schedule (static, 16)
for (i = 0; i < 2834; i++)
baz ();
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule (static, 16)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/openmp-simd-1.C
|
#pragma omp parallel for simd
| 100
|
a[i] = b[i];
#pragma omp distribute parallel for simd
for (i = 0; i < n ; i++)
a[i] = b[i];
<LOOP-START>for (i = 0; i < n ; i++)
a[i] = b[i];
#pragma omp teams distribute simd
for (i = 0; i < n ; i++)
a[i] = b[i];
#pragma omp target teams distribute simd
for (i = 0; i < n ; i++)
a[i] = b[i];
#pragma omp teams distribute parallel for simd
for (i = 0; i < n ; i++)
a[i] = b[i];
#pragma omp target teams distribute parallel for simd
for (i = 0; i < n ; i++)
a[i] = b[i];
}
/* { dg-final { scan-tree-dump-times "pragma omp simd" 9 "original" } }<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/pr78363-1.C
|
#pragma omp parallel for reduction (+: n)
| 100
|
{ dg-require-effective-target c++11 }
// { dg-additional-options "-g" }
int main()
{
int n = 0;
<LOOP-START>for (int i = [](){ return 3; }<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+: n)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/method-1.C
|
#pragma omp parallel for
| 100
|
/* PR c++/24513 */
/* { dg-do compile } */
struct S
{
void foo (int *p)
{
<LOOP-START>for (int i = 0; i < 1000; ++i)
p[i]=0;
}
void bar ()
{
#pragma omp master
j = 2;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/block-8.C
|
#pragma omp parallel for
| 100
|
// { dg-do compile }
// PR 24451
int foo()
{
int i;
<LOOP-START>for (i = 0; i < 10; ++i)
return 0; // { dg-error "invalid exit" }<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/for-15.C
|
#pragma omp parallel for
| 100
|
++);
#pragma omp for
for (T j = 0; j < 10; j++);
#pragma omp for
for (T j = 0; j < 10; j++);
<LOOP-START>for (int k = 0; k < 10; k++);
#pragma omp parallel for
for (int k = 0; k < 10; k++);
#pragma omp parallel for
for (T l = 0; l < 10; l++);
#pragma omp parallel for
for (T l = 0; l < 10; l++);
}
void bar ()
{
foo<int> ();
foo<long> ();
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/for-15.C
|
#pragma omp parallel for
| 100
|
ma omp for
for (T j = 0; j < 10; j++);
#pragma omp parallel for
for (int k = 0; k < 10; k++);
<LOOP-START>for (int k = 0; k < 10; k++);
#pragma omp parallel for
for (T l = 0; l < 10; l++);
#pragma omp parallel for
for (T l = 0; l < 10; l++);
}
void bar ()
{
foo<int> ();
foo<long> ();
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/for-15.C
|
#pragma omp parallel for
| 100
|
llel for
for (int k = 0; k < 10; k++);
#pragma omp parallel for
for (int k = 0; k < 10; k++);
<LOOP-START>for (T l = 0; l < 10; l++);
#pragma omp parallel for
for (T l = 0; l < 10; l++);
}
void bar ()
{
foo<int> ();
foo<long> ();
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/g++.dg/gomp/for-15.C
|
#pragma omp parallel for
| 100
|
rallel for
for (int k = 0; k < 10; k++);
#pragma omp parallel for
for (T l = 0; l < 10; l++);
<LOOP-START>for (T l = 0; l < 10; l++);
}
void bar ()
{
foo<int> ();
foo<long> ();
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/pr29965-4.c
|
#pragma omp parallel for schedule (dynamic)
| 100
|
omp for schedule (dynamic)
for (i = 0; i < 2834; i++)
baz ();
}
void
foo2 (void)
{
int i;
<LOOP-START>for (i = 0; i < 2834; i++)
for (;;)
;
}
void
bar2 (void)
{
int i;
#pragma omp parallel for schedule (dynamic)
for (i = 0; i < 2834; i++)
baz ();
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule (dynamic)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/pr25990.c
|
#pragma omp parallel for private(m,liter,s)
| 100
|
s)-1)*(Ps_slice_stride)) ) ] = 0.0 + 0.0 * (__extension__ 1.0iF);
}
}
}
int liter ;
<LOOP-START>for ( n = 1 ; n <= n_max ; n++) {
for ( m = 1 ; m <= m_max ; m++) {
for ( liter = 1 ; liter <= KK ; liter++ ) {
for ( s = 1 ; s <= num_s ; s++) {
int LM_column;
float NN[4];
float OO[4];
float PP[4];
float QQ[4];
float k;
int s_index;
float RR;
s_index = s + (DD -1);
RR = f[ ( (s_index)-1) ];
k = 99.0;
NN[1 -1] = X[ ( ((m)-1) + ( ((n)-1)*m_max ))];
NN[2 -1] = Y[ ( ((m)-1) + ( ((n)-1)*m_max ))];
NN[3 -1] = Z[ ( ((m)-1) + ( ((n)-1)*m_max ))];
NN[4 -1] = 1.0;
LM_column = ((liter -1) * 3) + 1;
OO[1 -1] = MM[ ( ((1)-1) + ( ((LM_column)-1)*4 ))];
OO[2 -1] = MM[ ( ((2)-1) + ( ((LM_column)-1)*4 ))];
OO[3 -1] = MM[ ( ((3)-1) + ( ((LM_column)-1)*4 ))];
OO[4 -1] = MM[ ( ((4)-1) + ( ((LM_column)-1)*4 ))];
LM_column = ((liter -1) * 3) + 2;
PP[1 -1] = MM[ ( ((1)-1) + ( ((LM_column)-1)*4 ))];
PP[2 -1] = MM[ ( ((2)-1) + ( ((LM_column)-1)*4 ))];
PP[3 -1] = MM[ ( ((3)-1) + ( ((LM_column)-1)*4 ))];
PP[4 -1] = MM[ ( ((4)-1) + ( ((LM_column)-1)*4 ))];
LM_column = ((liter -1) * 3) + 3;
QQ[1 -1] = MM[ ( ((1)-1) + ( ((LM_column)-1)*4 ))];
QQ[2 -1] = MM[ ( ((2)-1) + ( ((LM_column)-1)*4 ))];
QQ[3 -1] = MM[ ( ((3)-1) + ( ((LM_column)-1)*4 ))];
QQ[4 -1] = MM[ ( ((4)-1) + ( ((LM_column)-1)*4 ))];
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(m,liter,s)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/pr25990.c
|
#pragma omp parallel for private(m)
| 100
|
umn)-1)*4 ))];
QQ[4 -1] = MM[ ( ((4)-1) + ( ((LM_column)-1)*4 ))];
}
}
}
}
<LOOP-START>for ( n = 1 ; n <= n_max ; n++) {
for ( m = 1 ; m <= m_max ; m++) {
int s;
float SSS;
float f1,f2,p1,p2,TT,h,FFF;
SSS = 0.0;
for ( s = 2 ; s <= num_s ; s++) {
f1 = f[ ( ((s-1) + (DD - 1))-1) ];
f2 = f[ ( ((s) + (DD - 1))-1) ];
p1 = cabsf(Ps[ ( ((m)-1) + (((n)-1)*(m_max)) + ((((s-1))-1)*(Ps_slice_stride)) ) ]) ;
p2 = cabsf(Ps[ ( ((m)-1) + (((n)-1)*(m_max)) + (((s)-1)*(Ps_slice_stride)) ) ]) ;
h = f2 - f1;
FFF = (f1 + f2) / 2.0;
TT = (1.0 / sqrtf(2.0)) * (((h * p1) + (0.5 * h * (p2 - p1))) * (1.0 / FFF));
SSS += TT;
}
P[ ( ((m)-1) + ( ((n)-1)*m_max ))] = SSS + ((__extension__ 1.0iF) * 0.0);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(m)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/pr29965-5.c
|
#pragma omp parallel for schedule (static)
| 100
|
a omp for schedule (static)
for (i = 0; i < 2834; i++)
baz ();
}
void
foo2 (void)
{
int i;
<LOOP-START>for (i = 0; i < 2834; i++)
for (;;)
;
}
void
bar2 (void)
{
int i;
#pragma omp parallel for schedule (static)
for (i = 0; i < 2834; i++)
baz ();
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule (static)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/pr66820.c
|
#pragma omp parallel for
| 100
|
/* { dg-do compile } */
/* { dg-options "-fopenmp" } */
void bar (char *);
void
foo (char **x)
{
<LOOP-START>for (int i = 0; i < 16; i++)
{
char y[50];
__builtin_strcpy (y, x[i]);
__builtin_strcat (y, "foo");
bar (y);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-19.c
|
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)
| 100
|
tions "-O -fopenmp -fdump-tree-gimple" } */
void foo (int *a, int i, int j, int k, int l, int m)
{
<LOOP-START>for (j = 0; j <= (6 * l + 4 * k); j++)
a[j] = 1;
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)
for (j = m; j <= l; j += (k + l - m))
a[j] = 1;
}
/* { dg-final { scan-tree-dump-times "shared\\(a\\)" 2 "gimple" } }<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-19.c
|
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)
| 100
|
um_threads (3 * i) schedule (dynamic, i * 4)
for (j = 0; j <= (6 * l + 4 * k); j++)
a[j] = 1;
<LOOP-START>for (j = m; j <= l; j += (k + l - m))
a[j] = 1;
}
/* { dg-final { scan-tree-dump-times "shared\\(a\\)" 2 "gimple" } }<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/_Atomic-2.c
|
#pragma omp parallel for
| 100
|
a omp for /* { dg-error "'_Atomic' iteration variable 'i'" } */
for (i = 0; i < 64; i++)
;
<LOOP-START>for (i = 0; i < 64; i++)
;
#pragma omp simd /* { dg-error "'_Atomic' iteration variable 'i'" }<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/_Atomic-2.c
|
#pragma omp parallel for simd
| 100
|
omp simd /* { dg-error "'_Atomic' iteration variable 'i'" } */
for (i = 0; i < 64; i++)
;
<LOOP-START>for (i = 0; i < 64; i++)
;
#pragma omp for simd /* { dg-error "'_Atomic' iteration variable 'i'" }<LOOP-END> <OMP-START>#pragma omp parallel for simd <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/_Atomic-2.c
|
#pragma omp parallel for
| 100
|
* { dg-error "'_Atomic' iteration variable 'j'" } */
for (_Atomic int j = 0; j < 64; j++)
;
<LOOP-START>for (_Atomic int j = 0; j < 64; j++)
;
#pragma omp simd /* { dg-error "'_Atomic' iteration variable 'j'" }<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/_Atomic-2.c
|
#pragma omp parallel for simd
| 100
|
* { dg-error "'_Atomic' iteration variable 'j'" } */
for (_Atomic int j = 0; j < 64; j++)
;
<LOOP-START>for (_Atomic int j = 0; j < 64; j++)
;
#pragma omp for simd /* { dg-error "'_Atomic' iteration variable 'j'" }<LOOP-END> <OMP-START>#pragma omp parallel for simd <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/combined-1.c
|
#pragma omp parallel for schedule(runtime)
| 100
|
/
/* { dg-options "-O1 -fopenmp -fdump-tree-optimized" } */
int a[10];
int foo (void)
{
int i;
<LOOP-START>for (i = 0; i < 10; i++)
a[i] = i;
#pragma omp parallel
#pragma omp for schedule(runtime)
for (i = 0; i < 10; i++)
a[i] = 10 - i;
#pragma omp parallel
{
#pragma omp for schedule(runtime)
for (i = 0; i < 10; i++)
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(runtime)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-18.c
|
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)
| 100
|
ns "-O -fopenmp -fdump-tree-ompexp" } */
void
foo (int *a, int i)
{
int j, k = 1, l = 30, m = 4;
<LOOP-START>for (j = 0; j <= l; j++)
a[j] = 1;
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 2;
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}
void
bar (int *a, int i)
{
int j, k = 1, l = 30, m = 4;
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = 0; j <= l; j++)
a[j] = 1;
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 2;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-18.c
|
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)
| 100
|
parallel for num_threads (3 * i) schedule (dynamic, i * 4)
for (j = 0; j <= l; j++)
a[j] = 1;
<LOOP-START>for (j = k; j <= l; j += (m - 1))
a[j] = 2;
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}
void
bar (int *a, int i)
{
int j, k = 1, l = 30, m = 4;
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = 0; j <= l; j++)
a[j] = 1;
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 2;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (dynamic, i * 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-18.c
|
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, 4)
| 100
|
for num_threads (3 * i) schedule (dynamic, i * 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 2;
<LOOP-START>for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}
void
bar (int *a, int i)
{
int j, k = 1, l = 30, m = 4;
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = 0; j <= l; j++)
a[j] = 1;
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 2;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (dynamic, 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-18.c
|
#pragma omp parallel for num_threads (3 * i) schedule (dynamic, 4)
| 100
|
omp parallel for num_threads (3 * i) schedule (dynamic, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
<LOOP-START>for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}
void
bar (int *a, int i)
{
int j, k = 1, l = 30, m = 4;
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = 0; j <= l; j++)
a[j] = 1;
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 2;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (dynamic, 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-18.c
|
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
| 100
|
k; j <= l; j += (m - 1))
a[j] = 4;
}
void
bar (int *a, int i)
{
int j, k = 1, l = 30, m = 4;
<LOOP-START>for (j = 0; j <= l; j++)
a[j] = 1;
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 2;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}
/* { dg-final { scan-tree-dump-times "GOMP_parallel_loop_dynamic_start" 4 "ompexp" { xfail *-*-* } } }<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-18.c
|
#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)
| 100
|
parallel for num_threads (3 * i) schedule (guided, i * 4)
for (j = 0; j <= l; j++)
a[j] = 1;
<LOOP-START>for (j = k; j <= l; j += (m - 1))
a[j] = 2;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}
/* { dg-final { scan-tree-dump-times "GOMP_parallel_loop_dynamic_start" 4 "ompexp" { xfail *-*-* } } }<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (guided, i * 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-18.c
|
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
| 100
|
for num_threads (3 * i) schedule (guided, i * 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 2;
<LOOP-START>for (j = 0; j <= l; j++)
a[j] = 3;
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}
/* { dg-final { scan-tree-dump-times "GOMP_parallel_loop_dynamic_start" 4 "ompexp" { xfail *-*-* } } }<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/for-18.c
|
#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)
| 100
|
omp parallel for num_threads (3 * i) schedule (guided, 4)
for (j = 0; j <= l; j++)
a[j] = 3;
<LOOP-START>for (j = k; j <= l; j += (m - 1))
a[j] = 4;
}
/* { dg-final { scan-tree-dump-times "GOMP_parallel_loop_dynamic_start" 4 "ompexp" { xfail *-*-* } } }<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3 * i) schedule (guided, 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/sink-fold-3.c
|
#pragma omp parallel for ordered(1)
| 100
|
es. */
typedef struct {
char stuff[400];
} foo;
void
funk (foo *begin, foo *end)
{
foo *p;
<LOOP-START>for (p=end; p > begin; p--)
{
#pragma omp ordered depend(sink:p+2) depend(sink:p+4)
void bar ();
bar();
#pragma omp ordered depend(source)
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered(1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/linear-1.c
|
#pragma omp parallel for linear (i:1) collapse(1)
| 100
|
.#pragma omp distribute parallel for." } */
for (i = 0; i < 32; i++)
;
}
void
f3 (void)
{
<LOOP-START>for (i = 0; i < 32; i++)
;
}
void
f4 (void)
{
#pragma omp for linear (i:1) linear (j:2) collapse(2) /* { dg-error "iteration variable .i. should not be linear" } */
for (i = 0; i < 32; i++) /* { dg-error "iteration variable .j. should not be linear" "" { target *-*-* } .-1 } */
for (j = 0; j < 32; j+=2)
;
}<LOOP-END> <OMP-START>#pragma omp parallel for linear (i:1) collapse(1) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/cea-hpc/pcvs-benchmarks/compilers/gcc/gcc.dg/gomp/linear-1.c
|
#pragma omp parallel for linear (i:1) collapse(2) linear (j:2)
| 100
|
l for." } */
for (i = 0; i < 32; i++)
for (j = 0; j < 32; j+=2)
;
}
void
f6 (void)
{
<LOOP-START>for (i = 0; i < 32; i++) /* { dg-error "iteration variable .j. should not be linear" "" { target *-*-* } .-1 }<LOOP-END> <OMP-START>#pragma omp parallel for linear (i:1) collapse(2) linear (j:2) <OMP-END>
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.