// { dg-do run }
|
// { dg-do run }
|
|
|
#include
|
#include
|
typedef __PTRDIFF_TYPE__ ptrdiff_t;
|
typedef __PTRDIFF_TYPE__ ptrdiff_t;
|
extern "C" void abort ();
|
extern "C" void abort ();
|
|
|
template
|
template
|
class I
|
class I
|
{
|
{
|
public:
|
public:
|
typedef ptrdiff_t difference_type;
|
typedef ptrdiff_t difference_type;
|
I ();
|
I ();
|
~I ();
|
~I ();
|
I (T *);
|
I (T *);
|
I (const I &);
|
I (const I &);
|
T &operator * ();
|
T &operator * ();
|
T *operator -> ();
|
T *operator -> ();
|
T &operator [] (const difference_type &) const;
|
T &operator [] (const difference_type &) const;
|
I &operator = (const I &);
|
I &operator = (const I &);
|
I &operator ++ ();
|
I &operator ++ ();
|
I operator ++ (int);
|
I operator ++ (int);
|
I &operator -- ();
|
I &operator -- ();
|
I operator -- (int);
|
I operator -- (int);
|
I &operator += (const difference_type &);
|
I &operator += (const difference_type &);
|
I &operator -= (const difference_type &);
|
I &operator -= (const difference_type &);
|
I operator + (const difference_type &) const;
|
I operator + (const difference_type &) const;
|
I operator - (const difference_type &) const;
|
I operator - (const difference_type &) const;
|
template friend bool operator == (I &, I &);
|
template friend bool operator == (I &, I &);
|
template friend bool operator == (const I &, const I &);
|
template friend bool operator == (const I &, const I &);
|
template friend bool operator < (I &, I &);
|
template friend bool operator < (I &, I &);
|
template friend bool operator < (const I &, const I &);
|
template friend bool operator < (const I &, const I &);
|
template friend bool operator <= (I &, I &);
|
template friend bool operator <= (I &, I &);
|
template friend bool operator <= (const I &, const I &);
|
template friend bool operator <= (const I &, const I &);
|
template friend bool operator > (I &, I &);
|
template friend bool operator > (I &, I &);
|
template friend bool operator > (const I &, const I &);
|
template friend bool operator > (const I &, const I &);
|
template friend bool operator >= (I &, I &);
|
template friend bool operator >= (I &, I &);
|
template friend bool operator >= (const I &, const I &);
|
template friend bool operator >= (const I &, const I &);
|
template friend typename I::difference_type operator - (I &, I &);
|
template friend typename I::difference_type operator - (I &, I &);
|
template friend typename I::difference_type operator - (const I &, const I &);
|
template friend typename I::difference_type operator - (const I &, const I &);
|
template friend I operator + (typename I::difference_type , const I &);
|
template friend I operator + (typename I::difference_type , const I &);
|
private:
|
private:
|
T *p;
|
T *p;
|
};
|
};
|
template I::I () : p (0) {}
|
template I::I () : p (0) {}
|
template I::~I () { p = (T *) 0; }
|
template I::~I () { p = (T *) 0; }
|
template I::I (T *x) : p (x) {}
|
template I::I (T *x) : p (x) {}
|
template I::I (const I &x) : p (x.p) {}
|
template I::I (const I &x) : p (x.p) {}
|
template T &I::operator * () { return *p; }
|
template T &I::operator * () { return *p; }
|
template T *I::operator -> () { return p; }
|
template T *I::operator -> () { return p; }
|
template T &I::operator [] (const difference_type &x) const { return p[x]; }
|
template T &I::operator [] (const difference_type &x) const { return p[x]; }
|
template I &I::operator = (const I &x) { p = x.p; return *this; }
|
template I &I::operator = (const I &x) { p = x.p; return *this; }
|
template I &I::operator ++ () { ++p; return *this; }
|
template I &I::operator ++ () { ++p; return *this; }
|
template I I::operator ++ (int) { return I (p++); }
|
template I I::operator ++ (int) { return I (p++); }
|
template I &I::operator -- () { --p; return *this; }
|
template I &I::operator -- () { --p; return *this; }
|
template I I::operator -- (int) { return I (p--); }
|
template I I::operator -- (int) { return I (p--); }
|
template I &I::operator += (const difference_type &x) { p += x; return *this; }
|
template I &I::operator += (const difference_type &x) { p += x; return *this; }
|
template I &I::operator -= (const difference_type &x) { p -= x; return *this; }
|
template I &I::operator -= (const difference_type &x) { p -= x; return *this; }
|
template I I::operator + (const difference_type &x) const { return I (p + x); }
|
template I I::operator + (const difference_type &x) const { return I (p + x); }
|
template I I::operator - (const difference_type &x) const { return I (p - x); }
|
template I I::operator - (const difference_type &x) const { return I (p - x); }
|
template bool operator == (I &x, I &y) { return x.p == y.p; }
|
template bool operator == (I &x, I &y) { return x.p == y.p; }
|
template bool operator == (const I &x, const I &y) { return x.p == y.p; }
|
template bool operator == (const I &x, const I &y) { return x.p == y.p; }
|
template bool operator != (I &x, I &y) { return !(x == y); }
|
template bool operator != (I &x, I &y) { return !(x == y); }
|
template bool operator != (const I &x, const I &y) { return !(x == y); }
|
template bool operator != (const I &x, const I &y) { return !(x == y); }
|
template bool operator < (I &x, I &y) { return x.p < y.p; }
|
template bool operator < (I &x, I &y) { return x.p < y.p; }
|
template bool operator < (const I &x, const I &y) { return x.p < y.p; }
|
template bool operator < (const I &x, const I &y) { return x.p < y.p; }
|
template bool operator <= (I &x, I &y) { return x.p <= y.p; }
|
template bool operator <= (I &x, I &y) { return x.p <= y.p; }
|
template bool operator <= (const I &x, const I &y) { return x.p <= y.p; }
|
template bool operator <= (const I &x, const I &y) { return x.p <= y.p; }
|
template bool operator > (I &x, I &y) { return x.p > y.p; }
|
template bool operator > (I &x, I &y) { return x.p > y.p; }
|
template bool operator > (const I &x, const I &y) { return x.p > y.p; }
|
template bool operator > (const I &x, const I &y) { return x.p > y.p; }
|
template bool operator >= (I &x, I &y) { return x.p >= y.p; }
|
template bool operator >= (I &x, I &y) { return x.p >= y.p; }
|
template bool operator >= (const I &x, const I &y) { return x.p >= y.p; }
|
template bool operator >= (const I &x, const I &y) { return x.p >= y.p; }
|
template typename I::difference_type operator - (I &x, I &y) { return x.p - y.p; }
|
template typename I::difference_type operator - (I &x, I &y) { return x.p - y.p; }
|
template typename I::difference_type operator - (const I &x, const I &y) { return x.p - y.p; }
|
template typename I::difference_type operator - (const I &x, const I &y) { return x.p - y.p; }
|
template I operator + (typename I::difference_type x, const I &y) { return I (x + y.p); }
|
template I operator + (typename I::difference_type x, const I &y) { return I (x + y.p); }
|
|
|
template
|
template
|
class J
|
class J
|
{
|
{
|
public:
|
public:
|
J(const I &x, const I &y) : b (x), e (y) {}
|
J(const I &x, const I &y) : b (x), e (y) {}
|
const I &begin ();
|
const I &begin ();
|
const I &end ();
|
const I &end ();
|
private:
|
private:
|
I b, e;
|
I b, e;
|
};
|
};
|
|
|
template const I &J::begin () { return b; }
|
template const I &J::begin () { return b; }
|
template const I &J::end () { return e; }
|
template const I &J::end () { return e; }
|
|
|
int results[2000];
|
int results[2000];
|
|
|
void
|
void
|
f1 (J x, J y, J z)
|
f1 (J x, J y, J z)
|
{
|
{
|
I i, j, k;
|
I i, j, k;
|
int l, f = 0, n = 0, m = 0;
|
int l, f = 0, n = 0, m = 0;
|
#pragma omp parallel shared (i, j, k, l) firstprivate (f) \
|
#pragma omp parallel shared (i, j, k, l) firstprivate (f) \
|
reduction (+:n, m) num_threads (8)
|
reduction (+:n, m) num_threads (8)
|
{
|
{
|
#pragma omp for lastprivate (i, j, k, l) schedule (static, 9) \
|
#pragma omp for lastprivate (i, j, k, l) schedule (static, 9) \
|
collapse (4)
|
collapse (4)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (j = y.begin (); j <= y.end (); j += 1)
|
for (j = y.begin (); j <= y.end (); j += 1)
|
for (l = 0; l < 1; l++)
|
for (l = 0; l < 1; l++)
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
|| m != 72 || l != 1)
|
|| m != 72 || l != 1)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
void
|
void
|
f2 (J x, J y, J z)
|
f2 (J x, J y, J z)
|
{
|
{
|
int f = 0, n = 0, m = 0;
|
int f = 0, n = 0, m = 0;
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
num_threads (8) schedule (static, 9) \
|
num_threads (8) schedule (static, 9) \
|
collapse (6 - 2)
|
collapse (6 - 2)
|
for (I i = x.end () - 1; i >= x.begin (); --i)
|
for (I i = x.end () - 1; i >= x.begin (); --i)
|
for (int l = -131; l >= -131; l--)
|
for (int l = -131; l >= -131; l--)
|
for (I j = y.end (); j > y.begin () - 1; j -= 1)
|
for (I j = y.end (); j > y.begin () - 1; j -= 1)
|
{
|
{
|
for (I k = z.end () - 4; k >= z.begin () + 3; k--)
|
for (I k = z.end () - 4; k >= z.begin () + 3; k--)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
if (n || m != 72)
|
if (n || m != 72)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
template
|
template
|
void
|
void
|
f3 (J x, J y, J z)
|
f3 (J x, J y, J z)
|
{
|
{
|
I i, j, k;
|
I i, j, k;
|
int l, f = 0, n = 0, m = 0;
|
int l, f = 0, n = 0, m = 0;
|
#pragma omp parallel shared (i, j, k, l) firstprivate (f) \
|
#pragma omp parallel shared (i, j, k, l) firstprivate (f) \
|
reduction (+:n, m) num_threads (8)
|
reduction (+:n, m) num_threads (8)
|
{
|
{
|
#pragma omp for lastprivate (i, j, k, l) schedule (static, 9) \
|
#pragma omp for lastprivate (i, j, k, l) schedule (static, 9) \
|
collapse (4)
|
collapse (4)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (j = y.begin (); j <= y.end (); j += 1)
|
for (j = y.begin (); j <= y.end (); j += 1)
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
for (l = 7; l <= 7; l++)
|
for (l = 7; l <= 7; l++)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
|| m != 72 || l != 8)
|
|| m != 72 || l != 8)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
template
|
template
|
void
|
void
|
f4 (J x, J y, J z)
|
f4 (J x, J y, J z)
|
{
|
{
|
int f = 0, n = 0, m = 0;
|
int f = 0, n = 0, m = 0;
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
num_threads (8) schedule (static, 9) \
|
num_threads (8) schedule (static, 9) \
|
collapse (5 - 2)
|
collapse (5 - 2)
|
for (I i = x.end () - 1; i >= x.begin (); --i)
|
for (I i = x.end () - 1; i >= x.begin (); --i)
|
{
|
{
|
for (I j = y.end (); j > y.begin () - 1; j -= 1)
|
for (I j = y.end (); j > y.begin () - 1; j -= 1)
|
{
|
{
|
for (I k = z.end () - 4; k >= z.begin () + 3; k--)
|
for (I k = z.end () - 4; k >= z.begin () + 3; k--)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
}
|
}
|
if (n || m != 72)
|
if (n || m != 72)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
template
|
template
|
void
|
void
|
f5 (J x, J y, J z)
|
f5 (J x, J y, J z)
|
{
|
{
|
I i, j, k;
|
I i, j, k;
|
int f = 0, n = 0, m = 0;
|
int f = 0, n = 0, m = 0;
|
#pragma omp parallel shared (i, j, k) firstprivate (f) \
|
#pragma omp parallel shared (i, j, k) firstprivate (f) \
|
reduction (+:n, m) num_threads (8)
|
reduction (+:n, m) num_threads (8)
|
{
|
{
|
#pragma omp for lastprivate (i, j, k) schedule (static, 9) \
|
#pragma omp for lastprivate (i, j, k) schedule (static, 9) \
|
collapse (3)
|
collapse (3)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (j = y.begin (); j <= y.end (); j += (T) 1)
|
for (j = y.begin (); j <= y.end (); j += (T) 1)
|
{
|
{
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
}
|
}
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
|| m != 72)
|
|| m != 72)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
template
|
template
|
void
|
void
|
f6 (J x, J y, J z)
|
f6 (J x, J y, J z)
|
{
|
{
|
int f = 0, n = 0, m = 0;
|
int f = 0, n = 0, m = 0;
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
num_threads (8) schedule (static, 9) \
|
num_threads (8) schedule (static, 9) \
|
collapse (5 - 2)
|
collapse (5 - 2)
|
for (I i = x.end () - 1; i >= x.begin (); --i)
|
for (I i = x.end () - 1; i >= x.begin (); --i)
|
{
|
{
|
for (I j = y.end (); j > y.begin () - 1; j -= 1)
|
for (I j = y.end (); j > y.begin () - 1; j -= 1)
|
{
|
{
|
for (I k = z.end () - 4; k >= z.begin () + (T) 3; k--)
|
for (I k = z.end () - 4; k >= z.begin () + (T) 3; k--)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
}
|
}
|
if (n || m != 72)
|
if (n || m != 72)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
template
|
template
|
void
|
void
|
f7 (J x, J y, J z)
|
f7 (J x, J y, J z)
|
{
|
{
|
I i, j, k, o = y.begin ();
|
I i, j, k, o = y.begin ();
|
T l, f = 0, n = 0, m = 0;
|
T l, f = 0, n = 0, m = 0;
|
#pragma omp parallel shared (i, j, k, l) firstprivate (f) \
|
#pragma omp parallel shared (i, j, k, l) firstprivate (f) \
|
reduction (+:n, m) num_threads (8)
|
reduction (+:n, m) num_threads (8)
|
{
|
{
|
#pragma omp for lastprivate (i, j, k, l) schedule (static, 9) \
|
#pragma omp for lastprivate (i, j, k, l) schedule (static, 9) \
|
collapse (4)
|
collapse (4)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (j = y.begin (); j <= y.end (); j += 1)
|
for (j = y.begin (); j <= y.end (); j += 1)
|
for (l = *o; l <= *o; l = 1 + l)
|
for (l = *o; l <= *o; l = 1 + l)
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
|| m != 72 || l != *o + 1)
|
|| m != 72 || l != *o + 1)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
template
|
template
|
void
|
void
|
f8 (J x, J y, J z)
|
f8 (J x, J y, J z)
|
{
|
{
|
T f = 0, n = 0, m = 0;
|
T f = 0, n = 0, m = 0;
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
num_threads (8) schedule (static, 9) \
|
num_threads (8) schedule (static, 9) \
|
collapse (6 - 2)
|
collapse (6 - 2)
|
for (I i = x.end () - 1; i >= x.begin (); --i)
|
for (I i = x.end () - 1; i >= x.begin (); --i)
|
for (T l = 0; l < 1; l++)
|
for (T l = 0; l < 1; l++)
|
for (I j = y.end (); j > y.begin () - 1; j -= 1)
|
for (I j = y.end (); j > y.begin () - 1; j -= 1)
|
{
|
{
|
for (I k = z.end () - 4; k >= z.begin () + 3; k--)
|
for (I k = z.end () - 4; k >= z.begin () + 3; k--)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
if (n || m != 72)
|
if (n || m != 72)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
template
|
template
|
void
|
void
|
f9 (J x, J y, J z)
|
f9 (J x, J y, J z)
|
{
|
{
|
S i, j, k, o = y.begin ();
|
S i, j, k, o = y.begin ();
|
T l, f = 0, n = 0, m = 0;
|
T l, f = 0, n = 0, m = 0;
|
#pragma omp parallel shared (i, j, k, l) firstprivate (f) \
|
#pragma omp parallel shared (i, j, k, l) firstprivate (f) \
|
reduction (+:n, m) num_threads (8)
|
reduction (+:n, m) num_threads (8)
|
{
|
{
|
#pragma omp for lastprivate (i, j, k, l) schedule (static, 9) \
|
#pragma omp for lastprivate (i, j, k, l) schedule (static, 9) \
|
collapse (4)
|
collapse (4)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (i = x.begin (); i < x.end (); ++i)
|
for (j = y.begin (); j <= y.end (); j += 1)
|
for (j = y.begin (); j <= y.end (); j += 1)
|
for (l = *o; l <= *o; l = 1 + l)
|
for (l = *o; l <= *o; l = 1 + l)
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
for (k = z.begin () + 3; k < z.end () - 3; k++)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
&& ((*i + 2) * 12 + (*j + 5) * 4 + (*k - 13)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
if (n || i != x.end () || j != y.end () + 1 || k != z.end () - 3
|
|| m != 72 || l != *o + 1)
|
|| m != 72 || l != *o + 1)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
template
|
template
|
void
|
void
|
f10 (J x, J y, J z)
|
f10 (J x, J y, J z)
|
{
|
{
|
T f = 0, n = 0, m = 0;
|
T f = 0, n = 0, m = 0;
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
#pragma omp parallel for firstprivate (f) reduction (+:n, m) \
|
num_threads (8) schedule (static, 9) \
|
num_threads (8) schedule (static, 9) \
|
collapse (6 - 2)
|
collapse (6 - 2)
|
for (S i = x.end () - 1; i >= x.begin (); --i)
|
for (S i = x.end () - 1; i >= x.begin (); --i)
|
for (T l = 0; l < 1; l++)
|
for (T l = 0; l < 1; l++)
|
for (S j = y.end (); j > y.begin () - 1; j -= 1)
|
for (S j = y.end (); j > y.begin () - 1; j -= 1)
|
{
|
{
|
for (S k = z.end () - 4; k >= z.begin () + 3; k--)
|
for (S k = z.end () - 4; k >= z.begin () + 3; k--)
|
if (omp_get_num_threads () == 8
|
if (omp_get_num_threads () == 8
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
&& ((3 - *i) * 12 + (-3 - *j) * 4 + (16 - *k)
|
!= (omp_get_thread_num () * 9 + f++)))
|
!= (omp_get_thread_num () * 9 + f++)))
|
n++;
|
n++;
|
else
|
else
|
m++;
|
m++;
|
}
|
}
|
if (n || m != 72)
|
if (n || m != 72)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
int
|
int
|
main ()
|
main ()
|
{
|
{
|
int a[2000];
|
int a[2000];
|
long b[2000];
|
long b[2000];
|
for (int i = 0; i < 2000; i++)
|
for (int i = 0; i < 2000; i++)
|
{
|
{
|
a[i] = i - 1000;
|
a[i] = i - 1000;
|
b[i] = i - 1000;
|
b[i] = i - 1000;
|
}
|
}
|
J x (&a[998], &a[1004]);
|
J x (&a[998], &a[1004]);
|
J y (&a[995], &a[997]);
|
J y (&a[995], &a[997]);
|
J z (&a[1010], &a[1020]);
|
J z (&a[1010], &a[1020]);
|
f1 (x, y, z);
|
f1 (x, y, z);
|
f2 (x, y, z);
|
f2 (x, y, z);
|
f3 (x, y, z);
|
f3 (x, y, z);
|
f4 (x, y, z);
|
f4 (x, y, z);
|
f5 (x, y, z);
|
f5 (x, y, z);
|
f6 (x, y, z);
|
f6 (x, y, z);
|
f7 (x, y, z);
|
f7 (x, y, z);
|
f8 (x, y, z);
|
f8 (x, y, z);
|
f9 , int> (x, y, z);
|
f9 , int> (x, y, z);
|
f10 , int> (x, y, z);
|
f10 , int> (x, y, z);
|
}
|
}
|
|
|
