blob: 88f9f0ddcbab55b84e619d9fb2086e093be95820 [file] [log] [blame]
/* { dg-require-effective-target vect_int } */
/* { dg-add-options bind_pic_locally } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
int ib[N+7];
int ia[N+1];
__attribute__ ((noinline))
int main1 ()
{
int i;
/* Don't peel keeping one load and the store aligned. */
for (i = 0; i <= N; i++)
{
ia[i] = ib[i] + ib[i+5];
}
/* check results: */
for (i = 1; i <= N; i++)
{
if (ia[i] != ib[i] + ib[i+5])
abort ();
}
return 0;
}
int main (void)
{
int i;
check_vect ();
for (i = 0; i <= N+6; i++)
{
asm volatile ("" : "+r" (i));
ib[i] = i;
}
return main1 ();
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail { vect_no_align && { ! vect_hw_misalign } } } } } */
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail { ! vect_unaligned_possible } } } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */