Subversion Repositories openrisc

// { dg-do run }

// { dg-do run }

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 () {}

template  I::~I () {}

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];

template 

template 

void

void

baz (I &i)

baz (I &i)

{

{

  if (*i < 0 || *i >= 2000)

  if (*i < 0 || *i >= 2000)

    abort ();

    abort ();

  results[*i]++;

  results[*i]++;

}

}

void

void

f1 (const I &x, const I &y)

f1 (const I &x, const I &y)

{

{

#pragma omp parallel for

#pragma omp parallel for

  for (I i = x; y >= i; i += 6)

  for (I i = x; y >= i; i += 6)

    baz (i);

    baz (i);

}

}

void

void

f2 (const I &x, const I &y)

f2 (const I &x, const I &y)

{

{

  I i;

  I i;

#pragma omp parallel for private(i)

#pragma omp parallel for private(i)

  for (i = x; y - 1 > i; i = 1 - 6 + 7 + i)

  for (i = x; y - 1 > i; i = 1 - 6 + 7 + i)

    baz (i);

    baz (i);

}

}

template 

template 

void

void

f3 (const I &x, const I &y)

f3 (const I &x, const I &y)

{

{

#pragma omp parallel for

#pragma omp parallel for

  for (I i = x; y >= i; i = i + 9 - 8)

  for (I i = x; y >= i; i = i + 9 - 8)

    baz (i);

    baz (i);

}

}

template 

template 

void

void

f4 (const I &x, const I &y)

f4 (const I &x, const I &y)

{

{

  I i;

  I i;

#pragma omp parallel for lastprivate(i)

#pragma omp parallel for lastprivate(i)

  for (i = x + 2000 - 64; y + 10 < i; --i)

  for (i = x + 2000 - 64; y + 10 < i; --i)

    baz (i);

    baz (i);

}

}

void

void

f5 (const I &x, const I &y)

f5 (const I &x, const I &y)

{

{

#pragma omp parallel for

#pragma omp parallel for

  for (I i = x + 2000 - 64; y + 10 < i; i -= 10)

  for (I i = x + 2000 - 64; y + 10 < i; i -= 10)

    baz (i);

    baz (i);

}

}

template 

template 

void

void

f6 (const I &x, const I &y)

f6 (const I &x, const I &y)

{

{

#pragma omp parallel for

#pragma omp parallel for

  for (I i = x + 2000 - 64; y + 10 < i; i = i - 12 + 2)

  for (I i = x + 2000 - 64; y + 10 < i; i = i - 12 + 2)

    {

    {

      I j = i + N;

      I j = i + N;

      baz (j);

      baz (j);

    }

    }

}

}

template 

template 

void

void

f7 (I i, const I &x, const I &y)

f7 (I i, const I &x, const I &y)

{

{

#pragma omp parallel for

#pragma omp parallel for

  for (i = x - 10; y + 10 >= i; i += N)

  for (i = x - 10; y + 10 >= i; i += N)

    baz (i);

    baz (i);

}

}

template 

template 

void

void

f8 (J j)

f8 (J j)

{

{

  I i;

  I i;

#pragma omp parallel for

#pragma omp parallel for

  for (i = j.begin (); j.end () + N >= i; i += 2)

  for (i = j.begin (); j.end () + N >= i; i += 2)

    baz (i);

    baz (i);

}

}

template 

template 

void

void

f9 (const I &x, const I &y)

f9 (const I &x, const I &y)

{

{

#pragma omp parallel for

#pragma omp parallel for

  for (I i = x; y >= i; i = i + N)

  for (I i = x; y >= i; i = i + N)

    baz (i);

    baz (i);

}

}

template 

template 

void

void

f10 (const I &x, const I &y)

f10 (const I &x, const I &y)

{

{

  I i;

  I i;

#pragma omp parallel for

#pragma omp parallel for

  for (i = x; y < i; i = i + N)

  for (i = x; y < i; i = i + N)

    baz (i);

    baz (i);

}

}

template 

template 

void

void

f11 (const T &x, const T &y)

f11 (const T &x, const T &y)

{

{

#pragma omp parallel

#pragma omp parallel

  {

  {

#pragma omp for nowait

#pragma omp for nowait

    for (T i = x; y >= i; i += 3)

    for (T i = x; y >= i; i += 3)

      baz (i);

      baz (i);

#pragma omp single

#pragma omp single

    {

    {

      T j = y + 3;

      T j = y + 3;

      baz (j);

      baz (j);

    }

    }

  }

  }

}

}

template 

template 

void

void

f12 (const T &x, const T &y)

f12 (const T &x, const T &y)

{

{

  T i;

  T i;

#pragma omp parallel for

#pragma omp parallel for

  for (i = x; y < i; --i)

  for (i = x; y < i; --i)

    baz (i);

    baz (i);

}

}

template 

template 

struct K

struct K

{

{

  template 

  template 

  static void

  static void

  f13 (const T &x, const T &y)

  f13 (const T &x, const T &y)

  {

  {

#pragma omp parallel for

#pragma omp parallel for

    for (T i = x; y + N >= i; i += N)

    for (T i = x; y + N >= i; i += N)

      baz (i);

      baz (i);

  }

  }

};

};

