blob: 7a6eb6180fc3906d8a925414f7ba0139cd1fe83c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
short sa[N];
short sb[N];
__attribute__ ((noinline))
int main1 ()
{
int i;
for (i = 0; i < N; i++)
{
sb[i] = 5;
}
/* check results: */
for (i = 0; i < N; i++)
{
if (sb[i] != 5)
abort ();
}
for (i = 0; i < N; i++)
{
sa[i] = sb[i] + 100;
}
/* check results: */
for (i = 0; i < N; i++)
{
if (sa[i] != 105)
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 ();
}
/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
