/* { dg-require-effective-target vect_int } */
|
/* { dg-require-effective-target vect_int } */
|
|
|
#include <stdarg.h>
|
#include <stdarg.h>
|
#include "tree-vect.h"
|
#include "tree-vect.h"
|
|
|
#define N 16
|
#define N 16
|
#define DIFF 242
|
#define DIFF 242
|
|
|
__attribute__ ((noinline))
|
__attribute__ ((noinline))
|
void main1 (short x, short max_result, short min_result)
|
void main1 (short x, short max_result, short min_result)
|
{
|
{
|
int i;
|
int i;
|
short b[N] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
|
short b[N] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
|
short c[N] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
|
short c[N] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
|
short diff = 2;
|
short diff = 2;
|
short max = x;
|
short max = x;
|
short min = x;
|
short min = x;
|
|
|
for (i = 0; i < N; i++) {
|
for (i = 0; i < N; i++) {
|
diff += (short)(b[i] - c[i]);
|
diff += (short)(b[i] - c[i]);
|
}
|
}
|
for (i = 0; i < N; i++) {
|
for (i = 0; i < N; i++) {
|
max = max < c[i] ? c[i] : max;
|
max = max < c[i] ? c[i] : max;
|
}
|
}
|
|
|
for (i = 0; i < N; i++) {
|
for (i = 0; i < N; i++) {
|
min = min > c[i] ? c[i] : min;
|
min = min > c[i] ? c[i] : min;
|
}
|
}
|
|
|
/* check results: */
|
/* check results: */
|
if (diff != DIFF)
|
if (diff != DIFF)
|
abort ();
|
abort ();
|
if (max != max_result)
|
if (max != max_result)
|
abort ();
|
abort ();
|
if (min != min_result)
|
if (min != min_result)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
int main (void)
|
int main (void)
|
{
|
{
|
check_vect ();
|
check_vect ();
|
|
|
main1 (100, 100, 1);
|
main1 (100, 100, 1);
|
main1 (0, 15, 0);
|
main1 (0, 15, 0);
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail *-*-* } } } */
|
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail *-*-* } } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
|
|