Subversion Repositories openrisc

/* { dg-require-effective-target vect_float } */

/* { dg-require-effective-target vect_float } */

#include <stdarg.h>

#include <stdarg.h>

#include "tree-vect.h"

#include "tree-vect.h"

#define N 16

#define N 16

int main1 ()

int main1 ()

{

{

  int i, j;

  int i, j;

  float a[N];

  float a[N];

  float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};

  float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};

  float d[N] = {0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30};

  float d[N] = {0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30};

  i = 0;

  i = 0;

  j = 0;

  j = 0;

  while (i < 5*N)

  while (i < 5*N)

    {

    {

      a[j] = c[j];

      a[j] = c[j];

      i += 5;

      i += 5;

      j++;

      j++;

    }

    }

  /* check results:  */

  /* check results:  */

  for (i = 0; i <N; i++)

  for (i = 0; i <N; i++)

    {

    {

      if (a[i] != c[i])

      if (a[i] != c[i])

        abort ();

        abort ();

    }

    }

  for (i = N; i > 0; i--)

  for (i = N; i > 0; i--)

    {

    {

      a[N-i] = d[N-i];

      a[N-i] = d[N-i];

    }

    }

  /* check results:  */

  /* check results:  */

  for (i = 0; i < N; i++)

  for (i = 0; i < N; i++)

    {

    {

      if (a[i] != d[i])

      if (a[i] != d[i])

        abort ();

        abort ();

    }

    }

  return 0;

  return 0;

}

}

int main (void)

int main (void)

{

{

  check_vect ();

  check_vect ();

  return main1 ();

  return main1 ();

}

}

/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */

/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */

/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */

/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */

/* { dg-final { cleanup-tree-dump "vect" } } */

/* { dg-final { cleanup-tree-dump "vect" } } */