/* { dg-require-effective-target vect_int } */
|
/* { dg-require-effective-target vect_int } */
|
|
|
#include <stdarg.h>
|
#include <stdarg.h>
|
#include <stdio.h>
|
#include <stdio.h>
|
#include "tree-vect.h"
|
#include "tree-vect.h"
|
|
|
#define N 128
|
#define N 128
|
|
|
__attribute__ ((noinline)) int
|
__attribute__ ((noinline)) int
|
main1 (unsigned short a0, unsigned short a1, unsigned short a2,
|
main1 (unsigned short a0, unsigned short a1, unsigned short a2,
|
unsigned short a3, unsigned short a4, unsigned short a5,
|
unsigned short a3, unsigned short a4, unsigned short a5,
|
unsigned short a6, unsigned short a7, unsigned short a8,
|
unsigned short a6, unsigned short a7, unsigned short a8,
|
unsigned short a9, unsigned short a10, unsigned short a11,
|
unsigned short a9, unsigned short a10, unsigned short a11,
|
unsigned short a12, unsigned short a13, unsigned short a14,
|
unsigned short a12, unsigned short a13, unsigned short a14,
|
unsigned short a15, unsigned char b0, unsigned char b1)
|
unsigned short a15, unsigned char b0, unsigned char b1)
|
{
|
{
|
int i;
|
int i;
|
unsigned short out[N*16];
|
unsigned short out[N*16];
|
unsigned char out2[N*16];
|
unsigned char out2[N*16];
|
|
|
for (i = 0; i < N; i++)
|
for (i = 0; i < N; i++)
|
{
|
{
|
out[i*16] = a8;
|
out[i*16] = a8;
|
out[i*16 + 1] = a7;
|
out[i*16 + 1] = a7;
|
out[i*16 + 2] = a1;
|
out[i*16 + 2] = a1;
|
out[i*16 + 3] = a2;
|
out[i*16 + 3] = a2;
|
out[i*16 + 4] = a8;
|
out[i*16 + 4] = a8;
|
out[i*16 + 5] = a5;
|
out[i*16 + 5] = a5;
|
out[i*16 + 6] = a5;
|
out[i*16 + 6] = a5;
|
out[i*16 + 7] = a4;
|
out[i*16 + 7] = a4;
|
out[i*16 + 8] = a12;
|
out[i*16 + 8] = a12;
|
out[i*16 + 9] = a13;
|
out[i*16 + 9] = a13;
|
out[i*16 + 10] = a14;
|
out[i*16 + 10] = a14;
|
out[i*16 + 11] = a15;
|
out[i*16 + 11] = a15;
|
out[i*16 + 12] = a6;
|
out[i*16 + 12] = a6;
|
out[i*16 + 13] = a9;
|
out[i*16 + 13] = a9;
|
out[i*16 + 14] = a0;
|
out[i*16 + 14] = a0;
|
out[i*16 + 15] = a7;
|
out[i*16 + 15] = a7;
|
|
|
out2[i*2] = b1;
|
out2[i*2] = b1;
|
out2[i*2+1] = b0;
|
out2[i*2+1] = b0;
|
}
|
}
|
|
|
/* check results: */
|
/* check results: */
|
for (i = 0; i < N; i++)
|
for (i = 0; i < N; i++)
|
{
|
{
|
if (out[i*16] != a8
|
if (out[i*16] != a8
|
|| out[i*16 + 1] != a7
|
|| out[i*16 + 1] != a7
|
|| out[i*16 + 2] != a1
|
|| out[i*16 + 2] != a1
|
|| out[i*16 + 3] != a2
|
|| out[i*16 + 3] != a2
|
|| out[i*16 + 4] != a8
|
|| out[i*16 + 4] != a8
|
|| out[i*16 + 5] != a5
|
|| out[i*16 + 5] != a5
|
|| out[i*16 + 6] != a5
|
|| out[i*16 + 6] != a5
|
|| out[i*16 + 7] != a4
|
|| out[i*16 + 7] != a4
|
|| out[i*16 + 8] != a12
|
|| out[i*16 + 8] != a12
|
|| out[i*16 + 9] != a13
|
|| out[i*16 + 9] != a13
|
|| out[i*16 + 10] != a14
|
|| out[i*16 + 10] != a14
|
|| out[i*16 + 11] != a15
|
|| out[i*16 + 11] != a15
|
|| out[i*16 + 12] != a6
|
|| out[i*16 + 12] != a6
|
|| out[i*16 + 13] != a9
|
|| out[i*16 + 13] != a9
|
|| out[i*16 + 14] != a0
|
|| out[i*16 + 14] != a0
|
|| out[i*16 + 15] != a7
|
|| out[i*16 + 15] != a7
|
|| out2[i*2] != b1
|
|| out2[i*2] != b1
|
|| out2[i*2 + 1] != b0)
|
|| out2[i*2 + 1] != b0)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
int main (void)
|
int main (void)
|
{
|
{
|
check_vect ();
|
check_vect ();
|
|
|
main1 (15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0,20,21);
|
main1 (15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0,20,21);
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
|
|
|
|
