blob: 26b71d654252bcd2e4591f11a78a4c0a3dad5d85 [file] [log] [blame]
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
int
main1 ()
{
int i;
unsigned short out[N*8];
for (i = 0; i < N; i++)
{
out[i*4] = 8;
out[i*4 + 1] = 18;
out[i*4 + 2] = 28;
out[i*4 + 3] = 38;
}
/* check results: */
for (i = 0; i < N; i++)
{
if (out[i*4] != 8
|| out[i*4 + 1] != 18
|| out[i*4 + 2] != 28
|| out[i*4 + 3] != 38)
abort ();
}
for (i = 0; i < N; i++)
{
out[i*8] = 8;
out[i*8 + 1] = 7;
out[i*8 + 2] = 81;
out[i*8 + 3] = 28;
out[i*8 + 4] = 18;
out[i*8 + 5] = 85;
out[i*8 + 6] = 5;
out[i*8 + 7] = 4;
}
/* check results: */
for (i = 0; i < N; i++)
{
if (out[i*8] != 8
|| out[i*8 + 1] != 7
|| out[i*8 + 2] != 81
|| out[i*8 + 3] != 28
|| out[i*8 + 4] != 18
|| out[i*8 + 5] != 85
|| out[i*8 + 6] != 5
|| out[i*8 + 7] != 4)
abort ();
}
/* SLP with unrolling by 8. */
for (i = 0; i < N; i++)
{
out[i*5] = 8;
out[i*5 + 1] = 7;
out[i*5 + 2] = 81;
out[i*5 + 3] = 28;
out[i*5 + 4] = 18;
}
/* check results: */
for (i = 0; i < N; i++)
{
if (out[i*5] != 8
|| out[i*5 + 1] != 7
|| out[i*5 + 2] != 81
|| out[i*5 + 3] != 28
|| out[i*5 + 4] != 18)
abort ();
}
/* SLP with unrolling by 8. */
for (i = 0; i < N/2; i++)
{
out[i*9] = 8;
out[i*9 + 1] = 7;
out[i*9 + 2] = 81;
out[i*9 + 3] = 28;
out[i*9 + 4] = 18;
out[i*9 + 5] = 85;
out[i*9 + 6] = 5;
out[i*9 + 7] = 4;
out[i*9 + 8] = 14;
}
/* check results: */
for (i = 0; i < N/2; i++)
{
if (out[i*9] != 8
|| out[i*9 + 1] != 7
|| out[i*9 + 2] != 81
|| out[i*9 + 3] != 28
|| out[i*9 + 4] != 18
|| out[i*9 + 5] != 85
|| out[i*9 + 6] != 5
|| out[i*9 + 7] != 4
|| out[i*9 + 8] != 14)
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
main1 ();
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 4 loops" 1 "vect" } } */
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 4 "vect" } } */