blob: 9d21fc60062d0fc8493d9c313c1ad5ee98d71db4 (
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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
short Kernshort[24] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
static void VecBug(short Kernel[8][24]) __attribute__((noinline));
static void VecBug2(short Kernel[8][24]) __attribute__((noinline));
/* Kernel may alias Kernshort - a global array.
Use versioning for aliasing. */
static void VecBug(short Kernel[8][24])
{
int k,i;
for (k = 0; k<8; k++)
for (i = 0; i<24; i++)
Kernshort[i] = Kernel[k][i];
}
/* Vectorizable: Kernshort2 is local. */
static void VecBug2(short Kernel[8][24])
{
int k,i;
short Kernshort2[24] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
for (k = 0; k<8; k++)
for (i = 0; i<24; i++)
Kernshort2[i] = Kernel[k][i];
for (k = 0; k<8; k++)
for (i = 0; i<24; i++)
if (Kernshort2[i] != Kernel[k][i])
abort ();
}
int main (int argc, char **argv)
{
check_vect ();
short Kernel[8][24] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
int k,i;
for (k = 0; k<8; k++)
for (i = 0; i<24; i++)
Kernel[k][i] = 0;
VecBug(Kernel);
VecBug2(Kernel);
return 0;
}
/* The loops in VecBug and VecBug2 require versioning for alignment.
The loop in main is aligned. */
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 3 "vect" } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 2 "vect" { target vect_no_align } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
