blob: 497563703cfe906252025ae234b7a75e7297998e (
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
53
54
55
56
57
58
59
60
61
|
/* { dg-require-effective-target vect_int } */
/* { dg-add-options quad_vectors } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
/* Unaligned stores. */
int ia[N+2];
short sa[N+2];
int main1 (int n)
{
int i;
for (i = 1; i <= N/2; i++)
{
ia[2*i] = 25;
ia[2*i + 1] = 5;
}
/* check results: */
for (i = 1; i <= N/2; i++)
{
if (ia[2*i] != 25
|| ia[2*i + 1] != 5)
abort ();
}
for (i = 1; i <= n/2; i++)
{
sa[2*i] = 25;
sa[2*i + 1] = 5;
}
/* check results: */
for (i = 1; i <= n/2; i++)
{
if (sa[2*i] != 25
|| sa[2*i + 1] != 5)
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 (N);
}
/* { 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 { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" { xfail { vect_no_align || { ! vect_natural_alignment } } } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
