blob: 28b2941e581fa6abecbdafaa812cf4ff07ea9e5f [file] [log] [blame]
/* { dg-require-effective-target vect_int } */
/* { dg-add-options bind_pic_locally } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 64
int ia[N];
int ib[N]=
{1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0};
int ic[N] =
{1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0};
char ca[N];
char cb[N] =
{1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0};
char cc[N] =
{1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0};
short sa[N];
short sb[N] =
{1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0};
short sc[N] =
{1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0,
1,1,0,0,1,0,1,0};
__attribute__ ((noinline)) int
main1 ()
{
int i;
/* Check ints. */
for (i = 0; i < N; i++)
{
ia[i] = (ib[i] | ic[i]);
}
/* check results: */
for (i = 0; i <N; i++)
{
if (ia[i] != (ib[i] | ic[i]))
abort ();
}
/* Check chars. */
for (i = 0; i < N; i++)
{
ca[i] = (cb[i] | cc[i]);
}
/* check results: */
for (i = 0; i < N; i++)
{
if (ca[i] != (cb[i] | cc[i]))
abort ();
}
/* Check shorts. */
for (i = 0; i < N; i++)
{
sa[i] = (sb[i] | sc[i]);
}
/* check results: */
for (i = 0; i <N; i++)
{
if (sa[i] != (sb[i] | sc[i]))
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 ();
}
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail vect_no_bitwise } } } */
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */