Subversion Repositories openrisc_2011-10-31

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

#include <stdarg.h>

#include <stdio.h>

#include "tree-vect.h"

#define N 16 

typedef struct {

   unsigned char a;

   unsigned char b;

   unsigned char c;

   unsigned char d;

   unsigned char e;

   unsigned char f;

   unsigned char g;

   unsigned char h;

} s;

__attribute__ ((noinline)) int

main1 (s *arr)

{

  int i;

  s *ptr = arr;

  s res[N];

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

    {

      res[i].c = ptr->b;

      res[i].a = ptr->f + ptr->b;

      res[i].d = ptr->f - ptr->b;

      res[i].b = ptr->f;

      res[i].f = ptr->b;

      res[i].e = ptr->f - ptr->b;

      res[i].h = ptr->f;

      res[i].g = ptr->f - ptr->b;

      ptr++;

    }

  /* check results:  */

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

    {

      if (res[i].c != arr[i].b

          || res[i].a != arr[i].f + arr[i].b

          || res[i].d != arr[i].f - arr[i].b

          || res[i].b != arr[i].f

          || res[i].f != arr[i].b

          || res[i].e != arr[i].f - arr[i].b

          || res[i].h != arr[i].f

          || res[i].g != arr[i].f - arr[i].b)

          abort();

   }

}

int main (void)

{

  int i;

  s arr[N];

  check_vect ();

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

    {

      arr[i].a = i;

      arr[i].b = i * 2;

      arr[i].c = 17;

      arr[i].d = i+34;

      arr[i].e = i + 5;

      arr[i].f = i * 2 + 2;

      arr[i].g = i - 3;

      arr[i].h = 56;

      if (arr[i].a == 178)

         abort();

    }

  main1 (arr);

  return 0;

}

/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_interleave && vect_extract_even_odd } } } } */

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