#define check(expr) \

#define check(expr) \

  for (int i = 0; i < 2000; i++)                        \

  for (int i = 0; i < 2000; i++)                        \

    if (expr)                                           \

    if (expr)                                           \

      {                                                 \

      {                                                 \

        if (results[i] != 1)                            \

        if (results[i] != 1)                            \

          abort ();                                     \

          abort ();                                     \

        results[i] = 0;                                 \

        results[i] = 0;                                 \

      }                                                 \

      }                                                 \

    else if (results[i])                                \

    else if (results[i])                                \

      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;

      a[i] = i;

      b[i] = i;

      b[i] = i;

    }

    }

  f1 (&a[10], &a[1990]);

  f1 (&a[10], &a[1990]);

  check (i >= 10 && i <= 1990 && (i - 10) % 6 == 0);

  check (i >= 10 && i <= 1990 && (i - 10) % 6 == 0);

  f2 (&a[0], &a[1999]);

  f2 (&a[0], &a[1999]);

  check (i < 1998 && (i & 1) == 0);

  check (i < 1998 && (i & 1) == 0);

  f3 (&a[20], &a[1837]);

  f3 (&a[20], &a[1837]);

  check (i >= 20 && i <= 1837);

  check (i >= 20 && i <= 1837);

  f4 (&a[0], &a[30]);

  f4 (&a[0], &a[30]);

  check (i > 40 && i <= 2000 - 64);

  check (i > 40 && i <= 2000 - 64);

  f5 (&a[0], &a[100]);

  f5 (&a[0], &a[100]);

  check (i >= 116 && i <= 2000 - 64 && (i - 116) % 10 == 0);

  check (i >= 116 && i <= 2000 - 64 && (i - 116) % 10 == 0);

  f6<-10> (&a[10], &a[110]);

  f6<-10> (&a[10], &a[110]);

  check (i >= 116 && i <= 2000 - 64 && (i - 116) % 10 == 0);

  check (i >= 116 && i <= 2000 - 64 && (i - 116) % 10 == 0);

  f7<6> (I (), &a[12], &a[1800]);

  f7<6> (I (), &a[12], &a[1800]);

  check (i >= 2 && i <= 1808 && (i - 2) % 6 == 0);

  check (i >= 2 && i <= 1808 && (i - 2) % 6 == 0);

  f8<121> (J (&a[14], &a[1803]));

  f8<121> (J (&a[14], &a[1803]));

  check (i >= 14 && i <= 1924 && (i & 1) == 0);

  check (i >= 14 && i <= 1924 && (i & 1) == 0);

  f9 (&a[33], &a[1967]);

  f9 (&a[33], &a[1967]);

  check (i >= 33 && i <= 1967 && (i - 33) % 7 == 0);

  check (i >= 33 && i <= 1967 && (i - 33) % 7 == 0);

  f10 (&a[1939], &a[17]);

  f10 (&a[1939], &a[17]);

  check (i >= 21 && i <= 1939 && (i - 21) % 7 == 0);

  check (i >= 21 && i <= 1939 && (i - 21) % 7 == 0);

  f11 > (&a[16], &a[1981]);

  f11 > (&a[16], &a[1981]);

  check (i >= 16 && i <= 1984 && (i - 16) % 3 == 0);

  check (i >= 16 && i <= 1984 && (i - 16) % 3 == 0);

  f12 > (&a[1761], &a[37]);

  f12 > (&a[1761], &a[37]);

  check (i > 37 && i <= 1761);

  check (i > 37 && i <= 1761);

  K<5>::f13 > (&a[1], &a[1935]);

  K<5>::f13 > (&a[1], &a[1935]);

  check (i >= 1 && i <= 1936 && (i - 1) % 5 == 0);

  check (i >= 1 && i <= 1936 && (i - 1) % 5 == 0);

  f9 (&b[33], &b[1967]);

  f9 (&b[33], &b[1967]);

  check (i >= 33 && i <= 1967 && (i - 33) % 7 == 0);

  check (i >= 33 && i <= 1967 && (i - 33) % 7 == 0);

  f10 (&b[1939], &b[17]);

  f10 (&b[1939], &b[17]);

  check (i >= 21 && i <= 1939 && (i - 21) % 7 == 0);

  check (i >= 21 && i <= 1939 && (i - 21) % 7 == 0);

  f11 > (&b[16], &b[1981]);

  f11 > (&b[16], &b[1981]);

  check (i >= 16 && i <= 1984 && (i - 16) % 3 == 0);

  check (i >= 16 && i <= 1984 && (i - 16) % 3 == 0);

  f12 > (&b[1761], &b[37]);

  f12 > (&b[1761], &b[37]);

  check (i > 37 && i <= 1761);

  check (i > 37 && i <= 1761);

  K<5>::f13 > (&b[1], &b[1935]);

  K<5>::f13 > (&b[1], &b[1935]);

  check (i >= 1 && i <= 1936 && (i - 1) % 5 == 0);

  check (i >= 1 && i <= 1936 && (i - 1) % 5 == 0);

}

}