extern int omp_default_mem_alloc;
void xxx(int argc) {
int i, lin, step; #pragma omp for linear(lin : step)
for (i = 0; i < 10; ++i)
;
}
namespace X {
int x;
};
struct B {
static int ib; static int bfoo() { return 8; }
};
int bfoo() { return 4; }
int z;
const int C1 = 1;
const int C2 = 2;
void test_linear_colons()
{
int B = 0;
#pragma omp for linear(B:bfoo())
for (int i = 0; i < 10; ++i) ;
#pragma omp for linear(B::ib:B:bfoo())
for (int i = 0; i < 10; ++i) ;
#pragma omp for linear(B:ib)
for (int i = 0; i < 10; ++i) ;
#pragma omp for linear(z:B:ib)
for (int i = 0; i < 10; ++i) ;
#pragma omp for linear(B:B::bfoo())
for (int i = 0; i < 10; ++i) ;
#pragma omp for linear(X::x : ::z)
for (int i = 0; i < 10; ++i) ;
#pragma omp for linear(B,::z, X::x)
for (int i = 0; i < 10; ++i) ;
#pragma omp for linear(::z)
for (int i = 0; i < 10; ++i) ;
#pragma omp for linear(B::bfoo())
for (int i = 0; i < 10; ++i) ;
#pragma omp for linear(B::ib,B:C1+C2)
for (int i = 0; i < 10; ++i) ;
}
template<int L, class T, class N> T test_template(T* arr, N num) {
N i;
T sum = (T)0;
T ind2 = - num * L; #pragma omp for linear(ind2:L)
for (i = 0; i < num; ++i) {
T cur = arr[(int)ind2];
ind2 += L;
sum += cur;
}
return T();
}
template<int LEN> int test_warn() {
int ind2 = 0;
#pragma omp for linear(ind2:LEN)
for (int i = 0; i < 100; i++) {
ind2 += LEN;
}
return ind2;
}
struct S1; extern S1 a;
class S2 {
mutable int a;
public:
S2():a(0) { }
};
const S2 b; const S2 ba[5];
class S3 {
int a;
public:
S3():a(0) { }
};
const S3 ca[5];
class S4 {
int a;
S4();
public:
S4(int v):a(v) { }
};
class S5 {
int a;
S5():a(0) {}
public:
S5(int v):a(v) { }
};
S3 h;
#pragma omp threadprivate(h)
template<class I, class C> int foomain(I argc, C **argv) {
I e(4);
I g(5);
int i, k;
int &j = i;
#pragma omp for linear
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear ()
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argc
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argc,
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argc > 0 ? argv[1] : argv[2])
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argc : 5) allocate , allocate(, allocate(omp_default , allocate(omp_default_mem_alloc, allocate(omp_default_mem_alloc:, allocate(omp_default_mem_alloc: argc, allocate(omp_default_mem_alloc: argv), allocate(argv)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (S1)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (a, b:B::ib)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argv[1])
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(e, g, k)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(h)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(i)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp parallel
{
int v = 0;
int i;
#pragma omp for linear(v:i)
for (int k = 0; k < argc; ++k) { i = k; v += i; }
}
#pragma omp for linear(j)
for (int k = 0; k < argc; ++k) ++k;
int v = 0;
#pragma omp for linear(v:j)
for (int k = 0; k < argc; ++k) { ++k; v += j; }
#pragma omp for linear(i)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(i) ordered(1)
for (int k = 0; k < argc; ++k) ++k;
return 0;
}
namespace A {
double x;
#pragma omp threadprivate(x)
}
namespace C {
using A::x;
}
int main(int argc, char **argv) {
double darr[100];
test_template<-4>(darr, 4);
test_warn<0>();
S4 e(4); S5 g(5); int i, k;
int &j = i;
#pragma omp for linear
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear ()
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argc
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argc,
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argc > 0 ? argv[1] : argv[2])
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argc)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (S1)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(a, b, k)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear (argv[1])
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(e, g)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(h, C::x)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp parallel
{
int i;
#pragma omp for linear(i)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(i : 4)
for (int k = 0; k < argc; ++k) { ++k; i += 4; }
}
#pragma omp for linear(j)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(i)
for (int k = 0; k < argc; ++k) ++k;
#pragma omp for linear(i) ordered(1)
for (int k = 0; k < argc; ++k) ++k;
foomain<int,char>(argc,argv); return 0;
}